/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label45.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 03:35:55,192 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 03:35:55,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 03:35:55,247 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 03:35:55,247 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 03:35:55,248 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 03:35:55,249 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 03:35:55,250 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 03:35:55,251 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 03:35:55,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 03:35:55,261 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 03:35:55,270 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 03:35:55,270 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 03:35:55,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 03:35:55,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 03:35:55,278 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 03:35:55,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 03:35:55,280 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 03:35:55,282 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 03:35:55,287 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 03:35:55,288 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 03:35:55,289 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 03:35:55,290 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 03:35:55,291 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 03:35:55,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 03:35:55,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 03:35:55,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 03:35:55,296 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 03:35:55,297 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 03:35:55,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 03:35:55,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 03:35:55,298 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 03:35:55,299 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 03:35:55,299 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 03:35:55,300 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 03:35:55,300 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 03:35:55,300 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 03:35:55,300 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 03:35:55,301 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 03:35:55,301 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 03:35:55,301 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 03:35:55,305 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 03:35:55,330 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 03:35:55,330 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 03:35:55,330 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 03:35:55,330 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 03:35:55,331 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 03:35:55,331 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 03:35:55,331 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 03:35:55,332 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 03:35:55,332 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 03:35:55,332 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 03:35:55,332 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 03:35:55,332 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 03:35:55,332 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 03:35:55,333 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 03:35:55,333 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 03:35:55,333 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 03:35:55,333 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 03:35:55,333 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 03:35:55,333 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 03:35:55,333 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 03:35:55,333 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 03:35:55,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 03:35:55,333 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 03:35:55,333 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 03:35:55,333 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 03:35:55,334 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 03:35:55,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 03:35:55,334 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 03:35:55,334 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 03:35:55,334 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 03:35:55,334 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 03:35:55,334 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 03:35:55,335 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 03:35:55,335 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 03:35:55,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 03:35:55,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 03:35:55,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 03:35:55,537 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 03:35:55,537 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 03:35:55,538 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label45.c [2022-01-11 03:35:55,580 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4acc6a2a/c8705d78be184d15b01b14149efbb626/FLAG8264d5e1b [2022-01-11 03:35:56,001 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 03:35:56,019 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label45.c [2022-01-11 03:35:56,039 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4acc6a2a/c8705d78be184d15b01b14149efbb626/FLAG8264d5e1b [2022-01-11 03:35:56,051 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4acc6a2a/c8705d78be184d15b01b14149efbb626 [2022-01-11 03:35:56,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 03:35:56,054 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 03:35:56,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 03:35:56,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 03:35:56,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 03:35:56,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 03:35:56" (1/1) ... [2022-01-11 03:35:56,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40176f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:35:56, skipping insertion in model container [2022-01-11 03:35:56,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 03:35:56" (1/1) ... [2022-01-11 03:35:56,075 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 03:35:56,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 03:35:56,362 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label45.c[20099,20112] [2022-01-11 03:35:56,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 03:35:56,384 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 03:35:56,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label45.c[20099,20112] [2022-01-11 03:35:56,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 03:35:56,462 INFO L208 MainTranslator]: Completed translation [2022-01-11 03:35:56,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:35:56 WrapperNode [2022-01-11 03:35:56,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 03:35:56,464 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 03:35:56,464 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 03:35:56,464 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 03:35:56,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:35:56" (1/1) ... [2022-01-11 03:35:56,497 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:35:56" (1/1) ... [2022-01-11 03:35:56,551 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2022-01-11 03:35:56,551 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 03:35:56,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 03:35:56,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 03:35:56,552 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 03:35:56,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:35:56" (1/1) ... [2022-01-11 03:35:56,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:35:56" (1/1) ... [2022-01-11 03:35:56,569 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:35:56" (1/1) ... [2022-01-11 03:35:56,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:35:56" (1/1) ... [2022-01-11 03:35:56,607 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:35:56" (1/1) ... [2022-01-11 03:35:56,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:35:56" (1/1) ... [2022-01-11 03:35:56,615 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:35:56" (1/1) ... [2022-01-11 03:35:56,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 03:35:56,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 03:35:56,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 03:35:56,632 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 03:35:56,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:35:56" (1/1) ... [2022-01-11 03:35:56,653 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 03:35:56,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:35:56,671 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 03:35:56,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 03:35:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 03:35:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 03:35:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 03:35:56,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 03:35:56,840 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 03:35:56,841 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 03:35:57,587 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 03:35:57,593 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 03:35:57,593 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-11 03:35:57,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:35:57 BoogieIcfgContainer [2022-01-11 03:35:57,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 03:35:57,595 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 03:35:57,596 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 03:35:57,596 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 03:35:57,598 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:35:57" (1/1) ... [2022-01-11 03:35:57,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 03:35:57 BasicIcfg [2022-01-11 03:35:57,742 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 03:35:57,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 03:35:57,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 03:35:57,745 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 03:35:57,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 03:35:56" (1/4) ... [2022-01-11 03:35:57,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a6abbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 03:35:57, skipping insertion in model container [2022-01-11 03:35:57,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:35:56" (2/4) ... [2022-01-11 03:35:57,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a6abbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 03:35:57, skipping insertion in model container [2022-01-11 03:35:57,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:35:57" (3/4) ... [2022-01-11 03:35:57,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a6abbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 03:35:57, skipping insertion in model container [2022-01-11 03:35:57,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 03:35:57" (4/4) ... [2022-01-11 03:35:57,747 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem01_label45.cTransformedIcfg [2022-01-11 03:35:57,751 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 03:35:57,751 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 03:35:57,796 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 03:35:57,800 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 03:35:57,801 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 03:35:57,817 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:57,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-01-11 03:35:57,829 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:57,830 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:35:57,830 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:57,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:57,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1052656265, now seen corresponding path program 1 times [2022-01-11 03:35:57,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:57,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641849279] [2022-01-11 03:35:57,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:57,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:58,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:35:58,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:58,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641849279] [2022-01-11 03:35:58,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641849279] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:58,350 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:58,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 03:35:58,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589450523] [2022-01-11 03:35:58,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:58,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:35:58,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:58,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:35:58,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:58,384 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 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 39.0) internal successors, (117), 2 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-11 03:35:58,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:58,997 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2022-01-11 03:35:58,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:35:58,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 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) Word has length 117 [2022-01-11 03:35:59,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:59,014 INFO L225 Difference]: With dead ends: 528 [2022-01-11 03:35:59,014 INFO L226 Difference]: Without dead ends: 266 [2022-01-11 03:35:59,019 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:59,022 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 65 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:59,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 73 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-11 03:35:59,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-01-11 03:35:59,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2022-01-11 03:35:59,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.411320754716981) internal successors, (374), 265 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:59,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 374 transitions. [2022-01-11 03:35:59,073 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 374 transitions. Word has length 117 [2022-01-11 03:35:59,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:59,074 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 374 transitions. [2022-01-11 03:35:59,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 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-11 03:35:59,074 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 374 transitions. [2022-01-11 03:35:59,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 03:35:59,077 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:59,077 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:35:59,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 03:35:59,078 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:59,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:59,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1714540146, now seen corresponding path program 1 times [2022-01-11 03:35:59,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:59,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088211747] [2022-01-11 03:35:59,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:59,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:59,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-11 03:35:59,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:59,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088211747] [2022-01-11 03:35:59,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088211747] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:59,297 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:59,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 03:35:59,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974954095] [2022-01-11 03:35:59,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:59,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:35:59,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:59,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:35:59,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:59,299 INFO L87 Difference]: Start difference. First operand 266 states and 374 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:59,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:59,726 INFO L93 Difference]: Finished difference Result 792 states and 1117 transitions. [2022-01-11 03:35:59,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:35:59,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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 121 [2022-01-11 03:35:59,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:59,730 INFO L225 Difference]: With dead ends: 792 [2022-01-11 03:35:59,730 INFO L226 Difference]: Without dead ends: 528 [2022-01-11 03:35:59,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:59,736 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 37 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:59,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 31 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:35:59,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-01-11 03:35:59,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2022-01-11 03:35:59,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.3434535104364327) internal successors, (708), 527 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:59,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 708 transitions. [2022-01-11 03:35:59,756 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 708 transitions. Word has length 121 [2022-01-11 03:35:59,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:59,757 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 708 transitions. [2022-01-11 03:35:59,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:35:59,757 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 708 transitions. [2022-01-11 03:35:59,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-01-11 03:35:59,770 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:59,771 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:35:59,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 03:35:59,772 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:59,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:59,772 INFO L85 PathProgramCache]: Analyzing trace with hash 815329483, now seen corresponding path program 1 times [2022-01-11 03:35:59,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:59,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429695442] [2022-01-11 03:35:59,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:59,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:59,877 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-11 03:35:59,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:59,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429695442] [2022-01-11 03:35:59,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429695442] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:59,878 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:59,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 03:35:59,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649941715] [2022-01-11 03:35:59,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:59,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:35:59,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:59,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:35:59,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:59,881 INFO L87 Difference]: Start difference. First operand 528 states and 708 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:00,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:36:00,370 INFO L93 Difference]: Finished difference Result 1316 states and 1785 transitions. [2022-01-11 03:36:00,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:36:00,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 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 151 [2022-01-11 03:36:00,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:36:00,373 INFO L225 Difference]: With dead ends: 1316 [2022-01-11 03:36:00,373 INFO L226 Difference]: Without dead ends: 790 [2022-01-11 03:36:00,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:36:00,374 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 147 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-11 03:36:00,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 30 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-11 03:36:00,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2022-01-11 03:36:00,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 659. [2022-01-11 03:36:00,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 1.3495440729483283) internal successors, (888), 658 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:00,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 888 transitions. [2022-01-11 03:36:00,387 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 888 transitions. Word has length 151 [2022-01-11 03:36:00,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:36:00,388 INFO L470 AbstractCegarLoop]: Abstraction has 659 states and 888 transitions. [2022-01-11 03:36:00,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:00,388 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 888 transitions. [2022-01-11 03:36:00,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-01-11 03:36:00,390 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:36:00,390 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:36:00,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 03:36:00,390 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:36:00,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:36:00,391 INFO L85 PathProgramCache]: Analyzing trace with hash -13873785, now seen corresponding path program 1 times [2022-01-11 03:36:00,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:36:00,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470259327] [2022-01-11 03:36:00,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:36:00,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:36:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:36:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-11 03:36:00,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:36:00,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470259327] [2022-01-11 03:36:00,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470259327] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:36:00,449 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:36:00,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 03:36:00,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789763821] [2022-01-11 03:36:00,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:36:00,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:36:00,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:36:00,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:36:00,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:36:00,450 INFO L87 Difference]: Start difference. First operand 659 states and 888 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:00,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:36:00,874 INFO L93 Difference]: Finished difference Result 1578 states and 2108 transitions. [2022-01-11 03:36:00,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:36:00,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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 155 [2022-01-11 03:36:00,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:36:00,877 INFO L225 Difference]: With dead ends: 1578 [2022-01-11 03:36:00,877 INFO L226 Difference]: Without dead ends: 921 [2022-01-11 03:36:00,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:36:00,879 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 136 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:36:00,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 55 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:36:00,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2022-01-11 03:36:00,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921. [2022-01-11 03:36:00,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.2891304347826087) internal successors, (1186), 920 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:00,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1186 transitions. [2022-01-11 03:36:00,890 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1186 transitions. Word has length 155 [2022-01-11 03:36:00,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:36:00,891 INFO L470 AbstractCegarLoop]: Abstraction has 921 states and 1186 transitions. [2022-01-11 03:36:00,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:00,891 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1186 transitions. [2022-01-11 03:36:00,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-01-11 03:36:00,893 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:36:00,893 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:36:00,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 03:36:00,893 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:36:00,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:36:00,894 INFO L85 PathProgramCache]: Analyzing trace with hash -983169534, now seen corresponding path program 1 times [2022-01-11 03:36:00,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:36:00,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509023224] [2022-01-11 03:36:00,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:36:00,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:36:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:36:00,943 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-01-11 03:36:00,943 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:36:00,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509023224] [2022-01-11 03:36:00,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509023224] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:36:00,943 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:36:00,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:36:00,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446080253] [2022-01-11 03:36:00,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:36:00,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:36:00,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:36:00,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:36:00,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:36:00,945 INFO L87 Difference]: Start difference. First operand 921 states and 1186 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:01,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:36:01,408 INFO L93 Difference]: Finished difference Result 2495 states and 3175 transitions. [2022-01-11 03:36:01,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:36:01,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2022-01-11 03:36:01,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:36:01,413 INFO L225 Difference]: With dead ends: 2495 [2022-01-11 03:36:01,414 INFO L226 Difference]: Without dead ends: 1576 [2022-01-11 03:36:01,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:36:01,418 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 137 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:36:01,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 29 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:36:01,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2022-01-11 03:36:01,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1183. [2022-01-11 03:36:01,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.2656514382402708) internal successors, (1496), 1182 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:01,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1496 transitions. [2022-01-11 03:36:01,438 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1496 transitions. Word has length 168 [2022-01-11 03:36:01,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:36:01,439 INFO L470 AbstractCegarLoop]: Abstraction has 1183 states and 1496 transitions. [2022-01-11 03:36:01,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:01,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1496 transitions. [2022-01-11 03:36:01,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-01-11 03:36:01,448 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:36:01,449 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:36:01,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 03:36:01,449 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:36:01,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:36:01,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1286563581, now seen corresponding path program 1 times [2022-01-11 03:36:01,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:36:01,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116947026] [2022-01-11 03:36:01,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:36:01,450 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:36:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:36:01,565 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-01-11 03:36:01,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:36:01,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116947026] [2022-01-11 03:36:01,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116947026] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:36:01,565 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:36:01,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 03:36:01,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652404124] [2022-01-11 03:36:01,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:36:01,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:36:01,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:36:01,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:36:01,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:36:01,567 INFO L87 Difference]: Start difference. First operand 1183 states and 1496 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:02,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:36:02,002 INFO L93 Difference]: Finished difference Result 2495 states and 3163 transitions. [2022-01-11 03:36:02,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:36:02,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 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 170 [2022-01-11 03:36:02,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:36:02,006 INFO L225 Difference]: With dead ends: 2495 [2022-01-11 03:36:02,006 INFO L226 Difference]: Without dead ends: 1314 [2022-01-11 03:36:02,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:36:02,009 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 122 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:36:02,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 62 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:36:02,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2022-01-11 03:36:02,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1314. [2022-01-11 03:36:02,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 1313 states have (on average 1.2528560548362528) internal successors, (1645), 1313 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:02,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1645 transitions. [2022-01-11 03:36:02,027 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1645 transitions. Word has length 170 [2022-01-11 03:36:02,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:36:02,027 INFO L470 AbstractCegarLoop]: Abstraction has 1314 states and 1645 transitions. [2022-01-11 03:36:02,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:02,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1645 transitions. [2022-01-11 03:36:02,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 03:36:02,029 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:36:02,029 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:36:02,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 03:36:02,030 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:36:02,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:36:02,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1794855860, now seen corresponding path program 1 times [2022-01-11 03:36:02,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:36:02,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101050514] [2022-01-11 03:36:02,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:36:02,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:36:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:36:02,110 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-01-11 03:36:02,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:36:02,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101050514] [2022-01-11 03:36:02,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101050514] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:36:02,110 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:36:02,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:36:02,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123116650] [2022-01-11 03:36:02,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:36:02,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:36:02,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:36:02,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:36:02,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:36:02,111 INFO L87 Difference]: Start difference. First operand 1314 states and 1645 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:02,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:36:02,562 INFO L93 Difference]: Finished difference Result 3019 states and 3753 transitions. [2022-01-11 03:36:02,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:36:02,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 186 [2022-01-11 03:36:02,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:36:02,567 INFO L225 Difference]: With dead ends: 3019 [2022-01-11 03:36:02,567 INFO L226 Difference]: Without dead ends: 1707 [2022-01-11 03:36:02,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:36:02,571 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 121 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:36:02,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 211 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:36:02,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2022-01-11 03:36:02,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1576. [2022-01-11 03:36:02,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.2336507936507937) internal successors, (1943), 1575 states have internal predecessors, (1943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:02,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1943 transitions. [2022-01-11 03:36:02,591 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1943 transitions. Word has length 186 [2022-01-11 03:36:02,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:36:02,591 INFO L470 AbstractCegarLoop]: Abstraction has 1576 states and 1943 transitions. [2022-01-11 03:36:02,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:02,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1943 transitions. [2022-01-11 03:36:02,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-01-11 03:36:02,594 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:36:02,594 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:36:02,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 03:36:02,594 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:36:02,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:36:02,595 INFO L85 PathProgramCache]: Analyzing trace with hash -281543134, now seen corresponding path program 1 times [2022-01-11 03:36:02,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:36:02,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083962348] [2022-01-11 03:36:02,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:36:02,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:36:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:36:02,692 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-01-11 03:36:02,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:36:02,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083962348] [2022-01-11 03:36:02,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083962348] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:36:02,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:36:02,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:36:02,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988011030] [2022-01-11 03:36:02,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:36:02,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:36:02,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:36:02,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:36:02,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:36:02,694 INFO L87 Difference]: Start difference. First operand 1576 states and 1943 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:03,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:36:03,143 INFO L93 Difference]: Finished difference Result 3543 states and 4380 transitions. [2022-01-11 03:36:03,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:36:03,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 200 [2022-01-11 03:36:03,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:36:03,149 INFO L225 Difference]: With dead ends: 3543 [2022-01-11 03:36:03,149 INFO L226 Difference]: Without dead ends: 1969 [2022-01-11 03:36:03,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:36:03,151 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 121 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:36:03,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 205 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:36:03,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2022-01-11 03:36:03,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2022-01-11 03:36:03,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.1867174741426239) internal successors, (2180), 1837 states have internal predecessors, (2180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:03,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2180 transitions. [2022-01-11 03:36:03,173 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2180 transitions. Word has length 200 [2022-01-11 03:36:03,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:36:03,174 INFO L470 AbstractCegarLoop]: Abstraction has 1838 states and 2180 transitions. [2022-01-11 03:36:03,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:03,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2180 transitions. [2022-01-11 03:36:03,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-01-11 03:36:03,178 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:36:03,178 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:36:03,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 03:36:03,178 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:36:03,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:36:03,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1172000828, now seen corresponding path program 1 times [2022-01-11 03:36:03,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:36:03,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392871070] [2022-01-11 03:36:03,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:36:03,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:36:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:36:03,414 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:36:03,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:36:03,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392871070] [2022-01-11 03:36:03,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392871070] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:36:03,415 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:36:03,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 03:36:03,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830154075] [2022-01-11 03:36:03,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:36:03,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 03:36:03,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:36:03,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 03:36:03,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-01-11 03:36:03,417 INFO L87 Difference]: Start difference. First operand 1838 states and 2180 transitions. Second operand has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 5 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:04,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:36:04,417 INFO L93 Difference]: Finished difference Result 4675 states and 5612 transitions. [2022-01-11 03:36:04,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 03:36:04,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 5 states have internal predecessors, (221), 0 states have call successors, (0), 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 221 [2022-01-11 03:36:04,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:36:04,424 INFO L225 Difference]: With dead ends: 4675 [2022-01-11 03:36:04,424 INFO L226 Difference]: Without dead ends: 2757 [2022-01-11 03:36:04,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-01-11 03:36:04,426 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 373 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-11 03:36:04,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 58 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-11 03:36:04,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2022-01-11 03:36:04,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 2100. [2022-01-11 03:36:04,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2099 states have (on average 1.1600762267746545) internal successors, (2435), 2099 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:04,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2435 transitions. [2022-01-11 03:36:04,454 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2435 transitions. Word has length 221 [2022-01-11 03:36:04,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:36:04,454 INFO L470 AbstractCegarLoop]: Abstraction has 2100 states and 2435 transitions. [2022-01-11 03:36:04,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 5 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:04,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2435 transitions. [2022-01-11 03:36:04,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-01-11 03:36:04,457 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:36:04,457 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:36:04,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 03:36:04,458 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:36:04,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:36:04,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1776230601, now seen corresponding path program 1 times [2022-01-11 03:36:04,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:36:04,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359584275] [2022-01-11 03:36:04,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:36:04,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:36:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:36:04,548 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-01-11 03:36:04,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:36:04,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359584275] [2022-01-11 03:36:04,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359584275] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:36:04,549 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:36:04,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:36:04,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967742814] [2022-01-11 03:36:04,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:36:04,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:36:04,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:36:04,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:36:04,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:36:04,550 INFO L87 Difference]: Start difference. First operand 2100 states and 2435 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:05,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:36:05,084 INFO L93 Difference]: Finished difference Result 4591 states and 5309 transitions. [2022-01-11 03:36:05,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:36:05,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 222 [2022-01-11 03:36:05,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:36:05,090 INFO L225 Difference]: With dead ends: 4591 [2022-01-11 03:36:05,091 INFO L226 Difference]: Without dead ends: 2493 [2022-01-11 03:36:05,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:36:05,093 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 374 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-11 03:36:05,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [374 Valid, 53 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-11 03:36:05,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2022-01-11 03:36:05,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 2362. [2022-01-11 03:36:05,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 2361 states have (on average 1.1499364675984751) internal successors, (2715), 2361 states have internal predecessors, (2715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:05,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 2715 transitions. [2022-01-11 03:36:05,121 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 2715 transitions. Word has length 222 [2022-01-11 03:36:05,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:36:05,121 INFO L470 AbstractCegarLoop]: Abstraction has 2362 states and 2715 transitions. [2022-01-11 03:36:05,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:05,121 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 2715 transitions. [2022-01-11 03:36:05,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2022-01-11 03:36:05,125 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:36:05,125 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:36:05,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 03:36:05,125 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:36:05,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:36:05,126 INFO L85 PathProgramCache]: Analyzing trace with hash 234245641, now seen corresponding path program 1 times [2022-01-11 03:36:05,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:36:05,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216071350] [2022-01-11 03:36:05,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:36:05,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:36:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:36:05,300 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 134 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:36:05,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:36:05,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216071350] [2022-01-11 03:36:05,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216071350] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:36:05,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751276031] [2022-01-11 03:36:05,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:36:05,301 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:36:05,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:36:05,316 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 03:36:05,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-11 03:36:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:36:05,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 3974 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-11 03:36:05,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:36:06,321 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-01-11 03:36:06,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-11 03:36:06,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751276031] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:36:06,321 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-11 03:36:06,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-01-11 03:36:06,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238337114] [2022-01-11 03:36:06,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:36:06,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:36:06,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:36:06,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:36:06,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 03:36:06,323 INFO L87 Difference]: Start difference. First operand 2362 states and 2715 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:06,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:36:06,743 INFO L93 Difference]: Finished difference Result 2757 states and 3182 transitions. [2022-01-11 03:36:06,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:36:06,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 236 [2022-01-11 03:36:06,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:36:06,749 INFO L225 Difference]: With dead ends: 2757 [2022-01-11 03:36:06,750 INFO L226 Difference]: Without dead ends: 2755 [2022-01-11 03:36:06,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 03:36:06,751 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 39 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:36:06,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 31 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:36:06,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2022-01-11 03:36:06,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2231. [2022-01-11 03:36:06,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2231 states, 2230 states have (on average 1.1506726457399103) internal successors, (2566), 2230 states have internal predecessors, (2566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:06,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2566 transitions. [2022-01-11 03:36:06,779 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2566 transitions. Word has length 236 [2022-01-11 03:36:06,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:36:06,780 INFO L470 AbstractCegarLoop]: Abstraction has 2231 states and 2566 transitions. [2022-01-11 03:36:06,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:06,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2566 transitions. [2022-01-11 03:36:06,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-01-11 03:36:06,783 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:36:06,784 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:36:06,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-11 03:36:07,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-11 03:36:07,003 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:36:07,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:36:07,004 INFO L85 PathProgramCache]: Analyzing trace with hash -980825597, now seen corresponding path program 1 times [2022-01-11 03:36:07,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:36:07,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984282202] [2022-01-11 03:36:07,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:36:07,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:36:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:36:07,125 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-01-11 03:36:07,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:36:07,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984282202] [2022-01-11 03:36:07,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984282202] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:36:07,125 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:36:07,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:36:07,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507462735] [2022-01-11 03:36:07,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:36:07,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:36:07,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:36:07,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:36:07,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:36:07,127 INFO L87 Difference]: Start difference. First operand 2231 states and 2566 transitions. Second operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:07,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:36:07,669 INFO L93 Difference]: Finished difference Result 4722 states and 5415 transitions. [2022-01-11 03:36:07,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:36:07,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 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 248 [2022-01-11 03:36:07,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:36:07,685 INFO L225 Difference]: With dead ends: 4722 [2022-01-11 03:36:07,686 INFO L226 Difference]: Without dead ends: 2493 [2022-01-11 03:36:07,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:36:07,695 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 222 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-11 03:36:07,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 31 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-11 03:36:07,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2022-01-11 03:36:07,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 2362. [2022-01-11 03:36:07,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 2361 states have (on average 1.1266412537060568) internal successors, (2660), 2361 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:07,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 2660 transitions. [2022-01-11 03:36:07,724 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 2660 transitions. Word has length 248 [2022-01-11 03:36:07,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:36:07,724 INFO L470 AbstractCegarLoop]: Abstraction has 2362 states and 2660 transitions. [2022-01-11 03:36:07,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:07,724 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 2660 transitions. [2022-01-11 03:36:07,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-01-11 03:36:07,728 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:36:07,728 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:36:07,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 03:36:07,728 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:36:07,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:36:07,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1901364315, now seen corresponding path program 1 times [2022-01-11 03:36:07,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:36:07,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345254222] [2022-01-11 03:36:07,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:36:07,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:36:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:36:07,817 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-01-11 03:36:07,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:36:07,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345254222] [2022-01-11 03:36:07,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345254222] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:36:07,817 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:36:07,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 03:36:07,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477431645] [2022-01-11 03:36:07,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:36:07,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:36:07,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:36:07,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:36:07,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:36:07,819 INFO L87 Difference]: Start difference. First operand 2362 states and 2660 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:08,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:36:08,132 INFO L93 Difference]: Finished difference Result 4722 states and 5318 transitions. [2022-01-11 03:36:08,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:36:08,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 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 257 [2022-01-11 03:36:08,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:36:08,137 INFO L225 Difference]: With dead ends: 4722 [2022-01-11 03:36:08,137 INFO L226 Difference]: Without dead ends: 2362 [2022-01-11 03:36:08,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:36:08,140 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 82 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 03:36:08,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 62 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-11 03:36:08,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2022-01-11 03:36:08,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2362. [2022-01-11 03:36:08,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 2361 states have (on average 1.1240999576450657) internal successors, (2654), 2361 states have internal predecessors, (2654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:08,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 2654 transitions. [2022-01-11 03:36:08,169 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 2654 transitions. Word has length 257 [2022-01-11 03:36:08,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:36:08,170 INFO L470 AbstractCegarLoop]: Abstraction has 2362 states and 2654 transitions. [2022-01-11 03:36:08,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:08,170 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 2654 transitions. [2022-01-11 03:36:08,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2022-01-11 03:36:08,175 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:36:08,175 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:36:08,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 03:36:08,175 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:36:08,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:36:08,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1574517919, now seen corresponding path program 1 times [2022-01-11 03:36:08,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:36:08,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491526278] [2022-01-11 03:36:08,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:36:08,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:36:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:36:08,338 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-01-11 03:36:08,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:36:08,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491526278] [2022-01-11 03:36:08,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491526278] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:36:08,338 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:36:08,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:36:08,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952380913] [2022-01-11 03:36:08,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:36:08,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:36:08,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:36:08,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:36:08,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:36:08,340 INFO L87 Difference]: Start difference. First operand 2362 states and 2654 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:08,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:36:08,793 INFO L93 Difference]: Finished difference Result 4851 states and 5435 transitions. [2022-01-11 03:36:08,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:36:08,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 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 313 [2022-01-11 03:36:08,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:36:08,794 INFO L225 Difference]: With dead ends: 4851 [2022-01-11 03:36:08,794 INFO L226 Difference]: Without dead ends: 0 [2022-01-11 03:36:08,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:36:08,798 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 86 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:36:08,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 189 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:36:08,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-11 03:36:08,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-11 03:36:08,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:08,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-11 03:36:08,798 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 313 [2022-01-11 03:36:08,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:36:08,798 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-11 03:36:08,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:08,799 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-11 03:36:08,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-11 03:36:08,801 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-11 03:36:08,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 03:36:08,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-11 03:36:10,096 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-11 03:36:10,096 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-11 03:36:10,097 INFO L854 garLoopResultBuilder]: At program point L593-2(lines 593 603) the Hoare annotation is: (let ((.cse7 (= ~a7~0Int 1))) (let ((.cse0 (<= ~a17~0Int 0)) (.cse2 (not .cse7)) (.cse3 (<= 15 ~a8~0Int)) (.cse5 (<= ~a16~0Int 5)) (.cse9 (<= 14 ~a8~0Int)) (.cse1 (= ~a21~0Int 1)) (.cse8 (= ~a17~0Int 1)) (.cse6 (= ~a20~0Int 1)) (.cse4 (= ~a12~0Int 8))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse4) (and .cse0 .cse1 .cse2 (= ~a16~0Int 4) (= ~a8~0Int 13) .cse4) (and .cse6 .cse7) (and (<= ~a16~0Int 4) (<= ~a20~0Int 0) .cse8 .cse7) (and .cse1 .cse9 .cse6 .cse4) (and .cse5 .cse0 .cse1 .cse9 .cse4) (and .cse1 .cse2 .cse3 .cse8 .cse4) (and .cse5 .cse1 .cse9 .cse4 .cse7) (and .cse1 .cse8 .cse6 .cse4)))) [2022-01-11 03:36:10,097 INFO L861 garLoopResultBuilder]: At program point L587(lines 587 604) the Hoare annotation is: true [2022-01-11 03:36:10,097 INFO L858 garLoopResultBuilder]: For program point L598(line 598) no Hoare annotation was computed. [2022-01-11 03:36:10,097 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-11 03:36:10,097 INFO L858 garLoopResultBuilder]: For program point L41(lines 41 400) no Hoare annotation was computed. [2022-01-11 03:36:10,097 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-11 03:36:10,097 INFO L854 garLoopResultBuilder]: At program point L584(lines 40 585) the Hoare annotation is: (let ((.cse7 (= ~a7~0Int 1))) (let ((.cse0 (<= ~a17~0Int 0)) (.cse2 (not .cse7)) (.cse3 (<= 15 ~a8~0Int)) (.cse5 (<= ~a16~0Int 5)) (.cse9 (<= 14 ~a8~0Int)) (.cse1 (= ~a21~0Int 1)) (.cse8 (= ~a17~0Int 1)) (.cse6 (= ~a20~0Int 1)) (.cse4 (= ~a12~0Int 8))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse4) (and .cse0 .cse1 .cse2 (= ~a16~0Int 4) (= ~a8~0Int 13) .cse4) (and .cse6 .cse7) (and (<= ~a16~0Int 4) (<= ~a20~0Int 0) .cse8 .cse7) (and .cse1 .cse9 .cse6 .cse4) (and .cse5 .cse0 .cse1 .cse9 .cse4) (and .cse1 .cse2 .cse3 .cse8 .cse4) (and .cse5 .cse1 .cse9 .cse4 .cse7) (and .cse1 .cse8 .cse6 .cse4)))) [2022-01-11 03:36:10,097 INFO L858 garLoopResultBuilder]: For program point L45(lines 45 400) no Hoare annotation was computed. [2022-01-11 03:36:10,097 INFO L858 garLoopResultBuilder]: For program point L53(lines 53 400) no Hoare annotation was computed. [2022-01-11 03:36:10,097 INFO L858 garLoopResultBuilder]: For program point L59(lines 59 400) no Hoare annotation was computed. [2022-01-11 03:36:10,097 INFO L858 garLoopResultBuilder]: For program point L64(lines 64 400) no Hoare annotation was computed. [2022-01-11 03:36:10,097 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 400) no Hoare annotation was computed. [2022-01-11 03:36:10,097 INFO L858 garLoopResultBuilder]: For program point L75(lines 75 400) no Hoare annotation was computed. [2022-01-11 03:36:10,097 INFO L858 garLoopResultBuilder]: For program point L82(lines 82 400) no Hoare annotation was computed. [2022-01-11 03:36:10,097 INFO L858 garLoopResultBuilder]: For program point L90(lines 90 400) no Hoare annotation was computed. [2022-01-11 03:36:10,097 INFO L858 garLoopResultBuilder]: For program point L94(lines 94 400) no Hoare annotation was computed. [2022-01-11 03:36:10,098 INFO L858 garLoopResultBuilder]: For program point L102(lines 102 400) no Hoare annotation was computed. [2022-01-11 03:36:10,098 INFO L858 garLoopResultBuilder]: For program point L107(lines 107 400) no Hoare annotation was computed. [2022-01-11 03:36:10,098 INFO L858 garLoopResultBuilder]: For program point L112(lines 112 400) no Hoare annotation was computed. [2022-01-11 03:36:10,098 INFO L858 garLoopResultBuilder]: For program point L118(lines 118 400) no Hoare annotation was computed. [2022-01-11 03:36:10,098 INFO L858 garLoopResultBuilder]: For program point L124(lines 124 400) no Hoare annotation was computed. [2022-01-11 03:36:10,098 INFO L858 garLoopResultBuilder]: For program point L129(lines 129 400) no Hoare annotation was computed. [2022-01-11 03:36:10,098 INFO L858 garLoopResultBuilder]: For program point L134(lines 134 400) no Hoare annotation was computed. [2022-01-11 03:36:10,098 INFO L858 garLoopResultBuilder]: For program point L139(lines 139 400) no Hoare annotation was computed. [2022-01-11 03:36:10,098 INFO L858 garLoopResultBuilder]: For program point L146(lines 146 400) no Hoare annotation was computed. [2022-01-11 03:36:10,098 INFO L858 garLoopResultBuilder]: For program point L150(lines 150 400) no Hoare annotation was computed. [2022-01-11 03:36:10,098 INFO L858 garLoopResultBuilder]: For program point L154(lines 154 400) no Hoare annotation was computed. [2022-01-11 03:36:10,098 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 400) no Hoare annotation was computed. [2022-01-11 03:36:10,098 INFO L858 garLoopResultBuilder]: For program point L162(lines 162 400) no Hoare annotation was computed. [2022-01-11 03:36:10,098 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 400) no Hoare annotation was computed. [2022-01-11 03:36:10,098 INFO L858 garLoopResultBuilder]: For program point L175(lines 175 400) no Hoare annotation was computed. [2022-01-11 03:36:10,098 INFO L858 garLoopResultBuilder]: For program point L183(lines 183 400) no Hoare annotation was computed. [2022-01-11 03:36:10,098 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 400) no Hoare annotation was computed. [2022-01-11 03:36:10,098 INFO L858 garLoopResultBuilder]: For program point L196(lines 196 400) no Hoare annotation was computed. [2022-01-11 03:36:10,098 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 400) no Hoare annotation was computed. [2022-01-11 03:36:10,099 INFO L858 garLoopResultBuilder]: For program point L204(lines 204 400) no Hoare annotation was computed. [2022-01-11 03:36:10,099 INFO L858 garLoopResultBuilder]: For program point L207(lines 207 400) no Hoare annotation was computed. [2022-01-11 03:36:10,099 INFO L858 garLoopResultBuilder]: For program point L213(lines 213 400) no Hoare annotation was computed. [2022-01-11 03:36:10,099 INFO L858 garLoopResultBuilder]: For program point L218(lines 218 400) no Hoare annotation was computed. [2022-01-11 03:36:10,099 INFO L858 garLoopResultBuilder]: For program point L224(lines 224 400) no Hoare annotation was computed. [2022-01-11 03:36:10,099 INFO L858 garLoopResultBuilder]: For program point L228(lines 228 400) no Hoare annotation was computed. [2022-01-11 03:36:10,099 INFO L858 garLoopResultBuilder]: For program point L233(lines 233 400) no Hoare annotation was computed. [2022-01-11 03:36:10,099 INFO L858 garLoopResultBuilder]: For program point L241(lines 241 400) no Hoare annotation was computed. [2022-01-11 03:36:10,099 INFO L858 garLoopResultBuilder]: For program point L248(lines 248 400) no Hoare annotation was computed. [2022-01-11 03:36:10,099 INFO L858 garLoopResultBuilder]: For program point L255(lines 255 400) no Hoare annotation was computed. [2022-01-11 03:36:10,099 INFO L858 garLoopResultBuilder]: For program point L260(lines 260 400) no Hoare annotation was computed. [2022-01-11 03:36:10,099 INFO L858 garLoopResultBuilder]: For program point L266(lines 266 400) no Hoare annotation was computed. [2022-01-11 03:36:10,099 INFO L858 garLoopResultBuilder]: For program point L271(lines 271 400) no Hoare annotation was computed. [2022-01-11 03:36:10,099 INFO L858 garLoopResultBuilder]: For program point L275(lines 275 400) no Hoare annotation was computed. [2022-01-11 03:36:10,099 INFO L858 garLoopResultBuilder]: For program point L278(lines 278 400) no Hoare annotation was computed. [2022-01-11 03:36:10,099 INFO L858 garLoopResultBuilder]: For program point L283(lines 283 400) no Hoare annotation was computed. [2022-01-11 03:36:10,099 INFO L858 garLoopResultBuilder]: For program point L288(lines 288 400) no Hoare annotation was computed. [2022-01-11 03:36:10,099 INFO L858 garLoopResultBuilder]: For program point L296(lines 296 400) no Hoare annotation was computed. [2022-01-11 03:36:10,100 INFO L858 garLoopResultBuilder]: For program point L302(lines 302 400) no Hoare annotation was computed. [2022-01-11 03:36:10,100 INFO L858 garLoopResultBuilder]: For program point L309(lines 309 400) no Hoare annotation was computed. [2022-01-11 03:36:10,100 INFO L858 garLoopResultBuilder]: For program point L316(lines 316 400) no Hoare annotation was computed. [2022-01-11 03:36:10,100 INFO L858 garLoopResultBuilder]: For program point L322(lines 322 400) no Hoare annotation was computed. [2022-01-11 03:36:10,100 INFO L858 garLoopResultBuilder]: For program point L326(lines 326 400) no Hoare annotation was computed. [2022-01-11 03:36:10,100 INFO L858 garLoopResultBuilder]: For program point L328(lines 328 400) no Hoare annotation was computed. [2022-01-11 03:36:10,100 INFO L858 garLoopResultBuilder]: For program point L334(lines 334 400) no Hoare annotation was computed. [2022-01-11 03:36:10,100 INFO L858 garLoopResultBuilder]: For program point L339(lines 339 400) no Hoare annotation was computed. [2022-01-11 03:36:10,100 INFO L858 garLoopResultBuilder]: For program point L343(lines 343 400) no Hoare annotation was computed. [2022-01-11 03:36:10,100 INFO L858 garLoopResultBuilder]: For program point L347(lines 347 400) no Hoare annotation was computed. [2022-01-11 03:36:10,100 INFO L858 garLoopResultBuilder]: For program point L355(lines 355 400) no Hoare annotation was computed. [2022-01-11 03:36:10,100 INFO L858 garLoopResultBuilder]: For program point L363(lines 363 400) no Hoare annotation was computed. [2022-01-11 03:36:10,100 INFO L858 garLoopResultBuilder]: For program point L365(lines 365 400) no Hoare annotation was computed. [2022-01-11 03:36:10,100 INFO L858 garLoopResultBuilder]: For program point L371(lines 371 400) no Hoare annotation was computed. [2022-01-11 03:36:10,100 INFO L858 garLoopResultBuilder]: For program point L373(lines 373 400) no Hoare annotation was computed. [2022-01-11 03:36:10,100 INFO L858 garLoopResultBuilder]: For program point L375(lines 375 400) no Hoare annotation was computed. [2022-01-11 03:36:10,100 INFO L858 garLoopResultBuilder]: For program point L382(lines 382 400) no Hoare annotation was computed. [2022-01-11 03:36:10,100 INFO L858 garLoopResultBuilder]: For program point L387(lines 387 400) no Hoare annotation was computed. [2022-01-11 03:36:10,100 INFO L858 garLoopResultBuilder]: For program point L392(lines 392 400) no Hoare annotation was computed. [2022-01-11 03:36:10,101 INFO L858 garLoopResultBuilder]: For program point L401(lines 401 403) no Hoare annotation was computed. [2022-01-11 03:36:10,101 INFO L858 garLoopResultBuilder]: For program point L402(line 402) no Hoare annotation was computed. [2022-01-11 03:36:10,101 INFO L858 garLoopResultBuilder]: For program point L401-2(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,101 INFO L858 garLoopResultBuilder]: For program point L405(line 405) no Hoare annotation was computed. [2022-01-11 03:36:10,101 INFO L858 garLoopResultBuilder]: For program point L404-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,101 INFO L858 garLoopResultBuilder]: For program point L408(line 408) no Hoare annotation was computed. [2022-01-11 03:36:10,101 INFO L858 garLoopResultBuilder]: For program point L407-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,101 INFO L858 garLoopResultBuilder]: For program point L411(line 411) no Hoare annotation was computed. [2022-01-11 03:36:10,101 INFO L858 garLoopResultBuilder]: For program point L410-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,101 INFO L858 garLoopResultBuilder]: For program point L414(line 414) no Hoare annotation was computed. [2022-01-11 03:36:10,101 INFO L858 garLoopResultBuilder]: For program point L413-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,101 INFO L858 garLoopResultBuilder]: For program point L417(line 417) no Hoare annotation was computed. [2022-01-11 03:36:10,101 INFO L858 garLoopResultBuilder]: For program point L416-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,101 INFO L858 garLoopResultBuilder]: For program point L420(line 420) no Hoare annotation was computed. [2022-01-11 03:36:10,101 INFO L858 garLoopResultBuilder]: For program point L419-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,101 INFO L858 garLoopResultBuilder]: For program point L423(line 423) no Hoare annotation was computed. [2022-01-11 03:36:10,101 INFO L858 garLoopResultBuilder]: For program point L422-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,101 INFO L858 garLoopResultBuilder]: For program point L426(line 426) no Hoare annotation was computed. [2022-01-11 03:36:10,101 INFO L858 garLoopResultBuilder]: For program point L425-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,102 INFO L858 garLoopResultBuilder]: For program point L429(line 429) no Hoare annotation was computed. [2022-01-11 03:36:10,102 INFO L858 garLoopResultBuilder]: For program point L428-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,102 INFO L858 garLoopResultBuilder]: For program point L432(line 432) no Hoare annotation was computed. [2022-01-11 03:36:10,102 INFO L858 garLoopResultBuilder]: For program point L431-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,102 INFO L858 garLoopResultBuilder]: For program point L435(line 435) no Hoare annotation was computed. [2022-01-11 03:36:10,102 INFO L858 garLoopResultBuilder]: For program point L434-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,102 INFO L858 garLoopResultBuilder]: For program point L438(line 438) no Hoare annotation was computed. [2022-01-11 03:36:10,102 INFO L858 garLoopResultBuilder]: For program point L437-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,102 INFO L858 garLoopResultBuilder]: For program point L441(line 441) no Hoare annotation was computed. [2022-01-11 03:36:10,102 INFO L858 garLoopResultBuilder]: For program point L440-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,102 INFO L858 garLoopResultBuilder]: For program point L444(line 444) no Hoare annotation was computed. [2022-01-11 03:36:10,102 INFO L858 garLoopResultBuilder]: For program point L443-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,102 INFO L858 garLoopResultBuilder]: For program point L447(line 447) no Hoare annotation was computed. [2022-01-11 03:36:10,102 INFO L858 garLoopResultBuilder]: For program point L446-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,102 INFO L858 garLoopResultBuilder]: For program point L450(line 450) no Hoare annotation was computed. [2022-01-11 03:36:10,102 INFO L858 garLoopResultBuilder]: For program point L449-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,102 INFO L858 garLoopResultBuilder]: For program point L453(line 453) no Hoare annotation was computed. [2022-01-11 03:36:10,102 INFO L858 garLoopResultBuilder]: For program point L452-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,102 INFO L858 garLoopResultBuilder]: For program point L456(line 456) no Hoare annotation was computed. [2022-01-11 03:36:10,103 INFO L858 garLoopResultBuilder]: For program point L455-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,103 INFO L858 garLoopResultBuilder]: For program point L459(line 459) no Hoare annotation was computed. [2022-01-11 03:36:10,103 INFO L858 garLoopResultBuilder]: For program point L458-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,103 INFO L858 garLoopResultBuilder]: For program point L462(line 462) no Hoare annotation was computed. [2022-01-11 03:36:10,103 INFO L858 garLoopResultBuilder]: For program point L461-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,103 INFO L858 garLoopResultBuilder]: For program point L465(line 465) no Hoare annotation was computed. [2022-01-11 03:36:10,103 INFO L858 garLoopResultBuilder]: For program point L464-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,103 INFO L858 garLoopResultBuilder]: For program point L468(line 468) no Hoare annotation was computed. [2022-01-11 03:36:10,103 INFO L858 garLoopResultBuilder]: For program point L467-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,103 INFO L858 garLoopResultBuilder]: For program point L471(line 471) no Hoare annotation was computed. [2022-01-11 03:36:10,103 INFO L858 garLoopResultBuilder]: For program point L470-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,103 INFO L858 garLoopResultBuilder]: For program point L474(line 474) no Hoare annotation was computed. [2022-01-11 03:36:10,103 INFO L858 garLoopResultBuilder]: For program point L473-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,103 INFO L858 garLoopResultBuilder]: For program point L477(line 477) no Hoare annotation was computed. [2022-01-11 03:36:10,103 INFO L858 garLoopResultBuilder]: For program point L476-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,103 INFO L858 garLoopResultBuilder]: For program point L480(line 480) no Hoare annotation was computed. [2022-01-11 03:36:10,104 INFO L858 garLoopResultBuilder]: For program point L479-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,104 INFO L858 garLoopResultBuilder]: For program point L483(line 483) no Hoare annotation was computed. [2022-01-11 03:36:10,104 INFO L858 garLoopResultBuilder]: For program point L482-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,104 INFO L858 garLoopResultBuilder]: For program point L486(line 486) no Hoare annotation was computed. [2022-01-11 03:36:10,104 INFO L858 garLoopResultBuilder]: For program point L485-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,104 INFO L858 garLoopResultBuilder]: For program point L489(line 489) no Hoare annotation was computed. [2022-01-11 03:36:10,104 INFO L858 garLoopResultBuilder]: For program point L488-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,104 INFO L858 garLoopResultBuilder]: For program point L492(line 492) no Hoare annotation was computed. [2022-01-11 03:36:10,104 INFO L858 garLoopResultBuilder]: For program point L491-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,104 INFO L858 garLoopResultBuilder]: For program point L495(line 495) no Hoare annotation was computed. [2022-01-11 03:36:10,104 INFO L858 garLoopResultBuilder]: For program point L494-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,104 INFO L858 garLoopResultBuilder]: For program point L498(line 498) no Hoare annotation was computed. [2022-01-11 03:36:10,104 INFO L858 garLoopResultBuilder]: For program point L497-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,104 INFO L858 garLoopResultBuilder]: For program point L501(line 501) no Hoare annotation was computed. [2022-01-11 03:36:10,104 INFO L858 garLoopResultBuilder]: For program point L500-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,105 INFO L858 garLoopResultBuilder]: For program point L504(line 504) no Hoare annotation was computed. [2022-01-11 03:36:10,105 INFO L858 garLoopResultBuilder]: For program point L503-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,105 INFO L858 garLoopResultBuilder]: For program point L507(line 507) no Hoare annotation was computed. [2022-01-11 03:36:10,105 INFO L858 garLoopResultBuilder]: For program point L506-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,105 INFO L858 garLoopResultBuilder]: For program point L510(line 510) no Hoare annotation was computed. [2022-01-11 03:36:10,105 INFO L858 garLoopResultBuilder]: For program point L509-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,105 INFO L858 garLoopResultBuilder]: For program point L513(line 513) no Hoare annotation was computed. [2022-01-11 03:36:10,105 INFO L858 garLoopResultBuilder]: For program point L512-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,105 INFO L858 garLoopResultBuilder]: For program point L516(line 516) no Hoare annotation was computed. [2022-01-11 03:36:10,105 INFO L858 garLoopResultBuilder]: For program point L515-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,105 INFO L858 garLoopResultBuilder]: For program point L519(line 519) no Hoare annotation was computed. [2022-01-11 03:36:10,105 INFO L858 garLoopResultBuilder]: For program point L518-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,105 INFO L858 garLoopResultBuilder]: For program point L522(line 522) no Hoare annotation was computed. [2022-01-11 03:36:10,105 INFO L858 garLoopResultBuilder]: For program point L521-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,106 INFO L858 garLoopResultBuilder]: For program point L525(line 525) no Hoare annotation was computed. [2022-01-11 03:36:10,106 INFO L858 garLoopResultBuilder]: For program point L524-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,106 INFO L858 garLoopResultBuilder]: For program point L528(line 528) no Hoare annotation was computed. [2022-01-11 03:36:10,106 INFO L858 garLoopResultBuilder]: For program point L527-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,106 INFO L858 garLoopResultBuilder]: For program point L531(line 531) no Hoare annotation was computed. [2022-01-11 03:36:10,106 INFO L858 garLoopResultBuilder]: For program point L530-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,106 INFO L858 garLoopResultBuilder]: For program point L534(line 534) no Hoare annotation was computed. [2022-01-11 03:36:10,106 INFO L858 garLoopResultBuilder]: For program point L533-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,106 INFO L858 garLoopResultBuilder]: For program point L537(line 537) no Hoare annotation was computed. [2022-01-11 03:36:10,106 INFO L858 garLoopResultBuilder]: For program point L536-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,106 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 537) no Hoare annotation was computed. [2022-01-11 03:36:10,106 INFO L858 garLoopResultBuilder]: For program point L540(line 540) no Hoare annotation was computed. [2022-01-11 03:36:10,106 INFO L858 garLoopResultBuilder]: For program point L539-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,107 INFO L858 garLoopResultBuilder]: For program point L543(line 543) no Hoare annotation was computed. [2022-01-11 03:36:10,107 INFO L858 garLoopResultBuilder]: For program point L542-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,107 INFO L858 garLoopResultBuilder]: For program point L546(line 546) no Hoare annotation was computed. [2022-01-11 03:36:10,107 INFO L858 garLoopResultBuilder]: For program point L545-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,107 INFO L858 garLoopResultBuilder]: For program point L549(line 549) no Hoare annotation was computed. [2022-01-11 03:36:10,107 INFO L858 garLoopResultBuilder]: For program point L548-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,111 INFO L858 garLoopResultBuilder]: For program point L552(line 552) no Hoare annotation was computed. [2022-01-11 03:36:10,111 INFO L858 garLoopResultBuilder]: For program point L551-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,111 INFO L858 garLoopResultBuilder]: For program point L555(line 555) no Hoare annotation was computed. [2022-01-11 03:36:10,111 INFO L858 garLoopResultBuilder]: For program point L554-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,111 INFO L858 garLoopResultBuilder]: For program point L558(line 558) no Hoare annotation was computed. [2022-01-11 03:36:10,111 INFO L858 garLoopResultBuilder]: For program point L557-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,111 INFO L858 garLoopResultBuilder]: For program point L561(line 561) no Hoare annotation was computed. [2022-01-11 03:36:10,111 INFO L858 garLoopResultBuilder]: For program point L560-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,111 INFO L858 garLoopResultBuilder]: For program point L564(line 564) no Hoare annotation was computed. [2022-01-11 03:36:10,111 INFO L858 garLoopResultBuilder]: For program point L563-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,111 INFO L858 garLoopResultBuilder]: For program point L567(line 567) no Hoare annotation was computed. [2022-01-11 03:36:10,111 INFO L858 garLoopResultBuilder]: For program point L566-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,111 INFO L858 garLoopResultBuilder]: For program point L570(line 570) no Hoare annotation was computed. [2022-01-11 03:36:10,111 INFO L858 garLoopResultBuilder]: For program point L569-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,111 INFO L858 garLoopResultBuilder]: For program point L573(line 573) no Hoare annotation was computed. [2022-01-11 03:36:10,112 INFO L858 garLoopResultBuilder]: For program point L572-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,112 INFO L858 garLoopResultBuilder]: For program point L576(line 576) no Hoare annotation was computed. [2022-01-11 03:36:10,112 INFO L858 garLoopResultBuilder]: For program point L575-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,112 INFO L858 garLoopResultBuilder]: For program point L579(line 579) no Hoare annotation was computed. [2022-01-11 03:36:10,112 INFO L858 garLoopResultBuilder]: For program point L578-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:36:10,112 INFO L858 garLoopResultBuilder]: For program point L582(line 582) no Hoare annotation was computed. [2022-01-11 03:36:10,112 INFO L858 garLoopResultBuilder]: For program point L581-1(lines 581 583) no Hoare annotation was computed. [2022-01-11 03:36:10,115 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:36:10,117 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 03:36:10,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 03:36:10 BasicIcfg [2022-01-11 03:36:10,149 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 03:36:10,149 INFO L158 Benchmark]: Toolchain (without parser) took 14094.78ms. Allocated memory was 182.5MB in the beginning and 392.2MB in the end (delta: 209.7MB). Free memory was 129.6MB in the beginning and 251.5MB in the end (delta: -121.9MB). Peak memory consumption was 218.4MB. Max. memory is 8.0GB. [2022-01-11 03:36:10,149 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 182.5MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 03:36:10,150 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.86ms. Allocated memory was 182.5MB in the beginning and 243.3MB in the end (delta: 60.8MB). Free memory was 129.4MB in the beginning and 201.6MB in the end (delta: -72.2MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. [2022-01-11 03:36:10,150 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.99ms. Allocated memory is still 243.3MB. Free memory was 201.6MB in the beginning and 195.8MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-11 03:36:10,150 INFO L158 Benchmark]: Boogie Preprocessor took 79.23ms. Allocated memory is still 243.3MB. Free memory was 195.8MB in the beginning and 191.1MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-11 03:36:10,150 INFO L158 Benchmark]: RCFGBuilder took 963.15ms. Allocated memory is still 243.3MB. Free memory was 191.1MB in the beginning and 129.8MB in the end (delta: 61.3MB). Peak memory consumption was 60.8MB. Max. memory is 8.0GB. [2022-01-11 03:36:10,150 INFO L158 Benchmark]: IcfgTransformer took 146.41ms. Allocated memory is still 243.3MB. Free memory was 129.8MB in the beginning and 93.6MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-01-11 03:36:10,151 INFO L158 Benchmark]: TraceAbstraction took 12405.98ms. Allocated memory was 243.3MB in the beginning and 392.2MB in the end (delta: 148.9MB). Free memory was 93.1MB in the beginning and 251.5MB in the end (delta: -158.4MB). Peak memory consumption was 121.8MB. Max. memory is 8.0GB. [2022-01-11 03:36:10,152 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.08ms. Allocated memory is still 182.5MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 396.86ms. Allocated memory was 182.5MB in the beginning and 243.3MB in the end (delta: 60.8MB). Free memory was 129.4MB in the beginning and 201.6MB in the end (delta: -72.2MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 87.99ms. Allocated memory is still 243.3MB. Free memory was 201.6MB in the beginning and 195.8MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 79.23ms. Allocated memory is still 243.3MB. Free memory was 195.8MB in the beginning and 191.1MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 963.15ms. Allocated memory is still 243.3MB. Free memory was 191.1MB in the beginning and 129.8MB in the end (delta: 61.3MB). Peak memory consumption was 60.8MB. Max. memory is 8.0GB. * IcfgTransformer took 146.41ms. Allocated memory is still 243.3MB. Free memory was 129.8MB in the beginning and 93.6MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 12405.98ms. Allocated memory was 243.3MB in the beginning and 392.2MB in the end (delta: 148.9MB). Free memory was 93.1MB in the beginning and 251.5MB in the end (delta: -158.4MB). Peak memory consumption was 121.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 537]: 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, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.3s, OverallIterations: 14, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2062 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2062 mSDsluCounter, 1120 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 985 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5985 IncrementalHoareTripleChecker+Invalid, 6970 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 985 mSolverCounterUnsat, 1019 mSDtfsCounter, 5985 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2362occurred in iteration=10, InterpolantAutomatonStates: 47, 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, 14 MinimizatonAttempts, 2229 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 45 NumberOfFragments, 293 HoareAnnotationTreeSize, 3 FomulaSimplifications, 3182 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 3 FomulaSimplificationsInter, 10640 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 3001 NumberOfCodeBlocks, 3001 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2986 ConstructedInterpolants, 0 QuantifiedInterpolants, 12078 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3974 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 2104/2140 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: 593]: Loop Invariant Derived loop invariant: (((((((((((1bv32 == a20 && 8bv32 == a12) && ~bvule32(a16, 5bv32)) && 1bv32 == a21) || ((((8bv32 == a12 && !(a7 == 1bv32)) && ~bvule32(a17, 0bv32)) && ~bvule32(15bv32, a8)) && 1bv32 == a21)) || ((((8bv32 == a12 && ~bvule32(14bv32, a8)) && ~bvule32(a16, 5bv32)) && ~bvule32(a17, 0bv32)) && 1bv32 == a21)) || ((((8bv32 == a12 && a7 == 1bv32) && ~bvule32(14bv32, a8)) && ~bvule32(a16, 5bv32)) && 1bv32 == a21)) || (((1bv32 == a20 && 8bv32 == a12) && ~bvule32(14bv32, a8)) && 1bv32 == a21)) || (((1bv32 == a20 && 8bv32 == a12) && 1bv32 == a17) && 1bv32 == a21)) || (((a7 == 1bv32 && ~bvule32(a16, 4bv32)) && 1bv32 == a17) && ~bvule32(a20, 0bv32))) || (((((8bv32 == a12 && !(a7 == 1bv32)) && 4bv32 == a16) && ~bvule32(a17, 0bv32)) && a8 == 13bv32) && 1bv32 == a21)) || ((((8bv32 == a12 && !(a7 == 1bv32)) && 1bv32 == a17) && ~bvule32(15bv32, a8)) && 1bv32 == a21)) || (1bv32 == a20 && a7 == 1bv32) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: (((((((((((1bv32 == a20 && 8bv32 == a12) && ~bvule32(a16, 5bv32)) && 1bv32 == a21) || ((((8bv32 == a12 && !(a7 == 1bv32)) && ~bvule32(a17, 0bv32)) && ~bvule32(15bv32, a8)) && 1bv32 == a21)) || ((((8bv32 == a12 && ~bvule32(14bv32, a8)) && ~bvule32(a16, 5bv32)) && ~bvule32(a17, 0bv32)) && 1bv32 == a21)) || ((((8bv32 == a12 && a7 == 1bv32) && ~bvule32(14bv32, a8)) && ~bvule32(a16, 5bv32)) && 1bv32 == a21)) || (((1bv32 == a20 && 8bv32 == a12) && ~bvule32(14bv32, a8)) && 1bv32 == a21)) || (((1bv32 == a20 && 8bv32 == a12) && 1bv32 == a17) && 1bv32 == a21)) || (((a7 == 1bv32 && ~bvule32(a16, 4bv32)) && 1bv32 == a17) && ~bvule32(a20, 0bv32))) || (((((8bv32 == a12 && !(a7 == 1bv32)) && 4bv32 == a16) && ~bvule32(a17, 0bv32)) && a8 == 13bv32) && 1bv32 == a21)) || ((((8bv32 == a12 && !(a7 == 1bv32)) && 1bv32 == a17) && ~bvule32(15bv32, a8)) && 1bv32 == a21)) || (1bv32 == a20 && a7 == 1bv32) RESULT: Ultimate proved your program to be correct! [2022-01-11 03:36:10,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...