/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_9.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 15:53:07,954 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 15:53:07,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 15:53:08,019 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 15:53:08,020 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 15:53:08,022 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 15:53:08,023 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 15:53:08,025 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 15:53:08,026 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 15:53:08,030 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 15:53:08,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 15:53:08,031 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 15:53:08,032 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 15:53:08,033 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 15:53:08,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 15:53:08,036 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 15:53:08,036 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 15:53:08,037 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 15:53:08,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 15:53:08,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 15:53:08,043 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 15:53:08,044 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 15:53:08,045 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 15:53:08,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 15:53:08,050 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 15:53:08,050 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 15:53:08,050 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 15:53:08,051 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 15:53:08,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 15:53:08,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 15:53:08,052 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 15:53:08,052 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 15:53:08,053 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 15:53:08,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 15:53:08,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 15:53:08,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 15:53:08,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 15:53:08,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 15:53:08,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 15:53:08,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 15:53:08,056 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 15:53:08,057 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:08,079 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 15:53:08,080 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 15:53:08,080 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 15:53:08,080 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 15:53:08,081 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 15:53:08,081 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 15:53:08,081 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 15:53:08,081 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 15:53:08,081 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 15:53:08,081 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 15:53:08,082 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 15:53:08,082 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 15:53:08,082 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 15:53:08,082 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 15:53:08,082 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 15:53:08,082 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 15:53:08,082 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 15:53:08,082 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 15:53:08,083 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 15:53:08,083 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 15:53:08,083 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 15:53:08,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 15:53:08,083 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 15:53:08,083 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 15:53:08,083 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 15:53:08,083 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 15:53:08,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 15:53:08,083 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 15:53:08,083 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 15:53:08,084 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 15:53:08,084 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 15:53:08,084 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 15:53:08,084 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 15:53:08,084 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:08,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 15:53:08,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 15:53:08,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 15:53:08,295 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 15:53:08,298 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 15:53:08,299 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_9.c [2022-01-10 15:53:08,364 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f04122231/62673239626a4231b9d59b09b269b087/FLAG1d0a399ea [2022-01-10 15:53:08,701 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 15:53:08,702 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c [2022-01-10 15:53:08,706 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f04122231/62673239626a4231b9d59b09b269b087/FLAG1d0a399ea [2022-01-10 15:53:09,157 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f04122231/62673239626a4231b9d59b09b269b087 [2022-01-10 15:53:09,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 15:53:09,162 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 15:53:09,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 15:53:09,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 15:53:09,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 15:53:09,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:53:09" (1/1) ... [2022-01-10 15:53:09,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6586b45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:09, skipping insertion in model container [2022-01-10 15:53:09,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:53:09" (1/1) ... [2022-01-10 15:53:09,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 15:53:09,190 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 15:53:09,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c[3555,3568] [2022-01-10 15:53:09,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 15:53:09,366 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 15:53:09,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c[3555,3568] [2022-01-10 15:53:09,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 15:53:09,389 INFO L208 MainTranslator]: Completed translation [2022-01-10 15:53:09,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:09 WrapperNode [2022-01-10 15:53:09,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 15:53:09,390 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 15:53:09,390 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 15:53:09,390 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 15:53:09,395 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:09" (1/1) ... [2022-01-10 15:53:09,400 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:09" (1/1) ... [2022-01-10 15:53:09,412 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 117 [2022-01-10 15:53:09,413 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 15:53:09,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 15:53:09,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 15:53:09,413 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 15:53:09,418 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:09" (1/1) ... [2022-01-10 15:53:09,418 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:09" (1/1) ... [2022-01-10 15:53:09,420 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:09" (1/1) ... [2022-01-10 15:53:09,420 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:09" (1/1) ... [2022-01-10 15:53:09,423 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:09" (1/1) ... [2022-01-10 15:53:09,426 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:09" (1/1) ... [2022-01-10 15:53:09,427 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:09" (1/1) ... [2022-01-10 15:53:09,429 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 15:53:09,430 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 15:53:09,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 15:53:09,430 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 15:53:09,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:09" (1/1) ... [2022-01-10 15:53:09,449 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 15:53:09,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:53:09,485 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:09,504 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:09,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 15:53:09,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 15:53:09,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 15:53:09,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 15:53:09,559 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 15:53:09,560 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 15:53:09,683 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 15:53:09,687 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 15:53:09,688 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 15:53:09,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:53:09 BoogieIcfgContainer [2022-01-10 15:53:09,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 15:53:09,689 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 15:53:09,690 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 15:53:09,690 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 15:53:09,692 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:53:09" (1/1) ... [2022-01-10 15:53:09,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 03:53:09 BasicIcfg [2022-01-10 15:53:09,749 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 15:53:09,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 15:53:09,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 15:53:09,752 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 15:53:09,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:53:09" (1/4) ... [2022-01-10 15:53:09,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55240d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:53:09, skipping insertion in model container [2022-01-10 15:53:09,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:09" (2/4) ... [2022-01-10 15:53:09,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55240d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:53:09, skipping insertion in model container [2022-01-10 15:53:09,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:53:09" (3/4) ... [2022-01-10 15:53:09,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55240d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:53:09, skipping insertion in model container [2022-01-10 15:53:09,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 03:53:09" (4/4) ... [2022-01-10 15:53:09,754 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_9.cTransformedIcfg [2022-01-10 15:53:09,757 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 15:53:09,758 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 15:53:09,785 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 15:53:09,790 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:09,790 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 15:53:09,799 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:09,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 15:53:09,803 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:09,804 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:09,804 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:09,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:09,811 INFO L85 PathProgramCache]: Analyzing trace with hash 311032436, now seen corresponding path program 1 times [2022-01-10 15:53:09,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:09,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997497607] [2022-01-10 15:53:09,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:09,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:10,017 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,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:10,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997497607] [2022-01-10 15:53:10,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997497607] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:10,020 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:10,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:10,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916046854] [2022-01-10 15:53:10,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:10,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:10,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:10,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:10,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:10,052 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:10,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:10,111 INFO L93 Difference]: Finished difference Result 77 states and 133 transitions. [2022-01-10 15:53:10,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:10,114 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:10,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:10,119 INFO L225 Difference]: With dead ends: 77 [2022-01-10 15:53:10,120 INFO L226 Difference]: Without dead ends: 63 [2022-01-10 15:53:10,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:10,124 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 47 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:10,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 127 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:10,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-10 15:53:10,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 43. [2022-01-10 15:53:10,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:10,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 78 transitions. [2022-01-10 15:53:10,155 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 78 transitions. Word has length 16 [2022-01-10 15:53:10,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:10,156 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 78 transitions. [2022-01-10 15:53:10,156 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:10,156 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 78 transitions. [2022-01-10 15:53:10,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 15:53:10,157 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:10,157 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:10,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 15:53:10,157 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:10,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:10,158 INFO L85 PathProgramCache]: Analyzing trace with hash 440115155, now seen corresponding path program 1 times [2022-01-10 15:53:10,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:10,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346575487] [2022-01-10 15:53:10,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:10,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:10,221 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,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:10,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346575487] [2022-01-10 15:53:10,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346575487] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:10,221 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:10,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:10,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431445907] [2022-01-10 15:53:10,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:10,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:10,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:10,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:10,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:10,224 INFO L87 Difference]: Start difference. First operand 43 states and 78 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:10,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:10,236 INFO L93 Difference]: Finished difference Result 104 states and 189 transitions. [2022-01-10 15:53:10,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:10,237 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:10,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:10,238 INFO L225 Difference]: With dead ends: 104 [2022-01-10 15:53:10,238 INFO L226 Difference]: Without dead ends: 63 [2022-01-10 15:53:10,238 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,239 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 43 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:10,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 129 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:10,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-10 15:53:10,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2022-01-10 15:53:10,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 60 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:10,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 110 transitions. [2022-01-10 15:53:10,245 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 110 transitions. Word has length 16 [2022-01-10 15:53:10,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:10,245 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 110 transitions. [2022-01-10 15:53:10,245 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:10,246 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 110 transitions. [2022-01-10 15:53:10,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 15:53:10,246 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:10,246 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:10,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 15:53:10,247 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:10,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:10,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1052102913, now seen corresponding path program 1 times [2022-01-10 15:53:10,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:10,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559261389] [2022-01-10 15:53:10,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:10,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:10,285 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,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:10,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559261389] [2022-01-10 15:53:10,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559261389] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:10,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:10,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:10,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533292454] [2022-01-10 15:53:10,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:10,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:10,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:10,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:10,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:10,287 INFO L87 Difference]: Start difference. First operand 61 states and 110 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:10,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:10,301 INFO L93 Difference]: Finished difference Result 96 states and 168 transitions. [2022-01-10 15:53:10,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:10,303 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:10,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:10,303 INFO L225 Difference]: With dead ends: 96 [2022-01-10 15:53:10,304 INFO L226 Difference]: Without dead ends: 66 [2022-01-10 15:53:10,304 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,305 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 45 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:10,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 144 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:10,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-01-10 15:53:10,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-01-10 15:53:10,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 63 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:10,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 112 transitions. [2022-01-10 15:53:10,311 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 112 transitions. Word has length 17 [2022-01-10 15:53:10,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:10,311 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 112 transitions. [2022-01-10 15:53:10,311 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:10,311 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 112 transitions. [2022-01-10 15:53:10,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 15:53:10,312 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:10,312 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:10,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 15:53:10,312 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:10,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:10,313 INFO L85 PathProgramCache]: Analyzing trace with hash 758699906, now seen corresponding path program 1 times [2022-01-10 15:53:10,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:10,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780386541] [2022-01-10 15:53:10,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:10,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:10,352 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,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:10,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780386541] [2022-01-10 15:53:10,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780386541] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:10,352 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:10,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:10,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073615946] [2022-01-10 15:53:10,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:10,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:10,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:10,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:10,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:10,354 INFO L87 Difference]: Start difference. First operand 64 states and 112 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:10,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:10,364 INFO L93 Difference]: Finished difference Result 121 states and 213 transitions. [2022-01-10 15:53:10,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:10,365 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:10,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:10,366 INFO L225 Difference]: With dead ends: 121 [2022-01-10 15:53:10,366 INFO L226 Difference]: Without dead ends: 119 [2022-01-10 15:53:10,366 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,367 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 40 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:10,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 113 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:10,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-01-10 15:53:10,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 85. [2022-01-10 15:53:10,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 84 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:10,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 149 transitions. [2022-01-10 15:53:10,375 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 149 transitions. Word has length 17 [2022-01-10 15:53:10,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:10,375 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 149 transitions. [2022-01-10 15:53:10,375 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:10,375 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 149 transitions. [2022-01-10 15:53:10,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 15:53:10,376 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:10,376 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:10,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 15:53:10,376 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:10,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:10,377 INFO L85 PathProgramCache]: Analyzing trace with hash 887782625, now seen corresponding path program 1 times [2022-01-10 15:53:10,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:10,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680574840] [2022-01-10 15:53:10,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:10,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:10,415 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,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:10,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680574840] [2022-01-10 15:53:10,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680574840] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:10,416 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:10,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:10,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685041357] [2022-01-10 15:53:10,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:10,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:10,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:10,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:10,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:10,417 INFO L87 Difference]: Start difference. First operand 85 states and 149 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:10,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:10,429 INFO L93 Difference]: Finished difference Result 201 states and 355 transitions. [2022-01-10 15:53:10,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:10,429 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:10,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:10,430 INFO L225 Difference]: With dead ends: 201 [2022-01-10 15:53:10,430 INFO L226 Difference]: Without dead ends: 121 [2022-01-10 15:53:10,431 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,432 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:10,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 130 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:10,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-01-10 15:53:10,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2022-01-10 15:53:10,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.7542372881355932) internal successors, (207), 118 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:10,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 207 transitions. [2022-01-10 15:53:10,440 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 207 transitions. Word has length 17 [2022-01-10 15:53:10,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:10,440 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 207 transitions. [2022-01-10 15:53:10,440 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:10,441 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 207 transitions. [2022-01-10 15:53:10,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 15:53:10,441 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:10,441 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:10,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 15:53:10,442 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:10,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:10,442 INFO L85 PathProgramCache]: Analyzing trace with hash 2044892719, now seen corresponding path program 1 times [2022-01-10 15:53:10,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:10,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547559749] [2022-01-10 15:53:10,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:10,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:10,466 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,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:10,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547559749] [2022-01-10 15:53:10,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547559749] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:10,467 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:10,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:10,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486654940] [2022-01-10 15:53:10,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:10,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:10,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:10,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:10,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:10,468 INFO L87 Difference]: Start difference. First operand 119 states and 207 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:10,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:10,477 INFO L93 Difference]: Finished difference Result 180 states and 310 transitions. [2022-01-10 15:53:10,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:10,478 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:10,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:10,479 INFO L225 Difference]: With dead ends: 180 [2022-01-10 15:53:10,479 INFO L226 Difference]: Without dead ends: 123 [2022-01-10 15:53:10,479 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,480 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 44 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:10,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 140 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:10,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-01-10 15:53:10,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2022-01-10 15:53:10,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.725) internal successors, (207), 120 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:10,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 207 transitions. [2022-01-10 15:53:10,486 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 207 transitions. Word has length 18 [2022-01-10 15:53:10,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:10,486 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 207 transitions. [2022-01-10 15:53:10,486 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:10,487 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 207 transitions. [2022-01-10 15:53:10,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 15:53:10,487 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:10,487 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:10,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 15:53:10,488 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:10,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:10,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1751489712, now seen corresponding path program 1 times [2022-01-10 15:53:10,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:10,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244667402] [2022-01-10 15:53:10,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:10,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:10,522 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,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:10,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244667402] [2022-01-10 15:53:10,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244667402] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:10,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:10,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:10,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702604734] [2022-01-10 15:53:10,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:10,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:10,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:10,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:10,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:10,524 INFO L87 Difference]: Start difference. First operand 121 states and 207 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:10,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:10,532 INFO L93 Difference]: Finished difference Result 225 states and 389 transitions. [2022-01-10 15:53:10,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:10,533 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:10,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:10,534 INFO L225 Difference]: With dead ends: 225 [2022-01-10 15:53:10,534 INFO L226 Difference]: Without dead ends: 223 [2022-01-10 15:53:10,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:10,535 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 37 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:10,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 111 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:10,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-01-10 15:53:10,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 165. [2022-01-10 15:53:10,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.701219512195122) internal successors, (279), 164 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:10,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 279 transitions. [2022-01-10 15:53:10,543 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 279 transitions. Word has length 18 [2022-01-10 15:53:10,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:10,544 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 279 transitions. [2022-01-10 15:53:10,544 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:10,544 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 279 transitions. [2022-01-10 15:53:10,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 15:53:10,545 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:10,545 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:10,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 15:53:10,545 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:10,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:10,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1880572431, now seen corresponding path program 1 times [2022-01-10 15:53:10,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:10,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316789675] [2022-01-10 15:53:10,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:10,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:10,583 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,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:10,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316789675] [2022-01-10 15:53:10,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316789675] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:10,584 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:10,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:10,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864252271] [2022-01-10 15:53:10,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:10,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:10,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:10,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:10,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:10,585 INFO L87 Difference]: Start difference. First operand 165 states and 279 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:10,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:10,601 INFO L93 Difference]: Finished difference Result 389 states and 661 transitions. [2022-01-10 15:53:10,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:10,602 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:10,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:10,603 INFO L225 Difference]: With dead ends: 389 [2022-01-10 15:53:10,603 INFO L226 Difference]: Without dead ends: 231 [2022-01-10 15:53:10,603 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,604 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 41 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:10,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 131 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:10,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-01-10 15:53:10,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2022-01-10 15:53:10,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.6798245614035088) internal successors, (383), 228 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:10,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 383 transitions. [2022-01-10 15:53:10,612 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 383 transitions. Word has length 18 [2022-01-10 15:53:10,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:10,612 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 383 transitions. [2022-01-10 15:53:10,612 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:10,613 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 383 transitions. [2022-01-10 15:53:10,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 15:53:10,613 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:10,614 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:10,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 15:53:10,614 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:10,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:10,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1538361539, now seen corresponding path program 1 times [2022-01-10 15:53:10,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:10,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255425562] [2022-01-10 15:53:10,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:10,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:10,663 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,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:10,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255425562] [2022-01-10 15:53:10,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255425562] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:10,664 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:10,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:10,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949167464] [2022-01-10 15:53:10,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:10,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:10,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:10,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:10,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:10,666 INFO L87 Difference]: Start difference. First operand 229 states and 383 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:10,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:10,685 INFO L93 Difference]: Finished difference Result 345 states and 573 transitions. [2022-01-10 15:53:10,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:10,686 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:10,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:10,688 INFO L225 Difference]: With dead ends: 345 [2022-01-10 15:53:10,688 INFO L226 Difference]: Without dead ends: 235 [2022-01-10 15:53:10,689 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,689 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 43 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:10,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 136 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:10,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-01-10 15:53:10,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2022-01-10 15:53:10,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 1.6508620689655173) internal successors, (383), 232 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 383 transitions. [2022-01-10 15:53:10,697 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 383 transitions. Word has length 19 [2022-01-10 15:53:10,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:10,698 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 383 transitions. [2022-01-10 15:53:10,698 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:10,698 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 383 transitions. [2022-01-10 15:53:10,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 15:53:10,699 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:10,704 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:10,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 15:53:10,705 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:10,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:10,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1831764546, now seen corresponding path program 1 times [2022-01-10 15:53:10,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:10,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520700227] [2022-01-10 15:53:10,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:10,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:10,764 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,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:10,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520700227] [2022-01-10 15:53:10,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520700227] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:10,764 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:10,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:10,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258431268] [2022-01-10 15:53:10,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:10,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:10,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:10,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:10,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:10,768 INFO L87 Difference]: Start difference. First operand 233 states and 383 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:10,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:10,783 INFO L93 Difference]: Finished difference Result 425 states and 709 transitions. [2022-01-10 15:53:10,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:10,783 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:10,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:10,785 INFO L225 Difference]: With dead ends: 425 [2022-01-10 15:53:10,785 INFO L226 Difference]: Without dead ends: 423 [2022-01-10 15:53:10,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:10,786 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 34 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:10,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 109 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:10,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-01-10 15:53:10,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 325. [2022-01-10 15:53:10,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 1.6141975308641976) internal successors, (523), 324 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:10,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 523 transitions. [2022-01-10 15:53:10,796 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 523 transitions. Word has length 19 [2022-01-10 15:53:10,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:10,796 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 523 transitions. [2022-01-10 15:53:10,796 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:10,796 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 523 transitions. [2022-01-10 15:53:10,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 15:53:10,797 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:10,797 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:53:10,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 15:53:10,798 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:10,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:10,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1702681827, now seen corresponding path program 1 times [2022-01-10 15:53:10,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:10,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027498219] [2022-01-10 15:53:10,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:10,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:10,814 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,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:10,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027498219] [2022-01-10 15:53:10,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027498219] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:10,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:10,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:10,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393208646] [2022-01-10 15:53:10,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:10,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:10,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:10,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:10,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:10,816 INFO L87 Difference]: Start difference. First operand 325 states and 523 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:10,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:10,827 INFO L93 Difference]: Finished difference Result 761 states and 1229 transitions. [2022-01-10 15:53:10,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:10,827 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:10,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:10,829 INFO L225 Difference]: With dead ends: 761 [2022-01-10 15:53:10,829 INFO L226 Difference]: Without dead ends: 447 [2022-01-10 15:53:10,830 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,830 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 40 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:10,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 132 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:10,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-01-10 15:53:10,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 445. [2022-01-10 15:53:10,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 1.5923423423423424) internal successors, (707), 444 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:10,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 707 transitions. [2022-01-10 15:53:10,844 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 707 transitions. Word has length 19 [2022-01-10 15:53:10,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:10,845 INFO L470 AbstractCegarLoop]: Abstraction has 445 states and 707 transitions. [2022-01-10 15:53:10,845 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:10,845 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 707 transitions. [2022-01-10 15:53:10,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 15:53:10,846 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:10,846 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:10,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 15:53:10,846 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:10,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:10,847 INFO L85 PathProgramCache]: Analyzing trace with hash -950093717, now seen corresponding path program 1 times [2022-01-10 15:53:10,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:10,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973262745] [2022-01-10 15:53:10,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:10,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:10,866 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,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:10,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973262745] [2022-01-10 15:53:10,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973262745] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:10,867 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:10,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:10,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879991017] [2022-01-10 15:53:10,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:10,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:10,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:10,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:10,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:10,868 INFO L87 Difference]: Start difference. First operand 445 states and 707 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:10,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:10,882 INFO L93 Difference]: Finished difference Result 669 states and 1057 transitions. [2022-01-10 15:53:10,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:10,883 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:10,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:10,885 INFO L225 Difference]: With dead ends: 669 [2022-01-10 15:53:10,885 INFO L226 Difference]: Without dead ends: 455 [2022-01-10 15:53:10,885 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,886 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 42 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:10,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 132 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:10,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-01-10 15:53:10,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 453. [2022-01-10 15:53:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.5641592920353982) internal successors, (707), 452 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:10,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 707 transitions. [2022-01-10 15:53:10,897 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 707 transitions. Word has length 20 [2022-01-10 15:53:10,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:10,897 INFO L470 AbstractCegarLoop]: Abstraction has 453 states and 707 transitions. [2022-01-10 15:53:10,898 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:10,898 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 707 transitions. [2022-01-10 15:53:10,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 15:53:10,899 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:10,899 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:10,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 15:53:10,899 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:10,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:10,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1243496724, now seen corresponding path program 1 times [2022-01-10 15:53:10,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:10,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137183149] [2022-01-10 15:53:10,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:10,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:10,930 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,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:10,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137183149] [2022-01-10 15:53:10,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137183149] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:10,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:10,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:10,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720656938] [2022-01-10 15:53:10,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:10,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:10,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:10,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:10,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:10,933 INFO L87 Difference]: Start difference. First operand 453 states and 707 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:10,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:10,949 INFO L93 Difference]: Finished difference Result 809 states and 1285 transitions. [2022-01-10 15:53:10,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:10,950 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:10,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:10,952 INFO L225 Difference]: With dead ends: 809 [2022-01-10 15:53:10,952 INFO L226 Difference]: Without dead ends: 807 [2022-01-10 15:53:10,953 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,957 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 31 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:10,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 107 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:10,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2022-01-10 15:53:10,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 645. [2022-01-10 15:53:10,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 1.5201863354037266) internal successors, (979), 644 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:10,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 979 transitions. [2022-01-10 15:53:10,975 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 979 transitions. Word has length 20 [2022-01-10 15:53:10,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:10,976 INFO L470 AbstractCegarLoop]: Abstraction has 645 states and 979 transitions. [2022-01-10 15:53:10,976 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:10,976 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 979 transitions. [2022-01-10 15:53:10,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 15:53:10,978 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:10,978 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:10,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 15:53:10,978 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:10,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:10,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1114414005, now seen corresponding path program 1 times [2022-01-10 15:53:10,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:10,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877451652] [2022-01-10 15:53:10,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:10,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:11,012 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:11,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:11,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877451652] [2022-01-10 15:53:11,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877451652] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:11,013 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:11,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:11,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576763021] [2022-01-10 15:53:11,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:11,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:11,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:11,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:11,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:11,014 INFO L87 Difference]: Start difference. First operand 645 states and 979 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:11,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:11,032 INFO L93 Difference]: Finished difference Result 1497 states and 2277 transitions. [2022-01-10 15:53:11,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:11,032 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:11,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:11,036 INFO L225 Difference]: With dead ends: 1497 [2022-01-10 15:53:11,037 INFO L226 Difference]: Without dead ends: 871 [2022-01-10 15:53:11,038 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:11,039 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 39 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:11,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 133 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:11,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-01-10 15:53:11,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 869. [2022-01-10 15:53:11,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 1.4965437788018434) internal successors, (1299), 868 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:11,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1299 transitions. [2022-01-10 15:53:11,056 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1299 transitions. Word has length 20 [2022-01-10 15:53:11,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:11,056 INFO L470 AbstractCegarLoop]: Abstraction has 869 states and 1299 transitions. [2022-01-10 15:53:11,056 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:11,056 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1299 transitions. [2022-01-10 15:53:11,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 15:53:11,058 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:11,058 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:11,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 15:53:11,058 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:11,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:11,059 INFO L85 PathProgramCache]: Analyzing trace with hash 106339705, now seen corresponding path program 1 times [2022-01-10 15:53:11,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:11,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920915003] [2022-01-10 15:53:11,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:11,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:11,093 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:11,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:11,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920915003] [2022-01-10 15:53:11,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920915003] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:11,093 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:11,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:11,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638879628] [2022-01-10 15:53:11,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:11,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:11,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:11,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:11,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:11,094 INFO L87 Difference]: Start difference. First operand 869 states and 1299 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:11,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:11,107 INFO L93 Difference]: Finished difference Result 1305 states and 1941 transitions. [2022-01-10 15:53:11,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:11,107 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:11,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:11,109 INFO L225 Difference]: With dead ends: 1305 [2022-01-10 15:53:11,109 INFO L226 Difference]: Without dead ends: 887 [2022-01-10 15:53:11,110 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:11,110 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 41 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:11,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:11,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2022-01-10 15:53:11,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2022-01-10 15:53:11,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 1.4694570135746607) internal successors, (1299), 884 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:11,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1299 transitions. [2022-01-10 15:53:11,124 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1299 transitions. Word has length 21 [2022-01-10 15:53:11,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:11,124 INFO L470 AbstractCegarLoop]: Abstraction has 885 states and 1299 transitions. [2022-01-10 15:53:11,124 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:11,124 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1299 transitions. [2022-01-10 15:53:11,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 15:53:11,125 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:11,125 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:11,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 15:53:11,125 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:11,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:11,126 INFO L85 PathProgramCache]: Analyzing trace with hash -187063302, now seen corresponding path program 1 times [2022-01-10 15:53:11,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:11,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892885666] [2022-01-10 15:53:11,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:11,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:11,148 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:11,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:11,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892885666] [2022-01-10 15:53:11,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892885666] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:11,150 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:11,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:11,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395074847] [2022-01-10 15:53:11,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:11,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:11,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:11,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:11,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:11,151 INFO L87 Difference]: Start difference. First operand 885 states and 1299 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:11,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:11,174 INFO L93 Difference]: Finished difference Result 1545 states and 2309 transitions. [2022-01-10 15:53:11,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:11,175 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:11,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:11,178 INFO L225 Difference]: With dead ends: 1545 [2022-01-10 15:53:11,178 INFO L226 Difference]: Without dead ends: 1543 [2022-01-10 15:53:11,179 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:11,179 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 28 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:11,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 105 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:11,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2022-01-10 15:53:11,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1285. [2022-01-10 15:53:11,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 1284 states have (on average 1.4228971962616823) internal successors, (1827), 1284 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:11,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1827 transitions. [2022-01-10 15:53:11,202 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1827 transitions. Word has length 21 [2022-01-10 15:53:11,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:11,203 INFO L470 AbstractCegarLoop]: Abstraction has 1285 states and 1827 transitions. [2022-01-10 15:53:11,203 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:11,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1827 transitions. [2022-01-10 15:53:11,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 15:53:11,204 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:11,204 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:11,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 15:53:11,204 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:11,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:11,204 INFO L85 PathProgramCache]: Analyzing trace with hash -57980583, now seen corresponding path program 1 times [2022-01-10 15:53:11,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:11,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456845608] [2022-01-10 15:53:11,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:11,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:11,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:11,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:11,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456845608] [2022-01-10 15:53:11,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456845608] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:11,222 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:11,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:11,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616221149] [2022-01-10 15:53:11,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:11,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:11,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:11,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:11,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:11,223 INFO L87 Difference]: Start difference. First operand 1285 states and 1827 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:11,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:11,247 INFO L93 Difference]: Finished difference Result 2953 states and 4197 transitions. [2022-01-10 15:53:11,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:11,247 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:11,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:11,251 INFO L225 Difference]: With dead ends: 2953 [2022-01-10 15:53:11,251 INFO L226 Difference]: Without dead ends: 1703 [2022-01-10 15:53:11,252 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:11,252 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 38 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:11,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 134 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:11,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2022-01-10 15:53:11,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1701. [2022-01-10 15:53:11,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1700 states have (on average 1.3947058823529412) internal successors, (2371), 1700 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:11,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2371 transitions. [2022-01-10 15:53:11,296 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2371 transitions. Word has length 21 [2022-01-10 15:53:11,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:11,296 INFO L470 AbstractCegarLoop]: Abstraction has 1701 states and 2371 transitions. [2022-01-10 15:53:11,297 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:11,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2371 transitions. [2022-01-10 15:53:11,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 15:53:11,298 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:11,298 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:11,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 15:53:11,298 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:11,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:11,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1503962457, now seen corresponding path program 1 times [2022-01-10 15:53:11,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:11,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860233975] [2022-01-10 15:53:11,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:11,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:11,321 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:11,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:11,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860233975] [2022-01-10 15:53:11,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860233975] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:11,322 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:11,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:11,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098510104] [2022-01-10 15:53:11,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:11,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:11,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:11,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:11,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:11,322 INFO L87 Difference]: Start difference. First operand 1701 states and 2371 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:11,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:11,343 INFO L93 Difference]: Finished difference Result 2553 states and 3541 transitions. [2022-01-10 15:53:11,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:11,343 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:11,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:11,347 INFO L225 Difference]: With dead ends: 2553 [2022-01-10 15:53:11,347 INFO L226 Difference]: Without dead ends: 1735 [2022-01-10 15:53:11,349 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:11,349 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 40 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:11,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 124 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:11,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2022-01-10 15:53:11,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1733. [2022-01-10 15:53:11,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1732 states have (on average 1.3689376443418013) internal successors, (2371), 1732 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:11,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2371 transitions. [2022-01-10 15:53:11,379 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2371 transitions. Word has length 22 [2022-01-10 15:53:11,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:11,379 INFO L470 AbstractCegarLoop]: Abstraction has 1733 states and 2371 transitions. [2022-01-10 15:53:11,379 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:11,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2371 transitions. [2022-01-10 15:53:11,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 15:53:11,381 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:11,381 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:11,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 15:53:11,381 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:11,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:11,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1797365464, now seen corresponding path program 1 times [2022-01-10 15:53:11,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:11,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722627236] [2022-01-10 15:53:11,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:11,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:11,400 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:11,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:11,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722627236] [2022-01-10 15:53:11,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722627236] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:11,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:11,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:11,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783731020] [2022-01-10 15:53:11,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:11,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:11,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:11,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:11,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:11,402 INFO L87 Difference]: Start difference. First operand 1733 states and 2371 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:11,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:11,444 INFO L93 Difference]: Finished difference Result 2953 states and 4101 transitions. [2022-01-10 15:53:11,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:11,445 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:11,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:11,452 INFO L225 Difference]: With dead ends: 2953 [2022-01-10 15:53:11,452 INFO L226 Difference]: Without dead ends: 2951 [2022-01-10 15:53:11,453 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:11,454 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 25 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:11,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 103 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:11,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2022-01-10 15:53:11,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2565. [2022-01-10 15:53:11,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2565 states, 2564 states have (on average 1.3241029641185647) internal successors, (3395), 2564 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:11,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 3395 transitions. [2022-01-10 15:53:11,501 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 3395 transitions. Word has length 22 [2022-01-10 15:53:11,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:11,501 INFO L470 AbstractCegarLoop]: Abstraction has 2565 states and 3395 transitions. [2022-01-10 15:53:11,501 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:11,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3395 transitions. [2022-01-10 15:53:11,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 15:53:11,504 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:11,504 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:11,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 15:53:11,504 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:11,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:11,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1668282745, now seen corresponding path program 1 times [2022-01-10 15:53:11,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:11,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785190504] [2022-01-10 15:53:11,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:11,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:11,522 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:11,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:11,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785190504] [2022-01-10 15:53:11,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785190504] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:11,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:11,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:11,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466048488] [2022-01-10 15:53:11,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:11,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:11,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:11,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:11,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:11,523 INFO L87 Difference]: Start difference. First operand 2565 states and 3395 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:11,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:11,562 INFO L93 Difference]: Finished difference Result 5833 states and 7685 transitions. [2022-01-10 15:53:11,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:11,562 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:11,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:11,570 INFO L225 Difference]: With dead ends: 5833 [2022-01-10 15:53:11,570 INFO L226 Difference]: Without dead ends: 3335 [2022-01-10 15:53:11,573 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:11,575 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 37 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:11,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 135 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:11,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2022-01-10 15:53:11,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 3333. [2022-01-10 15:53:11,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3333 states, 3332 states have (on average 1.2878151260504203) internal successors, (4291), 3332 states have internal predecessors, (4291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:11,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 4291 transitions. [2022-01-10 15:53:11,659 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 4291 transitions. Word has length 22 [2022-01-10 15:53:11,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:11,660 INFO L470 AbstractCegarLoop]: Abstraction has 3333 states and 4291 transitions. [2022-01-10 15:53:11,660 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:11,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 4291 transitions. [2022-01-10 15:53:11,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 15:53:11,662 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:11,662 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:53:11,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 15:53:11,662 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:11,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:11,663 INFO L85 PathProgramCache]: Analyzing trace with hash 116278197, now seen corresponding path program 1 times [2022-01-10 15:53:11,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:11,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724639418] [2022-01-10 15:53:11,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:11,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:11,680 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:11,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:11,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724639418] [2022-01-10 15:53:11,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724639418] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:11,680 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:11,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:11,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982455118] [2022-01-10 15:53:11,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:11,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:11,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:11,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:11,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:11,682 INFO L87 Difference]: Start difference. First operand 3333 states and 4291 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:11,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:11,719 INFO L93 Difference]: Finished difference Result 5001 states and 6405 transitions. [2022-01-10 15:53:11,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:11,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-10 15:53:11,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:11,727 INFO L225 Difference]: With dead ends: 5001 [2022-01-10 15:53:11,727 INFO L226 Difference]: Without dead ends: 3399 [2022-01-10 15:53:11,729 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:11,729 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 39 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:11,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 120 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:11,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2022-01-10 15:53:11,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 3397. [2022-01-10 15:53:11,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3397 states, 3396 states have (on average 1.263545347467609) internal successors, (4291), 3396 states have internal predecessors, (4291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:11,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3397 states to 3397 states and 4291 transitions. [2022-01-10 15:53:11,791 INFO L78 Accepts]: Start accepts. Automaton has 3397 states and 4291 transitions. Word has length 23 [2022-01-10 15:53:11,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:11,791 INFO L470 AbstractCegarLoop]: Abstraction has 3397 states and 4291 transitions. [2022-01-10 15:53:11,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:11,791 INFO L276 IsEmpty]: Start isEmpty. Operand 3397 states and 4291 transitions. [2022-01-10 15:53:11,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 15:53:11,793 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:11,794 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:53:11,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 15:53:11,794 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:11,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:11,794 INFO L85 PathProgramCache]: Analyzing trace with hash -177124810, now seen corresponding path program 1 times [2022-01-10 15:53:11,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:11,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347196201] [2022-01-10 15:53:11,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:11,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:11,820 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:11,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:11,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347196201] [2022-01-10 15:53:11,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347196201] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:11,821 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:11,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:11,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98594743] [2022-01-10 15:53:11,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:11,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:11,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:11,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:11,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:11,822 INFO L87 Difference]: Start difference. First operand 3397 states and 4291 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:11,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:11,907 INFO L93 Difference]: Finished difference Result 5641 states and 7173 transitions. [2022-01-10 15:53:11,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:11,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-10 15:53:11,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:11,928 INFO L225 Difference]: With dead ends: 5641 [2022-01-10 15:53:11,928 INFO L226 Difference]: Without dead ends: 5639 [2022-01-10 15:53:11,930 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:11,932 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 22 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:11,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 101 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:11,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2022-01-10 15:53:11,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 5125. [2022-01-10 15:53:12,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5125 states, 5124 states have (on average 1.2246291959406714) internal successors, (6275), 5124 states have internal predecessors, (6275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:12,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5125 states to 5125 states and 6275 transitions. [2022-01-10 15:53:12,013 INFO L78 Accepts]: Start accepts. Automaton has 5125 states and 6275 transitions. Word has length 23 [2022-01-10 15:53:12,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:12,013 INFO L470 AbstractCegarLoop]: Abstraction has 5125 states and 6275 transitions. [2022-01-10 15:53:12,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:12,013 INFO L276 IsEmpty]: Start isEmpty. Operand 5125 states and 6275 transitions. [2022-01-10 15:53:12,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 15:53:12,018 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:12,018 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:53:12,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 15:53:12,018 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:12,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:12,018 INFO L85 PathProgramCache]: Analyzing trace with hash -48042091, now seen corresponding path program 1 times [2022-01-10 15:53:12,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:12,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751726508] [2022-01-10 15:53:12,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:12,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:12,033 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:12,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:12,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751726508] [2022-01-10 15:53:12,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751726508] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:12,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:12,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:12,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81856374] [2022-01-10 15:53:12,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:12,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:12,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:12,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:12,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:12,034 INFO L87 Difference]: Start difference. First operand 5125 states and 6275 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:12,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:12,108 INFO L93 Difference]: Finished difference Result 11529 states and 13957 transitions. [2022-01-10 15:53:12,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:12,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-10 15:53:12,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:12,131 INFO L225 Difference]: With dead ends: 11529 [2022-01-10 15:53:12,132 INFO L226 Difference]: Without dead ends: 6535 [2022-01-10 15:53:12,136 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:12,136 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 36 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:12,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 136 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:12,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6535 states. [2022-01-10 15:53:12,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6535 to 6533. [2022-01-10 15:53:12,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6533 states, 6532 states have (on average 1.1762094304960196) internal successors, (7683), 6532 states have internal predecessors, (7683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:12,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6533 states to 6533 states and 7683 transitions. [2022-01-10 15:53:12,293 INFO L78 Accepts]: Start accepts. Automaton has 6533 states and 7683 transitions. Word has length 23 [2022-01-10 15:53:12,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:12,293 INFO L470 AbstractCegarLoop]: Abstraction has 6533 states and 7683 transitions. [2022-01-10 15:53:12,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:12,294 INFO L276 IsEmpty]: Start isEmpty. Operand 6533 states and 7683 transitions. [2022-01-10 15:53:12,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 15:53:12,299 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:12,299 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:53:12,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 15:53:12,299 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:12,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:12,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1195868957, now seen corresponding path program 1 times [2022-01-10 15:53:12,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:12,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54212671] [2022-01-10 15:53:12,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:12,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:12,313 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:12,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:12,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54212671] [2022-01-10 15:53:12,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54212671] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:12,315 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:12,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:12,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543470127] [2022-01-10 15:53:12,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:12,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:12,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:12,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:12,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:12,316 INFO L87 Difference]: Start difference. First operand 6533 states and 7683 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:12,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:12,382 INFO L93 Difference]: Finished difference Result 9801 states and 11461 transitions. [2022-01-10 15:53:12,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:12,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-01-10 15:53:12,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:12,394 INFO L225 Difference]: With dead ends: 9801 [2022-01-10 15:53:12,394 INFO L226 Difference]: Without dead ends: 6663 [2022-01-10 15:53:12,398 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:12,399 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 38 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:12,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 116 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:12,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6663 states. [2022-01-10 15:53:12,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6663 to 6661. [2022-01-10 15:53:12,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6661 states, 6660 states have (on average 1.1536036036036037) internal successors, (7683), 6660 states have internal predecessors, (7683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:12,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 7683 transitions. [2022-01-10 15:53:12,541 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 7683 transitions. Word has length 24 [2022-01-10 15:53:12,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:12,541 INFO L470 AbstractCegarLoop]: Abstraction has 6661 states and 7683 transitions. [2022-01-10 15:53:12,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:12,541 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 7683 transitions. [2022-01-10 15:53:12,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 15:53:12,546 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:12,546 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:53:12,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 15:53:12,546 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:12,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:12,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1489271964, now seen corresponding path program 1 times [2022-01-10 15:53:12,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:12,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383426922] [2022-01-10 15:53:12,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:12,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:12,560 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:12,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:12,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383426922] [2022-01-10 15:53:12,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383426922] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:12,560 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:12,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:12,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761837304] [2022-01-10 15:53:12,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:12,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:12,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:12,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:12,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:12,561 INFO L87 Difference]: Start difference. First operand 6661 states and 7683 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:12,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:12,652 INFO L93 Difference]: Finished difference Result 10759 states and 12292 transitions. [2022-01-10 15:53:12,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:12,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-01-10 15:53:12,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:12,668 INFO L225 Difference]: With dead ends: 10759 [2022-01-10 15:53:12,668 INFO L226 Difference]: Without dead ends: 10757 [2022-01-10 15:53:12,671 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:12,672 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 18 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:12,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 98 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:12,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10757 states. [2022-01-10 15:53:12,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10757 to 10245. [2022-01-10 15:53:12,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10245 states, 10244 states have (on average 1.124853572823116) internal successors, (11523), 10244 states have internal predecessors, (11523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:12,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10245 states to 10245 states and 11523 transitions. [2022-01-10 15:53:12,865 INFO L78 Accepts]: Start accepts. Automaton has 10245 states and 11523 transitions. Word has length 24 [2022-01-10 15:53:12,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:12,865 INFO L470 AbstractCegarLoop]: Abstraction has 10245 states and 11523 transitions. [2022-01-10 15:53:12,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:12,865 INFO L276 IsEmpty]: Start isEmpty. Operand 10245 states and 11523 transitions. [2022-01-10 15:53:12,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 15:53:12,874 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:12,874 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:53:12,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 15:53:12,874 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:12,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:12,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1360189245, now seen corresponding path program 1 times [2022-01-10 15:53:12,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:12,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200137830] [2022-01-10 15:53:12,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:12,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:12,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:12,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:12,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200137830] [2022-01-10 15:53:12,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200137830] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:12,888 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:12,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:12,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020952229] [2022-01-10 15:53:12,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:12,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:12,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:12,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:12,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:12,890 INFO L87 Difference]: Start difference. First operand 10245 states and 11523 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:13,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:13,023 INFO L93 Difference]: Finished difference Result 22789 states and 25091 transitions. [2022-01-10 15:53:13,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:13,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-01-10 15:53:13,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:13,023 INFO L225 Difference]: With dead ends: 22789 [2022-01-10 15:53:13,024 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 15:53:13,036 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:13,037 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 34 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:13,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 135 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:13,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 15:53:13,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 15:53:13,039 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:13,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 15:53:13,039 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-01-10 15:53:13,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:13,039 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 15:53:13,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:13,039 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 15:53:13,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 15:53:13,041 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 15:53:13,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 15:53:13,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 15:53:13,055 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 15:53:13,055 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 15:53:13,055 INFO L861 garLoopResultBuilder]: At program point L141-1(lines 38 146) the Hoare annotation is: true [2022-01-10 15:53:13,055 INFO L861 garLoopResultBuilder]: At program point L147(lines 7 151) the Hoare annotation is: true [2022-01-10 15:53:13,055 INFO L858 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2022-01-10 15:53:13,055 INFO L861 garLoopResultBuilder]: At program point L150(lines 6 151) the Hoare annotation is: true [2022-01-10 15:53:13,055 INFO L858 garLoopResultBuilder]: For program point L63(lines 63 65) no Hoare annotation was computed. [2022-01-10 15:53:13,055 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 15:53:13,055 INFO L858 garLoopResultBuilder]: For program point L63-2(lines 38 146) no Hoare annotation was computed. [2022-01-10 15:53:13,055 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 15:53:13,056 INFO L858 garLoopResultBuilder]: For program point L67-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 15:53:13,056 INFO L858 garLoopResultBuilder]: For program point L71-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 15:53:13,056 INFO L858 garLoopResultBuilder]: For program point L75-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 15:53:13,056 INFO L858 garLoopResultBuilder]: For program point L79-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 15:53:13,056 INFO L858 garLoopResultBuilder]: For program point L83-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 15:53:13,056 INFO L858 garLoopResultBuilder]: For program point L87-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 15:53:13,056 INFO L858 garLoopResultBuilder]: For program point L91-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 15:53:13,056 INFO L858 garLoopResultBuilder]: For program point L95-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 15:53:13,056 INFO L858 garLoopResultBuilder]: For program point L102(line 102) no Hoare annotation was computed. [2022-01-10 15:53:13,056 INFO L858 garLoopResultBuilder]: For program point L101-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 15:53:13,056 INFO L854 garLoopResultBuilder]: At program point L142-1(lines 7 151) the Hoare annotation is: false [2022-01-10 15:53:13,057 INFO L858 garLoopResultBuilder]: For program point L107(line 107) no Hoare annotation was computed. [2022-01-10 15:53:13,057 INFO L858 garLoopResultBuilder]: For program point L106-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 15:53:13,057 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2022-01-10 15:53:13,057 INFO L858 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2022-01-10 15:53:13,057 INFO L858 garLoopResultBuilder]: For program point L111-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 15:53:13,057 INFO L858 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2022-01-10 15:53:13,057 INFO L858 garLoopResultBuilder]: For program point L116-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 15:53:13,057 INFO L858 garLoopResultBuilder]: For program point L122(line 122) no Hoare annotation was computed. [2022-01-10 15:53:13,057 INFO L858 garLoopResultBuilder]: For program point L121-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 15:53:13,057 INFO L858 garLoopResultBuilder]: For program point L127(line 127) no Hoare annotation was computed. [2022-01-10 15:53:13,057 INFO L858 garLoopResultBuilder]: For program point L126-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 15:53:13,057 INFO L858 garLoopResultBuilder]: For program point L132(line 132) no Hoare annotation was computed. [2022-01-10 15:53:13,057 INFO L858 garLoopResultBuilder]: For program point L131-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 15:53:13,057 INFO L858 garLoopResultBuilder]: For program point L137(line 137) no Hoare annotation was computed. [2022-01-10 15:53:13,057 INFO L858 garLoopResultBuilder]: For program point L136-1(lines 38 146) no Hoare annotation was computed. [2022-01-10 15:53:13,057 INFO L858 garLoopResultBuilder]: For program point L142(line 142) no Hoare annotation was computed. [2022-01-10 15:53:13,061 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:53:13,064 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 15:53:13,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:53:13 BasicIcfg [2022-01-10 15:53:13,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 15:53:13,071 INFO L158 Benchmark]: Toolchain (without parser) took 3909.01ms. Allocated memory was 204.5MB in the beginning and 313.5MB in the end (delta: 109.1MB). Free memory was 156.2MB in the beginning and 96.4MB in the end (delta: 59.8MB). Peak memory consumption was 169.8MB. Max. memory is 8.0GB. [2022-01-10 15:53:13,071 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 204.5MB. Free memory is still 172.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 15:53:13,071 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.43ms. Allocated memory is still 204.5MB. Free memory was 156.0MB in the beginning and 182.2MB in the end (delta: -26.3MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. [2022-01-10 15:53:13,071 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.85ms. Allocated memory is still 204.5MB. Free memory was 182.2MB in the beginning and 180.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 15:53:13,071 INFO L158 Benchmark]: Boogie Preprocessor took 15.88ms. Allocated memory is still 204.5MB. Free memory was 180.8MB in the beginning and 179.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 15:53:13,071 INFO L158 Benchmark]: RCFGBuilder took 259.40ms. Allocated memory is still 204.5MB. Free memory was 179.2MB in the beginning and 168.2MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-10 15:53:13,073 INFO L158 Benchmark]: IcfgTransformer took 59.72ms. Allocated memory is still 204.5MB. Free memory was 168.2MB in the beginning and 163.5MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-10 15:53:13,073 INFO L158 Benchmark]: TraceAbstraction took 3320.23ms. Allocated memory was 204.5MB in the beginning and 313.5MB in the end (delta: 109.1MB). Free memory was 162.9MB in the beginning and 96.4MB in the end (delta: 66.5MB). Peak memory consumption was 176.6MB. Max. memory is 8.0GB. [2022-01-10 15:53:13,077 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.10ms. Allocated memory is still 204.5MB. Free memory is still 172.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 225.43ms. Allocated memory is still 204.5MB. Free memory was 156.0MB in the beginning and 182.2MB in the end (delta: -26.3MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.85ms. Allocated memory is still 204.5MB. Free memory was 182.2MB in the beginning and 180.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 15.88ms. Allocated memory is still 204.5MB. Free memory was 180.8MB in the beginning and 179.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 259.40ms. Allocated memory is still 204.5MB. Free memory was 179.2MB in the beginning and 168.2MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 59.72ms. Allocated memory is still 204.5MB. Free memory was 168.2MB in the beginning and 163.5MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * TraceAbstraction took 3320.23ms. Allocated memory was 204.5MB in the beginning and 313.5MB in the end (delta: 109.1MB). Free memory was 162.9MB in the beginning and 96.4MB in the end (delta: 66.5MB). Peak memory consumption was 176.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 149]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 964 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 964 mSDsluCounter, 3209 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1282 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 139 IncrementalHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 1927 mSDtfsCounter, 139 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10245occurred in iteration=25, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 26 MinimizatonAttempts, 2074 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 521 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 524 NumberOfCodeBlocks, 524 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 498 ConstructedInterpolants, 0 QuantifiedInterpolants, 1236 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-01-10 15:53:13,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...