/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_BITWISE.epf -i ../../../trunk/examples/svcomp/locks/test_locks_7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 10:03:08,199 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 10:03:08,201 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 10:03:08,249 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 10:03:08,249 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 10:03:08,251 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 10:03:08,255 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 10:03:08,257 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 10:03:08,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 10:03:08,262 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 10:03:08,262 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 10:03:08,263 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 10:03:08,263 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 10:03:08,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 10:03:08,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 10:03:08,268 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 10:03:08,268 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 10:03:08,269 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 10:03:08,270 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 10:03:08,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 10:03:08,275 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 10:03:08,276 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 10:03:08,277 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 10:03:08,277 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 10:03:08,282 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 10:03:08,282 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 10:03:08,282 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 10:03:08,283 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 10:03:08,283 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 10:03:08,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 10:03:08,284 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 10:03:08,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 10:03:08,286 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 10:03:08,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 10:03:08,287 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 10:03:08,287 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 10:03:08,288 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 10:03:08,288 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 10:03:08,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 10:03:08,288 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 10:03:08,290 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 10:03:08,291 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 10:03:08,319 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 10:03:08,319 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 10:03:08,320 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 10:03:08,320 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 10:03:08,321 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 10:03:08,321 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 10:03:08,321 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 10:03:08,321 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 10:03:08,321 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 10:03:08,321 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 10:03:08,322 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 10:03:08,322 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 10:03:08,322 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 10:03:08,322 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 10:03:08,322 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 10:03:08,322 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 10:03:08,322 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 10:03:08,323 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 10:03:08,323 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 10:03:08,323 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 10:03:08,323 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 10:03:08,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 10:03:08,323 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 10:03:08,323 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 10:03:08,323 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 10:03:08,323 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 10:03:08,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 10:03:08,323 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 10:03:08,323 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 10:03:08,324 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 10:03:08,324 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 10:03:08,324 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 10:03:08,324 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 10:03:08,324 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE 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 10:03:08,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 10:03:08,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 10:03:08,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 10:03:08,531 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 10:03:08,532 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 10:03:08,532 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2022-01-10 10:03:08,581 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3615e819f/aa2d0cfc621c4037b2d56e4e47e24671/FLAGd1644403f [2022-01-10 10:03:08,923 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 10:03:08,923 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2022-01-10 10:03:08,928 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3615e819f/aa2d0cfc621c4037b2d56e4e47e24671/FLAGd1644403f [2022-01-10 10:03:09,361 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3615e819f/aa2d0cfc621c4037b2d56e4e47e24671 [2022-01-10 10:03:09,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 10:03:09,364 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 10:03:09,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 10:03:09,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 10:03:09,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 10:03:09,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 10:03:09" (1/1) ... [2022-01-10 10:03:09,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@230d7637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:09, skipping insertion in model container [2022-01-10 10:03:09,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 10:03:09" (1/1) ... [2022-01-10 10:03:09,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 10:03:09,409 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 10:03:09,579 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_7.c[2881,2894] [2022-01-10 10:03:09,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 10:03:09,591 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 10:03:09,603 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_7.c[2881,2894] [2022-01-10 10:03:09,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 10:03:09,611 INFO L208 MainTranslator]: Completed translation [2022-01-10 10:03:09,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:09 WrapperNode [2022-01-10 10:03:09,612 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 10:03:09,613 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 10:03:09,613 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 10:03:09,613 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 10:03:09,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:09" (1/1) ... [2022-01-10 10:03:09,622 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:09" (1/1) ... [2022-01-10 10:03:09,636 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 97 [2022-01-10 10:03:09,636 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 10:03:09,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 10:03:09,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 10:03:09,637 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 10:03:09,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:09" (1/1) ... [2022-01-10 10:03:09,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:09" (1/1) ... [2022-01-10 10:03:09,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:09" (1/1) ... [2022-01-10 10:03:09,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:09" (1/1) ... [2022-01-10 10:03:09,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:09" (1/1) ... [2022-01-10 10:03:09,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:09" (1/1) ... [2022-01-10 10:03:09,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:09" (1/1) ... [2022-01-10 10:03:09,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 10:03:09,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 10:03:09,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 10:03:09,652 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 10:03:09,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:09" (1/1) ... [2022-01-10 10:03:09,662 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 10:03:09,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 10:03:09,691 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 10:03:09,723 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 10:03:09,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 10:03:09,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 10:03:09,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 10:03:09,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 10:03:09,799 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 10:03:09,800 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 10:03:09,950 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 10:03:09,954 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 10:03:09,954 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 10:03:09,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 10:03:09 BoogieIcfgContainer [2022-01-10 10:03:09,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 10:03:09,956 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 10:03:09,956 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 10:03:09,972 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 10:03:09,974 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 10:03:09" (1/1) ... [2022-01-10 10:03:10,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 10:03:10 BasicIcfg [2022-01-10 10:03:10,052 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 10:03:10,069 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 10:03:10,069 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 10:03:10,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 10:03:10,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 10:03:09" (1/4) ... [2022-01-10 10:03:10,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521f3d0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 10:03:10, skipping insertion in model container [2022-01-10 10:03:10,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 10:03:09" (2/4) ... [2022-01-10 10:03:10,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521f3d0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 10:03:10, skipping insertion in model container [2022-01-10 10:03:10,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 10:03:09" (3/4) ... [2022-01-10 10:03:10,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521f3d0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 10:03:10, skipping insertion in model container [2022-01-10 10:03:10,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 10:03:10" (4/4) ... [2022-01-10 10:03:10,075 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_7.cTransformedIcfg [2022-01-10 10:03:10,079 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 10:03:10,079 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 10:03:10,113 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 10:03:10,121 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 10:03:10,121 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 10:03:10,130 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 30 states have internal predecessors, (54), 0 states have call successors, (0), 0 states 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 10:03:10,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 10:03:10,133 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:10,134 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:10,134 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:10,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:10,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1865851278, now seen corresponding path program 1 times [2022-01-10 10:03:10,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:10,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870385512] [2022-01-10 10:03:10,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:10,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:10,292 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 10:03:10,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:10,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870385512] [2022-01-10 10:03:10,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870385512] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:10,293 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:10,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:10,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33346269] [2022-01-10 10:03:10,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:10,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:10,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:10,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:10,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:10,314 INFO L87 Difference]: Start difference. First operand has 31 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 30 states have internal predecessors, (54), 0 states have call successors, (0), 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 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 10:03:10,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:10,355 INFO L93 Difference]: Finished difference Result 65 states and 109 transitions. [2022-01-10 10:03:10,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:10,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-01-10 10:03:10,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:10,363 INFO L225 Difference]: With dead ends: 65 [2022-01-10 10:03:10,363 INFO L226 Difference]: Without dead ends: 51 [2022-01-10 10:03:10,365 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 10:03:10,369 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 37 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 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 10:03:10,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 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 10:03:10,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-01-10 10:03:10,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2022-01-10 10:03:10,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states 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 10:03:10,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 62 transitions. [2022-01-10 10:03:10,400 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 62 transitions. Word has length 14 [2022-01-10 10:03:10,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:10,401 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 62 transitions. [2022-01-10 10:03:10,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 10:03:10,402 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 62 transitions. [2022-01-10 10:03:10,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 10:03:10,402 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:10,402 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:10,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 10:03:10,402 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:10,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:10,403 INFO L85 PathProgramCache]: Analyzing trace with hash -2062364783, now seen corresponding path program 1 times [2022-01-10 10:03:10,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:10,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197928483] [2022-01-10 10:03:10,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:10,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:10,452 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 10:03:10,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:10,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197928483] [2022-01-10 10:03:10,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197928483] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:10,453 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:10,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:10,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965553087] [2022-01-10 10:03:10,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:10,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:10,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:10,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:10,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:10,455 INFO L87 Difference]: Start difference. First operand 35 states and 62 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 10:03:10,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:10,467 INFO L93 Difference]: Finished difference Result 84 states and 149 transitions. [2022-01-10 10:03:10,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:10,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-01-10 10:03:10,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:10,468 INFO L225 Difference]: With dead ends: 84 [2022-01-10 10:03:10,469 INFO L226 Difference]: Without dead ends: 51 [2022-01-10 10:03:10,469 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 10:03:10,470 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 33 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 101 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 10:03:10,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 101 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:10,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-01-10 10:03:10,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2022-01-10 10:03:10,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.7916666666666667) internal successors, (86), 48 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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 10:03:10,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 86 transitions. [2022-01-10 10:03:10,475 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 86 transitions. Word has length 14 [2022-01-10 10:03:10,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:10,475 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 86 transitions. [2022-01-10 10:03:10,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 10:03:10,475 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 86 transitions. [2022-01-10 10:03:10,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 10:03:10,476 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:10,476 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:10,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 10:03:10,476 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:10,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:10,477 INFO L85 PathProgramCache]: Analyzing trace with hash -2006782819, now seen corresponding path program 1 times [2022-01-10 10:03:10,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:10,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517128397] [2022-01-10 10:03:10,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:10,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:10,514 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 10:03:10,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:10,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517128397] [2022-01-10 10:03:10,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517128397] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:10,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:10,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:10,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221102864] [2022-01-10 10:03:10,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:10,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:10,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:10,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:10,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:10,516 INFO L87 Difference]: Start difference. First operand 49 states and 86 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:10,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:10,527 INFO L93 Difference]: Finished difference Result 78 states and 132 transitions. [2022-01-10 10:03:10,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:10,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-10 10:03:10,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:10,528 INFO L225 Difference]: With dead ends: 78 [2022-01-10 10:03:10,528 INFO L226 Difference]: Without dead ends: 54 [2022-01-10 10:03:10,528 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 10:03:10,529 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 35 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:10,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 112 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:10,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-01-10 10:03:10,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-01-10 10:03:10,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.7254901960784315) internal successors, (88), 51 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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 10:03:10,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 88 transitions. [2022-01-10 10:03:10,534 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 88 transitions. Word has length 15 [2022-01-10 10:03:10,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:10,534 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 88 transitions. [2022-01-10 10:03:10,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:10,535 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 88 transitions. [2022-01-10 10:03:10,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 10:03:10,535 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:10,535 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:10,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 10:03:10,535 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:10,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:10,536 INFO L85 PathProgramCache]: Analyzing trace with hash 491233118, now seen corresponding path program 1 times [2022-01-10 10:03:10,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:10,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174858873] [2022-01-10 10:03:10,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:10,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:10,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:10,568 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 10:03:10,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:10,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174858873] [2022-01-10 10:03:10,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174858873] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:10,569 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:10,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:10,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534826059] [2022-01-10 10:03:10,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:10,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:10,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:10,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:10,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:10,570 INFO L87 Difference]: Start difference. First operand 52 states and 88 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:10,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:10,581 INFO L93 Difference]: Finished difference Result 97 states and 165 transitions. [2022-01-10 10:03:10,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:10,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-10 10:03:10,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:10,583 INFO L225 Difference]: With dead ends: 97 [2022-01-10 10:03:10,583 INFO L226 Difference]: Without dead ends: 95 [2022-01-10 10:03:10,583 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 10:03:10,584 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 30 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 89 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 10:03:10,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 89 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:10,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-01-10 10:03:10,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 69. [2022-01-10 10:03:10,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.7205882352941178) internal successors, (117), 68 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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 10:03:10,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 117 transitions. [2022-01-10 10:03:10,590 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 117 transitions. Word has length 15 [2022-01-10 10:03:10,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:10,591 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 117 transitions. [2022-01-10 10:03:10,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:10,591 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 117 transitions. [2022-01-10 10:03:10,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 10:03:10,591 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:10,592 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:10,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 10:03:10,592 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:10,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:10,592 INFO L85 PathProgramCache]: Analyzing trace with hash 294719613, now seen corresponding path program 1 times [2022-01-10 10:03:10,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:10,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971371980] [2022-01-10 10:03:10,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:10,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:10,620 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 10:03:10,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:10,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971371980] [2022-01-10 10:03:10,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971371980] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:10,620 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:10,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:10,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018333467] [2022-01-10 10:03:10,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:10,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:10,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:10,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:10,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:10,622 INFO L87 Difference]: Start difference. First operand 69 states and 117 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:10,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:10,634 INFO L93 Difference]: Finished difference Result 161 states and 275 transitions. [2022-01-10 10:03:10,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:10,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-10 10:03:10,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:10,635 INFO L225 Difference]: With dead ends: 161 [2022-01-10 10:03:10,635 INFO L226 Difference]: Without dead ends: 97 [2022-01-10 10:03:10,636 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 10:03:10,636 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 32 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 102 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 10:03:10,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 102 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:10,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-01-10 10:03:10,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2022-01-10 10:03:10,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.6914893617021276) internal successors, (159), 94 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:10,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 159 transitions. [2022-01-10 10:03:10,643 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 159 transitions. Word has length 15 [2022-01-10 10:03:10,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:10,643 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 159 transitions. [2022-01-10 10:03:10,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:10,643 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 159 transitions. [2022-01-10 10:03:10,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 10:03:10,644 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:10,644 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:10,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 10:03:10,644 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:10,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:10,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1951610451, now seen corresponding path program 1 times [2022-01-10 10:03:10,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:10,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489463086] [2022-01-10 10:03:10,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:10,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:10,671 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 10:03:10,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:10,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489463086] [2022-01-10 10:03:10,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489463086] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:10,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:10,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:10,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838675179] [2022-01-10 10:03:10,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:10,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:10,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:10,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:10,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:10,673 INFO L87 Difference]: Start difference. First operand 95 states and 159 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 10:03:10,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:10,684 INFO L93 Difference]: Finished difference Result 144 states and 238 transitions. [2022-01-10 10:03:10,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:10,684 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 10:03:10,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:10,685 INFO L225 Difference]: With dead ends: 144 [2022-01-10 10:03:10,685 INFO L226 Difference]: Without dead ends: 99 [2022-01-10 10:03:10,685 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 10:03:10,686 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 34 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:10,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 108 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:10,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-01-10 10:03:10,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2022-01-10 10:03:10,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.65625) internal successors, (159), 96 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 10:03:10,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 159 transitions. [2022-01-10 10:03:10,692 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 159 transitions. Word has length 16 [2022-01-10 10:03:10,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:10,692 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 159 transitions. [2022-01-10 10:03:10,692 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 10:03:10,692 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 159 transitions. [2022-01-10 10:03:10,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 10:03:10,693 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:10,693 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:10,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 10:03:10,693 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:10,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:10,694 INFO L85 PathProgramCache]: Analyzing trace with hash 546405486, now seen corresponding path program 1 times [2022-01-10 10:03:10,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:10,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105551975] [2022-01-10 10:03:10,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:10,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:10,733 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 10:03:10,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:10,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105551975] [2022-01-10 10:03:10,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105551975] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:10,733 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:10,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:10,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598874370] [2022-01-10 10:03:10,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:10,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:10,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:10,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:10,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:10,735 INFO L87 Difference]: Start difference. First operand 97 states and 159 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 10:03:10,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:10,751 INFO L93 Difference]: Finished difference Result 177 states and 293 transitions. [2022-01-10 10:03:10,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:10,752 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 10:03:10,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:10,753 INFO L225 Difference]: With dead ends: 177 [2022-01-10 10:03:10,753 INFO L226 Difference]: Without dead ends: 175 [2022-01-10 10:03:10,753 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 10:03:10,754 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 27 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 87 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 10:03:10,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 87 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:10,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-01-10 10:03:10,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 133. [2022-01-10 10:03:10,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.628787878787879) internal successors, (215), 132 states have internal predecessors, (215), 0 states have call successors, (0), 0 states 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 10:03:10,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 215 transitions. [2022-01-10 10:03:10,772 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 215 transitions. Word has length 16 [2022-01-10 10:03:10,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:10,772 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 215 transitions. [2022-01-10 10:03:10,773 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 10:03:10,773 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 215 transitions. [2022-01-10 10:03:10,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 10:03:10,773 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:10,773 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 10:03:10,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 10:03:10,774 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:10,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:10,774 INFO L85 PathProgramCache]: Analyzing trace with hash 349891981, now seen corresponding path program 1 times [2022-01-10 10:03:10,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:10,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240762422] [2022-01-10 10:03:10,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:10,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:10,813 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 10:03:10,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:10,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240762422] [2022-01-10 10:03:10,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240762422] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:10,814 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:10,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:10,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145028916] [2022-01-10 10:03:10,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:10,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:10,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:10,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:10,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:10,816 INFO L87 Difference]: Start difference. First operand 133 states and 215 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 10:03:10,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:10,843 INFO L93 Difference]: Finished difference Result 309 states and 501 transitions. [2022-01-10 10:03:10,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:10,843 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 10:03:10,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:10,844 INFO L225 Difference]: With dead ends: 309 [2022-01-10 10:03:10,844 INFO L226 Difference]: Without dead ends: 183 [2022-01-10 10:03:10,844 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 10:03:10,845 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 31 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:10,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 103 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:10,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-01-10 10:03:10,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2022-01-10 10:03:10,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.5944444444444446) internal successors, (287), 180 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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 10:03:10,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 287 transitions. [2022-01-10 10:03:10,856 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 287 transitions. Word has length 16 [2022-01-10 10:03:10,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:10,856 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 287 transitions. [2022-01-10 10:03:10,856 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 10:03:10,856 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 287 transitions. [2022-01-10 10:03:10,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 10:03:10,857 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:10,857 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 10:03:10,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 10:03:10,857 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:10,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:10,858 INFO L85 PathProgramCache]: Analyzing trace with hash -241266919, now seen corresponding path program 1 times [2022-01-10 10:03:10,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:10,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951893665] [2022-01-10 10:03:10,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:10,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:10,900 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 10:03:10,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:10,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951893665] [2022-01-10 10:03:10,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951893665] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:10,900 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:10,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:10,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000804342] [2022-01-10 10:03:10,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:10,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:10,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:10,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:10,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:10,903 INFO L87 Difference]: Start difference. First operand 181 states and 287 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 10:03:10,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:10,921 INFO L93 Difference]: Finished difference Result 273 states and 429 transitions. [2022-01-10 10:03:10,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:10,922 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 10:03:10,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:10,923 INFO L225 Difference]: With dead ends: 273 [2022-01-10 10:03:10,923 INFO L226 Difference]: Without dead ends: 187 [2022-01-10 10:03:10,926 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 10:03:10,929 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 33 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 10:03:10,929 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 104 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:10,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-01-10 10:03:10,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2022-01-10 10:03:10,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.559782608695652) internal successors, (287), 184 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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 10:03:10,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 287 transitions. [2022-01-10 10:03:10,938 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 287 transitions. Word has length 17 [2022-01-10 10:03:10,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:10,938 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 287 transitions. [2022-01-10 10:03:10,938 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 10:03:10,938 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 287 transitions. [2022-01-10 10:03:10,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 10:03:10,939 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:10,939 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 10:03:10,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 10:03:10,939 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:10,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:10,940 INFO L85 PathProgramCache]: Analyzing trace with hash -2038218278, now seen corresponding path program 1 times [2022-01-10 10:03:10,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:10,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109545295] [2022-01-10 10:03:10,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:10,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:10,970 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 10:03:10,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:10,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109545295] [2022-01-10 10:03:10,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109545295] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:10,971 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:10,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:10,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124370448] [2022-01-10 10:03:10,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:10,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:10,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:10,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:10,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:10,972 INFO L87 Difference]: Start difference. First operand 185 states and 287 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 10:03:10,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:10,984 INFO L93 Difference]: Finished difference Result 329 states and 517 transitions. [2022-01-10 10:03:10,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:10,984 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 10:03:10,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:10,985 INFO L225 Difference]: With dead ends: 329 [2022-01-10 10:03:10,985 INFO L226 Difference]: Without dead ends: 327 [2022-01-10 10:03:10,986 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 10:03:10,986 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 24 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 85 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 10:03:10,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 85 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:10,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-01-10 10:03:11,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 261. [2022-01-10 10:03:11,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.5192307692307692) internal successors, (395), 260 states have internal predecessors, (395), 0 states have call successors, (0), 0 states 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 10:03:11,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 395 transitions. [2022-01-10 10:03:11,002 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 395 transitions. Word has length 17 [2022-01-10 10:03:11,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:11,002 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 395 transitions. [2022-01-10 10:03:11,002 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 10:03:11,002 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 395 transitions. [2022-01-10 10:03:11,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 10:03:11,003 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:11,003 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 10:03:11,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 10:03:11,004 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:11,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:11,004 INFO L85 PathProgramCache]: Analyzing trace with hash 2060235513, now seen corresponding path program 1 times [2022-01-10 10:03:11,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:11,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614460582] [2022-01-10 10:03:11,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:11,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:11,041 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 10:03:11,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:11,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614460582] [2022-01-10 10:03:11,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614460582] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:11,042 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:11,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:11,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966622764] [2022-01-10 10:03:11,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:11,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:11,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:11,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:11,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:11,065 INFO L87 Difference]: Start difference. First operand 261 states and 395 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 10:03:11,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:11,083 INFO L93 Difference]: Finished difference Result 601 states and 909 transitions. [2022-01-10 10:03:11,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:11,083 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 10:03:11,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:11,085 INFO L225 Difference]: With dead ends: 601 [2022-01-10 10:03:11,085 INFO L226 Difference]: Without dead ends: 351 [2022-01-10 10:03:11,086 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 10:03:11,087 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 30 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 104 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 10:03:11,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 104 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:11,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-01-10 10:03:11,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2022-01-10 10:03:11,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4798850574712643) internal successors, (515), 348 states have internal predecessors, (515), 0 states have call successors, (0), 0 states 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 10:03:11,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 515 transitions. [2022-01-10 10:03:11,128 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 515 transitions. Word has length 17 [2022-01-10 10:03:11,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:11,128 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 515 transitions. [2022-01-10 10:03:11,128 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 10:03:11,129 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 515 transitions. [2022-01-10 10:03:11,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 10:03:11,133 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:11,133 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 10:03:11,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 10:03:11,134 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:11,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:11,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1239775145, now seen corresponding path program 1 times [2022-01-10 10:03:11,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:11,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671551108] [2022-01-10 10:03:11,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:11,135 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:11,168 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 10:03:11,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:11,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671551108] [2022-01-10 10:03:11,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671551108] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:11,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:11,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:11,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326741018] [2022-01-10 10:03:11,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:11,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:11,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:11,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:11,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:11,170 INFO L87 Difference]: Start difference. First operand 349 states and 515 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 10:03:11,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:11,183 INFO L93 Difference]: Finished difference Result 525 states and 769 transitions. [2022-01-10 10:03:11,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:11,184 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 10:03:11,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:11,185 INFO L225 Difference]: With dead ends: 525 [2022-01-10 10:03:11,185 INFO L226 Difference]: Without dead ends: 359 [2022-01-10 10:03:11,185 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 10:03:11,186 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 32 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 100 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 10:03:11,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 100 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:11,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-01-10 10:03:11,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2022-01-10 10:03:11,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 1.446629213483146) internal successors, (515), 356 states have internal predecessors, (515), 0 states have call successors, (0), 0 states 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 10:03:11,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 515 transitions. [2022-01-10 10:03:11,195 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 515 transitions. Word has length 18 [2022-01-10 10:03:11,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:11,195 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 515 transitions. [2022-01-10 10:03:11,195 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 10:03:11,196 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 515 transitions. [2022-01-10 10:03:11,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 10:03:11,196 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:11,196 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 10:03:11,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 10:03:11,197 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:11,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:11,198 INFO L85 PathProgramCache]: Analyzing trace with hash -557176214, now seen corresponding path program 1 times [2022-01-10 10:03:11,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:11,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951912794] [2022-01-10 10:03:11,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:11,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:11,236 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 10:03:11,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:11,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951912794] [2022-01-10 10:03:11,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951912794] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:11,237 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:11,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:11,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576218773] [2022-01-10 10:03:11,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:11,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:11,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:11,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:11,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:11,238 INFO L87 Difference]: Start difference. First operand 357 states and 515 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 10:03:11,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:11,252 INFO L93 Difference]: Finished difference Result 617 states and 901 transitions. [2022-01-10 10:03:11,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:11,252 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 10:03:11,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:11,254 INFO L225 Difference]: With dead ends: 617 [2022-01-10 10:03:11,254 INFO L226 Difference]: Without dead ends: 615 [2022-01-10 10:03:11,254 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 10:03:11,255 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 21 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 83 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 10:03:11,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 83 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:11,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-01-10 10:03:11,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 517. [2022-01-10 10:03:11,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 516 states have (on average 1.4011627906976745) internal successors, (723), 516 states have internal predecessors, (723), 0 states have call successors, (0), 0 states 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 10:03:11,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 723 transitions. [2022-01-10 10:03:11,267 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 723 transitions. Word has length 18 [2022-01-10 10:03:11,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:11,269 INFO L470 AbstractCegarLoop]: Abstraction has 517 states and 723 transitions. [2022-01-10 10:03:11,269 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 10:03:11,269 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 723 transitions. [2022-01-10 10:03:11,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 10:03:11,270 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:11,270 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 10:03:11,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 10:03:11,270 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:11,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:11,271 INFO L85 PathProgramCache]: Analyzing trace with hash -753689719, now seen corresponding path program 1 times [2022-01-10 10:03:11,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:11,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213712968] [2022-01-10 10:03:11,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:11,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:11,296 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 10:03:11,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:11,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213712968] [2022-01-10 10:03:11,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213712968] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:11,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:11,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:11,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93726408] [2022-01-10 10:03:11,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:11,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:11,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:11,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:11,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:11,298 INFO L87 Difference]: Start difference. First operand 517 states and 723 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 10:03:11,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:11,317 INFO L93 Difference]: Finished difference Result 1177 states and 1637 transitions. [2022-01-10 10:03:11,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:11,317 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 10:03:11,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:11,321 INFO L225 Difference]: With dead ends: 1177 [2022-01-10 10:03:11,321 INFO L226 Difference]: Without dead ends: 679 [2022-01-10 10:03:11,322 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 10:03:11,323 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 29 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 105 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 10:03:11,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 105 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:11,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2022-01-10 10:03:11,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 677. [2022-01-10 10:03:11,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 676 states have (on average 1.3535502958579881) internal successors, (915), 676 states have internal predecessors, (915), 0 states have call successors, (0), 0 states 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 10:03:11,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 915 transitions. [2022-01-10 10:03:11,339 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 915 transitions. Word has length 18 [2022-01-10 10:03:11,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:11,339 INFO L470 AbstractCegarLoop]: Abstraction has 677 states and 915 transitions. [2022-01-10 10:03:11,340 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 10:03:11,340 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 915 transitions. [2022-01-10 10:03:11,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 10:03:11,341 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:11,341 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 10:03:11,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 10:03:11,342 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:11,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:11,342 INFO L85 PathProgramCache]: Analyzing trace with hash -92561003, now seen corresponding path program 1 times [2022-01-10 10:03:11,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:11,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282898731] [2022-01-10 10:03:11,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:11,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:11,376 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 10:03:11,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:11,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282898731] [2022-01-10 10:03:11,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282898731] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:11,376 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:11,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:11,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727845392] [2022-01-10 10:03:11,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:11,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:11,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:11,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:11,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:11,377 INFO L87 Difference]: Start difference. First operand 677 states and 915 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 10:03:11,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:11,392 INFO L93 Difference]: Finished difference Result 1017 states and 1365 transitions. [2022-01-10 10:03:11,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:11,392 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 10:03:11,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:11,394 INFO L225 Difference]: With dead ends: 1017 [2022-01-10 10:03:11,394 INFO L226 Difference]: Without dead ends: 695 [2022-01-10 10:03:11,396 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 10:03:11,397 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 31 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 96 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 10:03:11,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 96 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:11,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2022-01-10 10:03:11,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 693. [2022-01-10 10:03:11,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 692 states have (on average 1.3222543352601157) internal successors, (915), 692 states have internal predecessors, (915), 0 states have call successors, (0), 0 states 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 10:03:11,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 915 transitions. [2022-01-10 10:03:11,413 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 915 transitions. Word has length 19 [2022-01-10 10:03:11,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:11,413 INFO L470 AbstractCegarLoop]: Abstraction has 693 states and 915 transitions. [2022-01-10 10:03:11,413 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 10:03:11,413 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 915 transitions. [2022-01-10 10:03:11,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 10:03:11,415 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:11,415 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 10:03:11,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 10:03:11,416 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:11,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:11,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1889512362, now seen corresponding path program 1 times [2022-01-10 10:03:11,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:11,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503132114] [2022-01-10 10:03:11,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:11,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:11,434 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 10:03:11,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:11,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503132114] [2022-01-10 10:03:11,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503132114] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:11,435 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:11,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:11,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936604601] [2022-01-10 10:03:11,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:11,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:11,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:11,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:11,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:11,437 INFO L87 Difference]: Start difference. First operand 693 states and 915 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 10:03:11,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:11,457 INFO L93 Difference]: Finished difference Result 1161 states and 1541 transitions. [2022-01-10 10:03:11,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:11,458 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 10:03:11,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:11,461 INFO L225 Difference]: With dead ends: 1161 [2022-01-10 10:03:11,461 INFO L226 Difference]: Without dead ends: 1159 [2022-01-10 10:03:11,461 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 10:03:11,461 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 18 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 81 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 10:03:11,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 81 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:11,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2022-01-10 10:03:11,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1029. [2022-01-10 10:03:11,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 1028 states have (on average 1.2791828793774318) internal successors, (1315), 1028 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states 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 10:03:11,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1315 transitions. [2022-01-10 10:03:11,484 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1315 transitions. Word has length 19 [2022-01-10 10:03:11,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:11,484 INFO L470 AbstractCegarLoop]: Abstraction has 1029 states and 1315 transitions. [2022-01-10 10:03:11,484 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 10:03:11,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1315 transitions. [2022-01-10 10:03:11,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 10:03:11,485 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:11,485 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 10:03:11,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 10:03:11,486 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:11,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:11,486 INFO L85 PathProgramCache]: Analyzing trace with hash -2086025867, now seen corresponding path program 1 times [2022-01-10 10:03:11,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:11,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072855572] [2022-01-10 10:03:11,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:11,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:11,508 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 10:03:11,508 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:11,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072855572] [2022-01-10 10:03:11,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072855572] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:11,508 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:11,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:11,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972699150] [2022-01-10 10:03:11,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:11,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:11,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:11,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:11,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:11,509 INFO L87 Difference]: Start difference. First operand 1029 states and 1315 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 10:03:11,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:11,535 INFO L93 Difference]: Finished difference Result 2313 states and 2917 transitions. [2022-01-10 10:03:11,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:11,536 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 10:03:11,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:11,539 INFO L225 Difference]: With dead ends: 2313 [2022-01-10 10:03:11,539 INFO L226 Difference]: Without dead ends: 1319 [2022-01-10 10:03:11,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:11,540 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 28 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 106 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 10:03:11,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 106 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:11,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2022-01-10 10:03:11,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1317. [2022-01-10 10:03:11,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 1316 states have (on average 1.2180851063829787) internal successors, (1603), 1316 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states 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 10:03:11,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1603 transitions. [2022-01-10 10:03:11,565 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1603 transitions. Word has length 19 [2022-01-10 10:03:11,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:11,565 INFO L470 AbstractCegarLoop]: Abstraction has 1317 states and 1603 transitions. [2022-01-10 10:03:11,565 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 10:03:11,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1603 transitions. [2022-01-10 10:03:11,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 10:03:11,566 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:11,566 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 10:03:11,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 10:03:11,567 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:11,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:11,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1554691493, now seen corresponding path program 1 times [2022-01-10 10:03:11,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:11,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167033401] [2022-01-10 10:03:11,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:11,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:11,581 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 10:03:11,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:11,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167033401] [2022-01-10 10:03:11,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167033401] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:11,582 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:11,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:11,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840579980] [2022-01-10 10:03:11,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:11,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:11,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:11,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:11,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:11,582 INFO L87 Difference]: Start difference. First operand 1317 states and 1603 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 10:03:11,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:11,614 INFO L93 Difference]: Finished difference Result 1977 states and 2389 transitions. [2022-01-10 10:03:11,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:11,615 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 10:03:11,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:11,618 INFO L225 Difference]: With dead ends: 1977 [2022-01-10 10:03:11,618 INFO L226 Difference]: Without dead ends: 1351 [2022-01-10 10:03:11,619 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 10:03:11,620 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 30 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 92 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 10:03:11,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 92 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:11,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2022-01-10 10:03:11,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1349. [2022-01-10 10:03:11,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 1348 states have (on average 1.1891691394658754) internal successors, (1603), 1348 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states 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 10:03:11,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1603 transitions. [2022-01-10 10:03:11,646 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1603 transitions. Word has length 20 [2022-01-10 10:03:11,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:11,647 INFO L470 AbstractCegarLoop]: Abstraction has 1349 states and 1603 transitions. [2022-01-10 10:03:11,648 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 10:03:11,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1603 transitions. [2022-01-10 10:03:11,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 10:03:11,649 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:11,649 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 10:03:11,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 10:03:11,649 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:11,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:11,649 INFO L85 PathProgramCache]: Analyzing trace with hash -242259866, now seen corresponding path program 1 times [2022-01-10 10:03:11,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:11,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471521416] [2022-01-10 10:03:11,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:11,649 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:11,664 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 10:03:11,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:11,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471521416] [2022-01-10 10:03:11,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471521416] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:11,664 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:11,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:11,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094846477] [2022-01-10 10:03:11,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:11,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:11,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:11,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:11,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:11,666 INFO L87 Difference]: Start difference. First operand 1349 states and 1603 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 10:03:11,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:11,696 INFO L93 Difference]: Finished difference Result 2183 states and 2564 transitions. [2022-01-10 10:03:11,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:11,696 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 10:03:11,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:11,701 INFO L225 Difference]: With dead ends: 2183 [2022-01-10 10:03:11,701 INFO L226 Difference]: Without dead ends: 2181 [2022-01-10 10:03:11,703 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 10:03:11,703 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 14 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 78 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 10:03:11,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 78 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:11,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2022-01-10 10:03:11,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 2053. [2022-01-10 10:03:11,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 2052 states have (on average 1.155458089668616) internal successors, (2371), 2052 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 10:03:11,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 2371 transitions. [2022-01-10 10:03:11,740 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 2371 transitions. Word has length 20 [2022-01-10 10:03:11,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:11,740 INFO L470 AbstractCegarLoop]: Abstraction has 2053 states and 2371 transitions. [2022-01-10 10:03:11,741 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 10:03:11,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 2371 transitions. [2022-01-10 10:03:11,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 10:03:11,742 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 10:03:11,742 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 10:03:11,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 10:03:11,742 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 10:03:11,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 10:03:11,743 INFO L85 PathProgramCache]: Analyzing trace with hash -438773371, now seen corresponding path program 1 times [2022-01-10 10:03:11,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 10:03:11,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514305304] [2022-01-10 10:03:11,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 10:03:11,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 10:03:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 10:03:11,755 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 10:03:11,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 10:03:11,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514305304] [2022-01-10 10:03:11,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514305304] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 10:03:11,756 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 10:03:11,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 10:03:11,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432094521] [2022-01-10 10:03:11,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 10:03:11,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 10:03:11,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 10:03:11,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 10:03:11,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 10:03:11,756 INFO L87 Difference]: Start difference. First operand 2053 states and 2371 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 10:03:11,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 10:03:11,802 INFO L93 Difference]: Finished difference Result 4549 states and 5123 transitions. [2022-01-10 10:03:11,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 10:03:11,802 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 10:03:11,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 10:03:11,802 INFO L225 Difference]: With dead ends: 4549 [2022-01-10 10:03:11,802 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 10:03:11,805 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 10:03:11,807 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 26 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 105 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 10:03:11,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 105 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 10:03:11,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 10:03:11,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 10:03:11,810 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 10:03:11,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 10:03:11,810 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-01-10 10:03:11,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 10:03:11,810 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 10:03:11,810 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 10:03:11,810 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 10:03:11,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 10:03:11,812 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 10:03:11,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 10:03:11,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 10:03:11,822 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 10:03:11,822 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 10:03:11,822 INFO L861 garLoopResultBuilder]: At program point L113-1(lines 32 118) the Hoare annotation is: true [2022-01-10 10:03:11,822 INFO L861 garLoopResultBuilder]: At program point L119(lines 7 123) the Hoare annotation is: true [2022-01-10 10:03:11,823 INFO L858 garLoopResultBuilder]: For program point L34(lines 34 36) no Hoare annotation was computed. [2022-01-10 10:03:11,823 INFO L861 garLoopResultBuilder]: At program point L122(lines 6 123) the Hoare annotation is: true [2022-01-10 10:03:11,823 INFO L858 garLoopResultBuilder]: For program point L53(lines 53 55) no Hoare annotation was computed. [2022-01-10 10:03:11,823 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 10:03:11,823 INFO L858 garLoopResultBuilder]: For program point L53-2(lines 32 118) no Hoare annotation was computed. [2022-01-10 10:03:11,823 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 10:03:11,823 INFO L858 garLoopResultBuilder]: For program point L57-1(lines 32 118) no Hoare annotation was computed. [2022-01-10 10:03:11,823 INFO L858 garLoopResultBuilder]: For program point L61-1(lines 32 118) no Hoare annotation was computed. [2022-01-10 10:03:11,823 INFO L858 garLoopResultBuilder]: For program point L65-1(lines 32 118) no Hoare annotation was computed. [2022-01-10 10:03:11,823 INFO L858 garLoopResultBuilder]: For program point L69-1(lines 32 118) no Hoare annotation was computed. [2022-01-10 10:03:11,823 INFO L858 garLoopResultBuilder]: For program point L73-1(lines 32 118) no Hoare annotation was computed. [2022-01-10 10:03:11,823 INFO L858 garLoopResultBuilder]: For program point L77-1(lines 32 118) no Hoare annotation was computed. [2022-01-10 10:03:11,823 INFO L858 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2022-01-10 10:03:11,824 INFO L858 garLoopResultBuilder]: For program point L83-1(lines 32 118) no Hoare annotation was computed. [2022-01-10 10:03:11,824 INFO L854 garLoopResultBuilder]: At program point L114-1(lines 7 123) the Hoare annotation is: false [2022-01-10 10:03:11,824 INFO L858 garLoopResultBuilder]: For program point L89(line 89) no Hoare annotation was computed. [2022-01-10 10:03:11,824 INFO L858 garLoopResultBuilder]: For program point L88-1(lines 32 118) no Hoare annotation was computed. [2022-01-10 10:03:11,824 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2022-01-10 10:03:11,824 INFO L858 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2022-01-10 10:03:11,824 INFO L858 garLoopResultBuilder]: For program point L93-1(lines 32 118) no Hoare annotation was computed. [2022-01-10 10:03:11,824 INFO L858 garLoopResultBuilder]: For program point L99(line 99) no Hoare annotation was computed. [2022-01-10 10:03:11,824 INFO L858 garLoopResultBuilder]: For program point L98-1(lines 32 118) no Hoare annotation was computed. [2022-01-10 10:03:11,824 INFO L858 garLoopResultBuilder]: For program point L104(line 104) no Hoare annotation was computed. [2022-01-10 10:03:11,825 INFO L858 garLoopResultBuilder]: For program point L103-1(lines 32 118) no Hoare annotation was computed. [2022-01-10 10:03:11,825 INFO L858 garLoopResultBuilder]: For program point L109(line 109) no Hoare annotation was computed. [2022-01-10 10:03:11,825 INFO L858 garLoopResultBuilder]: For program point L108-1(lines 32 118) no Hoare annotation was computed. [2022-01-10 10:03:11,825 INFO L858 garLoopResultBuilder]: For program point L114(line 114) no Hoare annotation was computed. [2022-01-10 10:03:11,827 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] [2022-01-10 10:03:11,831 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 10:03:11,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 10:03:11 BasicIcfg [2022-01-10 10:03:11,839 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 10:03:11,840 INFO L158 Benchmark]: Toolchain (without parser) took 2475.73ms. Allocated memory was 203.4MB in the beginning and 244.3MB in the end (delta: 40.9MB). Free memory was 146.1MB in the beginning and 118.3MB in the end (delta: 27.8MB). Peak memory consumption was 69.5MB. Max. memory is 8.0GB. [2022-01-10 10:03:11,841 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 203.4MB. Free memory is still 162.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 10:03:11,841 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.98ms. Allocated memory is still 203.4MB. Free memory was 145.9MB in the beginning and 173.7MB in the end (delta: -27.8MB). Peak memory consumption was 4.6MB. Max. memory is 8.0GB. [2022-01-10 10:03:11,841 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.84ms. Allocated memory is still 203.4MB. Free memory was 173.7MB in the beginning and 172.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 10:03:11,842 INFO L158 Benchmark]: Boogie Preprocessor took 14.52ms. Allocated memory is still 203.4MB. Free memory was 172.1MB in the beginning and 170.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 10:03:11,842 INFO L158 Benchmark]: RCFGBuilder took 303.38ms. Allocated memory is still 203.4MB. Free memory was 170.6MB in the beginning and 159.6MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-10 10:03:11,842 INFO L158 Benchmark]: IcfgTransformer took 95.91ms. Allocated memory is still 203.4MB. Free memory was 159.6MB in the beginning and 155.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-10 10:03:11,842 INFO L158 Benchmark]: TraceAbstraction took 1770.40ms. Allocated memory was 203.4MB in the beginning and 244.3MB in the end (delta: 40.9MB). Free memory was 154.9MB in the beginning and 118.3MB in the end (delta: 36.5MB). Peak memory consumption was 78.5MB. Max. memory is 8.0GB. [2022-01-10 10:03:11,843 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.09ms. Allocated memory is still 203.4MB. Free memory is still 162.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 246.98ms. Allocated memory is still 203.4MB. Free memory was 145.9MB in the beginning and 173.7MB in the end (delta: -27.8MB). Peak memory consumption was 4.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.84ms. Allocated memory is still 203.4MB. Free memory was 173.7MB in the beginning and 172.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.52ms. Allocated memory is still 203.4MB. Free memory was 172.1MB in the beginning and 170.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 303.38ms. Allocated memory is still 203.4MB. Free memory was 170.6MB in the beginning and 159.6MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 95.91ms. Allocated memory is still 203.4MB. Free memory was 159.6MB in the beginning and 155.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * TraceAbstraction took 1770.40ms. Allocated memory was 203.4MB in the beginning and 244.3MB in the end (delta: 40.9MB). Free memory was 154.9MB in the beginning and 118.3MB in the end (delta: 36.5MB). Peak memory consumption was 78.5MB. 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: 121]: 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, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 575 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 575 mSDsluCounter, 1944 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 767 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 107 IncrementalHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 1177 mSDtfsCounter, 107 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2053occurred in iteration=19, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 530 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 137 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 343 NumberOfCodeBlocks, 343 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 323 ConstructedInterpolants, 0 QuantifiedInterpolants, 771 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-01-10 10:03:11,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...