/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_label17.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 03:35:16,225 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 03:35:16,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 03:35:16,283 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 03:35:16,283 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 03:35:16,289 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 03:35:16,292 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 03:35:16,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 03:35:16,295 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 03:35:16,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 03:35:16,301 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 03:35:16,302 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 03:35:16,302 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 03:35:16,303 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 03:35:16,304 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 03:35:16,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 03:35:16,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 03:35:16,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 03:35:16,307 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 03:35:16,308 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 03:35:16,309 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 03:35:16,316 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 03:35:16,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 03:35:16,319 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 03:35:16,327 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 03:35:16,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 03:35:16,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 03:35:16,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 03:35:16,328 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 03:35:16,329 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 03:35:16,329 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 03:35:16,329 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 03:35:16,330 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 03:35:16,331 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 03:35:16,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 03:35:16,331 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 03:35:16,332 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 03:35:16,332 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 03:35:16,332 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 03:35:16,333 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 03:35:16,333 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 03:35:16,336 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:16,373 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 03:35:16,374 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 03:35:16,374 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 03:35:16,374 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 03:35:16,375 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 03:35:16,375 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 03:35:16,376 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 03:35:16,376 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 03:35:16,376 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 03:35:16,376 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 03:35:16,377 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 03:35:16,377 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 03:35:16,377 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 03:35:16,377 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 03:35:16,377 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 03:35:16,377 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 03:35:16,377 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 03:35:16,378 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 03:35:16,378 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 03:35:16,378 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 03:35:16,378 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 03:35:16,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 03:35:16,379 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 03:35:16,379 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 03:35:16,379 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 03:35:16,379 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 03:35:16,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 03:35:16,380 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 03:35:16,380 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 03:35:16,380 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 03:35:16,380 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 03:35:16,380 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 03:35:16,381 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 03:35:16,381 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:16,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 03:35:16,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 03:35:16,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 03:35:16,613 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 03:35:16,613 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 03:35:16,615 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label17.c [2022-01-11 03:35:16,664 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8981e575/8f18565688464aadb71bfb7a5f08eb47/FLAG47923e879 [2022-01-11 03:35:17,104 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 03:35:17,105 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label17.c [2022-01-11 03:35:17,121 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8981e575/8f18565688464aadb71bfb7a5f08eb47/FLAG47923e879 [2022-01-11 03:35:17,450 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8981e575/8f18565688464aadb71bfb7a5f08eb47 [2022-01-11 03:35:17,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 03:35:17,453 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 03:35:17,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 03:35:17,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 03:35:17,459 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 03:35:17,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 03:35:17" (1/1) ... [2022-01-11 03:35:17,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f1cb20d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:35:17, skipping insertion in model container [2022-01-11 03:35:17,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 03:35:17" (1/1) ... [2022-01-11 03:35:17,466 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 03:35:17,511 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 03:35:17,782 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_label17.c[19973,19986] [2022-01-11 03:35:17,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 03:35:17,820 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 03:35:17,924 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_label17.c[19973,19986] [2022-01-11 03:35:17,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 03:35:17,950 INFO L208 MainTranslator]: Completed translation [2022-01-11 03:35:17,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:35:17 WrapperNode [2022-01-11 03:35:17,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 03:35:17,951 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 03:35:17,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 03:35:17,952 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 03:35:17,958 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:17" (1/1) ... [2022-01-11 03:35:17,979 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:17" (1/1) ... [2022-01-11 03:35:18,036 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2022-01-11 03:35:18,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 03:35:18,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 03:35:18,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 03:35:18,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 03:35:18,045 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:17" (1/1) ... [2022-01-11 03:35:18,045 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:17" (1/1) ... [2022-01-11 03:35:18,050 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:17" (1/1) ... [2022-01-11 03:35:18,050 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:17" (1/1) ... [2022-01-11 03:35:18,068 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:17" (1/1) ... [2022-01-11 03:35:18,076 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:17" (1/1) ... [2022-01-11 03:35:18,080 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:17" (1/1) ... [2022-01-11 03:35:18,086 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 03:35:18,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 03:35:18,087 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 03:35:18,087 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 03:35:18,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:35:17" (1/1) ... [2022-01-11 03:35:18,100 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 03:35:18,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:35:18,133 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:18,155 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:18,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 03:35:18,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 03:35:18,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 03:35:18,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 03:35:18,258 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 03:35:18,260 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 03:35:19,196 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 03:35:19,207 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 03:35:19,207 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-11 03:35:19,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:35:19 BoogieIcfgContainer [2022-01-11 03:35:19,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 03:35:19,211 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 03:35:19,211 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 03:35:19,215 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 03:35:19,218 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:35:19" (1/1) ... [2022-01-11 03:35:19,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 03:35:19 BasicIcfg [2022-01-11 03:35:19,448 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 03:35:19,449 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 03:35:19,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 03:35:19,452 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 03:35:19,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 03:35:17" (1/4) ... [2022-01-11 03:35:19,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cfc159f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 03:35:19, skipping insertion in model container [2022-01-11 03:35:19,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:35:17" (2/4) ... [2022-01-11 03:35:19,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cfc159f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 03:35:19, skipping insertion in model container [2022-01-11 03:35:19,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:35:19" (3/4) ... [2022-01-11 03:35:19,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cfc159f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 03:35:19, skipping insertion in model container [2022-01-11 03:35:19,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 03:35:19" (4/4) ... [2022-01-11 03:35:19,454 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem01_label17.cTransformedIcfg [2022-01-11 03:35:19,461 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 03:35:19,461 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 03:35:19,509 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 03:35:19,516 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:19,516 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 03:35:19,535 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:19,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-01-11 03:35:19,549 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:19,550 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] [2022-01-11 03:35:19,551 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:19,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:19,556 INFO L85 PathProgramCache]: Analyzing trace with hash 2044253260, now seen corresponding path program 1 times [2022-01-11 03:35:19,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:19,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338568255] [2022-01-11 03:35:19,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:19,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:20,114 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:20,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:20,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338568255] [2022-01-11 03:35:20,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338568255] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:20,116 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:20,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 03:35:20,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874387095] [2022-01-11 03:35:20,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:20,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:35:20,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:20,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:35:20,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:20,150 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 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:20,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:20,902 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2022-01-11 03:35:20,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:35:20,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2022-01-11 03:35:20,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:20,921 INFO L225 Difference]: With dead ends: 528 [2022-01-11 03:35:20,921 INFO L226 Difference]: Without dead ends: 266 [2022-01-11 03:35:20,924 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:20,929 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 56 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:20,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 84 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-11 03:35:20,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-01-11 03:35:20,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2022-01-11 03:35:20,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.4339622641509433) internal successors, (380), 265 states have internal predecessors, (380), 0 states have call successors, (0), 0 states 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:20,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2022-01-11 03:35:20,994 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 116 [2022-01-11 03:35:20,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:20,995 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2022-01-11 03:35:20,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:20,997 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2022-01-11 03:35:21,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-01-11 03:35:21,003 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:21,004 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:35:21,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 03:35:21,004 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:21,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:21,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1453953585, now seen corresponding path program 1 times [2022-01-11 03:35:21,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:21,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710566504] [2022-01-11 03:35:21,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:21,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:21,122 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:35:21,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:21,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710566504] [2022-01-11 03:35:21,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710566504] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:21,123 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:21,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 03:35:21,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003088380] [2022-01-11 03:35:21,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:21,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:35:21,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:21,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:35:21,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:21,127 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states 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:21,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:21,634 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2022-01-11 03:35:21,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:35:21,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2022-01-11 03:35:21,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:21,637 INFO L225 Difference]: With dead ends: 792 [2022-01-11 03:35:21,637 INFO L226 Difference]: Without dead ends: 528 [2022-01-11 03:35:21,638 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:21,640 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 145 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:21,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 17 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-11 03:35:21,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-01-11 03:35:21,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2022-01-11 03:35:21,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.413662239089184) internal successors, (745), 527 states have internal predecessors, (745), 0 states have call successors, (0), 0 states 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:21,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 745 transitions. [2022-01-11 03:35:21,674 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 745 transitions. Word has length 122 [2022-01-11 03:35:21,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:21,679 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 745 transitions. [2022-01-11 03:35:21,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states 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:21,679 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 745 transitions. [2022-01-11 03:35:21,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-11 03:35:21,685 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:21,686 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:35:21,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 03:35:21,686 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:21,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:21,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1421405912, now seen corresponding path program 1 times [2022-01-11 03:35:21,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:21,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403122589] [2022-01-11 03:35:21,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:21,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:21,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:35:21,956 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:21,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403122589] [2022-01-11 03:35:21,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403122589] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:21,957 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:21,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:35:21,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514082475] [2022-01-11 03:35:21,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:21,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:35:21,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:21,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:35:21,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:35:21,961 INFO L87 Difference]: Start difference. First operand 528 states and 745 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:22,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:22,704 INFO L93 Difference]: Finished difference Result 1542 states and 2206 transitions. [2022-01-11 03:35:22,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:35:22,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2022-01-11 03:35:22,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:22,711 INFO L225 Difference]: With dead ends: 1542 [2022-01-11 03:35:22,711 INFO L226 Difference]: Without dead ends: 921 [2022-01-11 03:35:22,712 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:35:22,713 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 128 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:22,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 83 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-11 03:35:22,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2022-01-11 03:35:22,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 659. [2022-01-11 03:35:22,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 1.2294832826747721) internal successors, (809), 658 states have internal predecessors, (809), 0 states have call successors, (0), 0 states 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:22,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 809 transitions. [2022-01-11 03:35:22,729 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 809 transitions. Word has length 123 [2022-01-11 03:35:22,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:22,729 INFO L470 AbstractCegarLoop]: Abstraction has 659 states and 809 transitions. [2022-01-11 03:35:22,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:22,730 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 809 transitions. [2022-01-11 03:35:22,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-01-11 03:35:22,731 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:22,732 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 03:35:22,732 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:22,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:22,733 INFO L85 PathProgramCache]: Analyzing trace with hash -935800625, now seen corresponding path program 1 times [2022-01-11 03:35:22,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:22,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104307365] [2022-01-11 03:35:22,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:22,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:22,813 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-11 03:35:22,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:22,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104307365] [2022-01-11 03:35:22,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104307365] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:22,813 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:22,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 03:35:22,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863401388] [2022-01-11 03:35:22,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:22,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:35:22,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:22,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:35:22,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:22,815 INFO L87 Difference]: Start difference. First operand 659 states and 809 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:35:23,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:23,231 INFO L93 Difference]: Finished difference Result 1578 states and 1933 transitions. [2022-01-11 03:35:23,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:35:23,232 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 131 [2022-01-11 03:35:23,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:23,236 INFO L225 Difference]: With dead ends: 1578 [2022-01-11 03:35:23,236 INFO L226 Difference]: Without dead ends: 921 [2022-01-11 03:35:23,237 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:23,238 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 125 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:23,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 47 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:35:23,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2022-01-11 03:35:23,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921. [2022-01-11 03:35:23,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.1891304347826086) internal successors, (1094), 920 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states 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:23,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1094 transitions. [2022-01-11 03:35:23,258 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1094 transitions. Word has length 131 [2022-01-11 03:35:23,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:23,258 INFO L470 AbstractCegarLoop]: Abstraction has 921 states and 1094 transitions. [2022-01-11 03:35:23,258 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:35:23,258 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1094 transitions. [2022-01-11 03:35:23,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-01-11 03:35:23,261 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:23,261 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:35:23,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 03:35:23,261 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:23,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:23,262 INFO L85 PathProgramCache]: Analyzing trace with hash 927402613, now seen corresponding path program 1 times [2022-01-11 03:35:23,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:23,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153673899] [2022-01-11 03:35:23,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:23,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:23,364 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-11 03:35:23,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:23,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153673899] [2022-01-11 03:35:23,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153673899] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:23,366 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:23,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:35:23,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619775703] [2022-01-11 03:35:23,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:23,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:35:23,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:23,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:35:23,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:23,368 INFO L87 Difference]: Start difference. First operand 921 states and 1094 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states 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:23,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:23,844 INFO L93 Difference]: Finished difference Result 2102 states and 2479 transitions. [2022-01-11 03:35:23,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:35:23,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 146 [2022-01-11 03:35:23,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:23,848 INFO L225 Difference]: With dead ends: 2102 [2022-01-11 03:35:23,848 INFO L226 Difference]: Without dead ends: 1183 [2022-01-11 03:35:23,850 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:35:23,851 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 121 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:23,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 191 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:35:23,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2022-01-11 03:35:23,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1052. [2022-01-11 03:35:23,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 1.1455756422454806) internal successors, (1204), 1051 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states 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:23,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1204 transitions. [2022-01-11 03:35:23,871 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1204 transitions. Word has length 146 [2022-01-11 03:35:23,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:23,871 INFO L470 AbstractCegarLoop]: Abstraction has 1052 states and 1204 transitions. [2022-01-11 03:35:23,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states 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:23,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1204 transitions. [2022-01-11 03:35:23,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-11 03:35:23,875 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:23,875 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 03:35:23,876 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:23,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:23,876 INFO L85 PathProgramCache]: Analyzing trace with hash 681655011, now seen corresponding path program 1 times [2022-01-11 03:35:23,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:23,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554983032] [2022-01-11 03:35:23,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:23,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:23,968 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-11 03:35:23,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:23,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554983032] [2022-01-11 03:35:23,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554983032] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:23,969 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:23,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:35:23,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760040903] [2022-01-11 03:35:23,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:23,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:35:23,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:23,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:35:23,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:23,971 INFO L87 Difference]: Start difference. First operand 1052 states and 1204 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states 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:24,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:24,423 INFO L93 Difference]: Finished difference Result 2497 states and 2884 transitions. [2022-01-11 03:35:24,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:35:24,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 160 [2022-01-11 03:35:24,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:24,428 INFO L225 Difference]: With dead ends: 2497 [2022-01-11 03:35:24,428 INFO L226 Difference]: Without dead ends: 1447 [2022-01-11 03:35:24,429 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:35:24,433 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 123 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:24,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 188 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:35:24,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2022-01-11 03:35:24,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1445. [2022-01-11 03:35:24,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.1246537396121883) internal successors, (1624), 1444 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states 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:24,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1624 transitions. [2022-01-11 03:35:24,469 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1624 transitions. Word has length 160 [2022-01-11 03:35:24,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:24,469 INFO L470 AbstractCegarLoop]: Abstraction has 1445 states and 1624 transitions. [2022-01-11 03:35:24,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states 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:24,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1624 transitions. [2022-01-11 03:35:24,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-01-11 03:35:24,472 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:24,473 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 03:35:24,473 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:24,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:24,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1002997914, now seen corresponding path program 1 times [2022-01-11 03:35:24,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:24,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586890692] [2022-01-11 03:35:24,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:24,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:24,569 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-11 03:35:24,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:24,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586890692] [2022-01-11 03:35:24,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586890692] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:24,570 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:24,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:35:24,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156231609] [2022-01-11 03:35:24,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:24,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:35:24,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:24,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:35:24,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:24,572 INFO L87 Difference]: Start difference. First operand 1445 states and 1624 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states 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:25,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:25,002 INFO L93 Difference]: Finished difference Result 3281 states and 3715 transitions. [2022-01-11 03:35:25,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:35:25,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 163 [2022-01-11 03:35:25,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:25,009 INFO L225 Difference]: With dead ends: 3281 [2022-01-11 03:35:25,009 INFO L226 Difference]: Without dead ends: 1838 [2022-01-11 03:35:25,012 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:35:25,015 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 122 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:25,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 39 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:35:25,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2022-01-11 03:35:25,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1576. [2022-01-11 03:35:25,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.1301587301587301) internal successors, (1780), 1575 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states 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:25,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1780 transitions. [2022-01-11 03:35:25,050 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1780 transitions. Word has length 163 [2022-01-11 03:35:25,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:25,051 INFO L470 AbstractCegarLoop]: Abstraction has 1576 states and 1780 transitions. [2022-01-11 03:35:25,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states 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:25,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1780 transitions. [2022-01-11 03:35:25,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-01-11 03:35:25,055 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:25,055 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 03:35:25,056 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:25,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:25,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2068503346, now seen corresponding path program 1 times [2022-01-11 03:35:25,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:25,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141418675] [2022-01-11 03:35:25,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:25,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:25,265 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 65 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:35:25,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:25,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141418675] [2022-01-11 03:35:25,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141418675] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:35:25,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909802095] [2022-01-11 03:35:25,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:25,266 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:35:25,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:35:25,268 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:35:25,272 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:35:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:25,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 3009 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-11 03:35:25,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:35:26,049 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-11 03:35:26,050 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-11 03:35:26,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909802095] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:26,050 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-11 03:35:26,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-01-11 03:35:26,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881494006] [2022-01-11 03:35:26,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:26,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:35:26,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:26,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:35:26,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-11 03:35:26,052 INFO L87 Difference]: Start difference. First operand 1576 states and 1780 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states 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:26,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:26,497 INFO L93 Difference]: Finished difference Result 3805 states and 4333 transitions. [2022-01-11 03:35:26,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:35:26,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 179 [2022-01-11 03:35:26,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:26,507 INFO L225 Difference]: With dead ends: 3805 [2022-01-11 03:35:26,507 INFO L226 Difference]: Without dead ends: 2231 [2022-01-11 03:35:26,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-11 03:35:26,510 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 22 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:26,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 175 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:35:26,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2022-01-11 03:35:26,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1838. [2022-01-11 03:35:26,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.130647795318454) internal successors, (2077), 1837 states have internal predecessors, (2077), 0 states have call successors, (0), 0 states 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:26,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2077 transitions. [2022-01-11 03:35:26,541 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2077 transitions. Word has length 179 [2022-01-11 03:35:26,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:26,542 INFO L470 AbstractCegarLoop]: Abstraction has 1838 states and 2077 transitions. [2022-01-11 03:35:26,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states 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:26,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2077 transitions. [2022-01-11 03:35:26,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-01-11 03:35:26,546 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:26,546 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,576 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:35:26,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:35:26,772 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:26,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:26,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1870753487, now seen corresponding path program 1 times [2022-01-11 03:35:26,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:26,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365447778] [2022-01-11 03:35:26,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:26,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:26,898 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-11 03:35:26,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:26,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365447778] [2022-01-11 03:35:26,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365447778] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:26,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:26,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:35:26,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802824429] [2022-01-11 03:35:26,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:26,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:35:26,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:26,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:35:26,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:35:26,901 INFO L87 Difference]: Start difference. First operand 1838 states and 2077 transitions. Second operand has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:27,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:27,616 INFO L93 Difference]: Finished difference Result 4722 states and 5345 transitions. [2022-01-11 03:35:27,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:35:27,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 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 191 [2022-01-11 03:35:27,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:27,625 INFO L225 Difference]: With dead ends: 4722 [2022-01-11 03:35:27,625 INFO L226 Difference]: Without dead ends: 2886 [2022-01-11 03:35:27,627 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:35:27,629 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 217 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:27,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 21 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-11 03:35:27,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2022-01-11 03:35:27,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 2231. [2022-01-11 03:35:27,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2231 states, 2230 states have (on average 1.1269058295964125) internal successors, (2513), 2230 states have internal predecessors, (2513), 0 states have call successors, (0), 0 states 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:27,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2513 transitions. [2022-01-11 03:35:27,671 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2513 transitions. Word has length 191 [2022-01-11 03:35:27,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:27,671 INFO L470 AbstractCegarLoop]: Abstraction has 2231 states and 2513 transitions. [2022-01-11 03:35:27,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:27,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2513 transitions. [2022-01-11 03:35:27,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-01-11 03:35:27,675 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:27,675 INFO L514 BasicCegarLoop]: trace histogram [4, 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, 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] [2022-01-11 03:35:27,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 03:35:27,676 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:27,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:27,676 INFO L85 PathProgramCache]: Analyzing trace with hash -178118281, now seen corresponding path program 1 times [2022-01-11 03:35:27,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:27,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357026239] [2022-01-11 03:35:27,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:27,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:27,795 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-11 03:35:27,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:27,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357026239] [2022-01-11 03:35:27,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357026239] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:27,795 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:27,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 03:35:27,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144924791] [2022-01-11 03:35:27,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:27,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:35:27,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:27,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:35:27,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:27,797 INFO L87 Difference]: Start difference. First operand 2231 states and 2513 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:28,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:28,234 INFO L93 Difference]: Finished difference Result 4984 states and 5620 transitions. [2022-01-11 03:35:28,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:35:28,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 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:35:28,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:28,245 INFO L225 Difference]: With dead ends: 4984 [2022-01-11 03:35:28,245 INFO L226 Difference]: Without dead ends: 2755 [2022-01-11 03:35:28,248 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:28,249 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 74 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:28,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 56 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:35:28,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2022-01-11 03:35:28,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2362. [2022-01-11 03:35:28,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 2361 states have (on average 1.121982210927573) internal successors, (2649), 2361 states have internal predecessors, (2649), 0 states have call successors, (0), 0 states 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:28,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 2649 transitions. [2022-01-11 03:35:28,297 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 2649 transitions. Word has length 200 [2022-01-11 03:35:28,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:28,297 INFO L470 AbstractCegarLoop]: Abstraction has 2362 states and 2649 transitions. [2022-01-11 03:35:28,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:28,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 2649 transitions. [2022-01-11 03:35:28,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-01-11 03:35:28,302 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:28,302 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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, 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:35:28,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 03:35:28,303 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:28,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:28,311 INFO L85 PathProgramCache]: Analyzing trace with hash -769714150, now seen corresponding path program 1 times [2022-01-11 03:35:28,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:28,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022388545] [2022-01-11 03:35:28,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:28,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:28,466 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-01-11 03:35:28,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:28,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022388545] [2022-01-11 03:35:28,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022388545] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:28,467 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:28,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:35:28,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578919663] [2022-01-11 03:35:28,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:28,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:35:28,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:28,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:35:28,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:28,469 INFO L87 Difference]: Start difference. First operand 2362 states and 2649 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states 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:28,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:28,911 INFO L93 Difference]: Finished difference Result 5377 states and 6009 transitions. [2022-01-11 03:35:28,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:35:28,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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 234 [2022-01-11 03:35:28,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:28,917 INFO L225 Difference]: With dead ends: 5377 [2022-01-11 03:35:28,917 INFO L226 Difference]: Without dead ends: 1838 [2022-01-11 03:35:28,920 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:35:28,920 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 98 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:28,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 31 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:35:28,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2022-01-11 03:35:28,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1445. [2022-01-11 03:35:28,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.0678670360110802) internal successors, (1542), 1444 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states 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:28,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1542 transitions. [2022-01-11 03:35:28,946 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1542 transitions. Word has length 234 [2022-01-11 03:35:28,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:28,946 INFO L470 AbstractCegarLoop]: Abstraction has 1445 states and 1542 transitions. [2022-01-11 03:35:28,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states 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:28,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1542 transitions. [2022-01-11 03:35:28,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2022-01-11 03:35:28,950 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:28,950 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 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] [2022-01-11 03:35:28,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 03:35:28,950 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:28,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:28,951 INFO L85 PathProgramCache]: Analyzing trace with hash 623959985, now seen corresponding path program 1 times [2022-01-11 03:35:28,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:28,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220859815] [2022-01-11 03:35:28,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:28,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:29,123 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-01-11 03:35:29,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:29,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220859815] [2022-01-11 03:35:29,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220859815] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:29,124 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:29,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:35:29,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775872936] [2022-01-11 03:35:29,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:29,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:35:29,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:29,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:35:29,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:29,125 INFO L87 Difference]: Start difference. First operand 1445 states and 1542 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states 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:29,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:29,511 INFO L93 Difference]: Finished difference Result 2888 states and 3079 transitions. [2022-01-11 03:35:29,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:35:29,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 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 256 [2022-01-11 03:35:29,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:29,517 INFO L225 Difference]: With dead ends: 2888 [2022-01-11 03:35:29,517 INFO L226 Difference]: Without dead ends: 1445 [2022-01-11 03:35:29,519 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:35:29,520 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 120 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:29,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 29 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:35:29,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2022-01-11 03:35:29,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1314. [2022-01-11 03:35:29,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 1313 states have (on average 1.0578827113480578) internal successors, (1389), 1313 states have internal predecessors, (1389), 0 states have call successors, (0), 0 states 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:29,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1389 transitions. [2022-01-11 03:35:29,550 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1389 transitions. Word has length 256 [2022-01-11 03:35:29,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:29,551 INFO L470 AbstractCegarLoop]: Abstraction has 1314 states and 1389 transitions. [2022-01-11 03:35:29,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states 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:29,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1389 transitions. [2022-01-11 03:35:29,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2022-01-11 03:35:29,555 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:35:29,555 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 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] [2022-01-11 03:35:29,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 03:35:29,556 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:35:29,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:35:29,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1802496808, now seen corresponding path program 1 times [2022-01-11 03:35:29,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:35:29,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559296851] [2022-01-11 03:35:29,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:35:29,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:35:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:35:29,796 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2022-01-11 03:35:29,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:35:29,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559296851] [2022-01-11 03:35:29,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559296851] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:35:29,796 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:35:29,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:35:29,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479303305] [2022-01-11 03:35:29,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:35:29,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:35:29,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:35:29,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:35:29,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:35:29,798 INFO L87 Difference]: Start difference. First operand 1314 states and 1389 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 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:35:30,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:35:30,152 INFO L93 Difference]: Finished difference Result 2886 states and 3039 transitions. [2022-01-11 03:35:30,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:35:30,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 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 287 [2022-01-11 03:35:30,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:35:30,154 INFO L225 Difference]: With dead ends: 2886 [2022-01-11 03:35:30,154 INFO L226 Difference]: Without dead ends: 0 [2022-01-11 03:35:30,156 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:35:30,156 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 24 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 03:35:30,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 150 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-11 03:35:30,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-11 03:35:30,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-11 03:35:30,157 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:35:30,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-11 03:35:30,157 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 287 [2022-01-11 03:35:30,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:35:30,158 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-11 03:35:30,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 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:35:30,158 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-11 03:35:30,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-11 03:35:30,160 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-11 03:35:30,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 03:35:30,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-11 03:35:31,438 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-11 03:35:31,438 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-11 03:35:31,439 INFO L854 garLoopResultBuilder]: At program point L593-2(lines 593 603) the Hoare annotation is: (let ((.cse5 (<= 5 ~a16~0Int)) (.cse0 (= ~a21~0Int 1)) (.cse4 (<= ~a17~0Int 0)) (.cse1 (not (= ~a7~0Int 1))) (.cse7 (<= 15 ~a8~0Int)) (.cse9 (<= ~a16~0Int 4)) (.cse10 (<= ~a20~0Int 0)) (.cse8 (<= ~a16~0Int 5)) (.cse2 (= ~a17~0Int 1)) (.cse6 (<= ~a8~0Int 13)) (.cse3 (= ~a20~0Int 1))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~a12~0Int 8)) (and .cse4 .cse0 .cse5 .cse3) (and .cse4 .cse5 .cse6 .cse3) (and .cse0 .cse1 .cse5 .cse7 .cse3) (and .cse4 .cse5 .cse7 .cse3) (and .cse0 .cse1 .cse7 .cse2) (and .cse8 .cse4 .cse6) (and .cse4 .cse0 .cse1 .cse3) (and .cse9 .cse0 .cse7 .cse10 .cse2) (and (not .cse3) .cse8 .cse4) (and .cse4 .cse1 .cse7) (and .cse9 .cse10 .cse6) (and .cse8 .cse2 .cse6 .cse3))) [2022-01-11 03:35:31,439 INFO L861 garLoopResultBuilder]: At program point L587(lines 587 604) the Hoare annotation is: true [2022-01-11 03:35:31,439 INFO L858 garLoopResultBuilder]: For program point L598(line 598) no Hoare annotation was computed. [2022-01-11 03:35:31,439 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-11 03:35:31,439 INFO L858 garLoopResultBuilder]: For program point L41(lines 41 400) no Hoare annotation was computed. [2022-01-11 03:35:31,439 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-11 03:35:31,439 INFO L854 garLoopResultBuilder]: At program point L584(lines 40 585) the Hoare annotation is: (let ((.cse5 (<= 5 ~a16~0Int)) (.cse0 (= ~a21~0Int 1)) (.cse4 (<= ~a17~0Int 0)) (.cse1 (not (= ~a7~0Int 1))) (.cse7 (<= 15 ~a8~0Int)) (.cse9 (<= ~a16~0Int 4)) (.cse10 (<= ~a20~0Int 0)) (.cse8 (<= ~a16~0Int 5)) (.cse2 (= ~a17~0Int 1)) (.cse6 (<= ~a8~0Int 13)) (.cse3 (= ~a20~0Int 1))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~a12~0Int 8)) (and .cse4 .cse0 .cse5 .cse3) (and .cse4 .cse5 .cse6 .cse3) (and .cse0 .cse1 .cse5 .cse7 .cse3) (and .cse4 .cse5 .cse7 .cse3) (and .cse0 .cse1 .cse7 .cse2) (and .cse8 .cse4 .cse6) (and .cse4 .cse0 .cse1 .cse3) (and .cse9 .cse0 .cse7 .cse10 .cse2) (and (not .cse3) .cse8 .cse4) (and .cse4 .cse1 .cse7) (and .cse9 .cse10 .cse6) (and .cse8 .cse2 .cse6 .cse3))) [2022-01-11 03:35:31,439 INFO L858 garLoopResultBuilder]: For program point L45(lines 45 400) no Hoare annotation was computed. [2022-01-11 03:35:31,439 INFO L858 garLoopResultBuilder]: For program point L53(lines 53 400) no Hoare annotation was computed. [2022-01-11 03:35:31,440 INFO L858 garLoopResultBuilder]: For program point L59(lines 59 400) no Hoare annotation was computed. [2022-01-11 03:35:31,440 INFO L858 garLoopResultBuilder]: For program point L64(lines 64 400) no Hoare annotation was computed. [2022-01-11 03:35:31,440 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 400) no Hoare annotation was computed. [2022-01-11 03:35:31,440 INFO L858 garLoopResultBuilder]: For program point L75(lines 75 400) no Hoare annotation was computed. [2022-01-11 03:35:31,440 INFO L858 garLoopResultBuilder]: For program point L82(lines 82 400) no Hoare annotation was computed. [2022-01-11 03:35:31,440 INFO L858 garLoopResultBuilder]: For program point L90(lines 90 400) no Hoare annotation was computed. [2022-01-11 03:35:31,440 INFO L858 garLoopResultBuilder]: For program point L94(lines 94 400) no Hoare annotation was computed. [2022-01-11 03:35:31,440 INFO L858 garLoopResultBuilder]: For program point L102(lines 102 400) no Hoare annotation was computed. [2022-01-11 03:35:31,440 INFO L858 garLoopResultBuilder]: For program point L107(lines 107 400) no Hoare annotation was computed. [2022-01-11 03:35:31,440 INFO L858 garLoopResultBuilder]: For program point L112(lines 112 400) no Hoare annotation was computed. [2022-01-11 03:35:31,440 INFO L858 garLoopResultBuilder]: For program point L118(lines 118 400) no Hoare annotation was computed. [2022-01-11 03:35:31,440 INFO L858 garLoopResultBuilder]: For program point L124(lines 124 400) no Hoare annotation was computed. [2022-01-11 03:35:31,441 INFO L858 garLoopResultBuilder]: For program point L129(lines 129 400) no Hoare annotation was computed. [2022-01-11 03:35:31,441 INFO L858 garLoopResultBuilder]: For program point L134(lines 134 400) no Hoare annotation was computed. [2022-01-11 03:35:31,441 INFO L858 garLoopResultBuilder]: For program point L139(lines 139 400) no Hoare annotation was computed. [2022-01-11 03:35:31,441 INFO L858 garLoopResultBuilder]: For program point L146(lines 146 400) no Hoare annotation was computed. [2022-01-11 03:35:31,441 INFO L858 garLoopResultBuilder]: For program point L150(lines 150 400) no Hoare annotation was computed. [2022-01-11 03:35:31,441 INFO L858 garLoopResultBuilder]: For program point L154(lines 154 400) no Hoare annotation was computed. [2022-01-11 03:35:31,441 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 400) no Hoare annotation was computed. [2022-01-11 03:35:31,441 INFO L858 garLoopResultBuilder]: For program point L162(lines 162 400) no Hoare annotation was computed. [2022-01-11 03:35:31,441 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 400) no Hoare annotation was computed. [2022-01-11 03:35:31,441 INFO L858 garLoopResultBuilder]: For program point L175(lines 175 400) no Hoare annotation was computed. [2022-01-11 03:35:31,442 INFO L858 garLoopResultBuilder]: For program point L183(lines 183 400) no Hoare annotation was computed. [2022-01-11 03:35:31,442 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 400) no Hoare annotation was computed. [2022-01-11 03:35:31,442 INFO L858 garLoopResultBuilder]: For program point L196(lines 196 400) no Hoare annotation was computed. [2022-01-11 03:35:31,442 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 400) no Hoare annotation was computed. [2022-01-11 03:35:31,442 INFO L858 garLoopResultBuilder]: For program point L204(lines 204 400) no Hoare annotation was computed. [2022-01-11 03:35:31,442 INFO L858 garLoopResultBuilder]: For program point L207(lines 207 400) no Hoare annotation was computed. [2022-01-11 03:35:31,442 INFO L858 garLoopResultBuilder]: For program point L213(lines 213 400) no Hoare annotation was computed. [2022-01-11 03:35:31,442 INFO L858 garLoopResultBuilder]: For program point L218(lines 218 400) no Hoare annotation was computed. [2022-01-11 03:35:31,442 INFO L858 garLoopResultBuilder]: For program point L224(lines 224 400) no Hoare annotation was computed. [2022-01-11 03:35:31,442 INFO L858 garLoopResultBuilder]: For program point L228(lines 228 400) no Hoare annotation was computed. [2022-01-11 03:35:31,442 INFO L858 garLoopResultBuilder]: For program point L233(lines 233 400) no Hoare annotation was computed. [2022-01-11 03:35:31,442 INFO L858 garLoopResultBuilder]: For program point L241(lines 241 400) no Hoare annotation was computed. [2022-01-11 03:35:31,443 INFO L858 garLoopResultBuilder]: For program point L248(lines 248 400) no Hoare annotation was computed. [2022-01-11 03:35:31,443 INFO L858 garLoopResultBuilder]: For program point L255(lines 255 400) no Hoare annotation was computed. [2022-01-11 03:35:31,443 INFO L858 garLoopResultBuilder]: For program point L260(lines 260 400) no Hoare annotation was computed. [2022-01-11 03:35:31,443 INFO L858 garLoopResultBuilder]: For program point L266(lines 266 400) no Hoare annotation was computed. [2022-01-11 03:35:31,443 INFO L858 garLoopResultBuilder]: For program point L271(lines 271 400) no Hoare annotation was computed. [2022-01-11 03:35:31,443 INFO L858 garLoopResultBuilder]: For program point L275(lines 275 400) no Hoare annotation was computed. [2022-01-11 03:35:31,443 INFO L858 garLoopResultBuilder]: For program point L278(lines 278 400) no Hoare annotation was computed. [2022-01-11 03:35:31,443 INFO L858 garLoopResultBuilder]: For program point L283(lines 283 400) no Hoare annotation was computed. [2022-01-11 03:35:31,443 INFO L858 garLoopResultBuilder]: For program point L288(lines 288 400) no Hoare annotation was computed. [2022-01-11 03:35:31,443 INFO L858 garLoopResultBuilder]: For program point L296(lines 296 400) no Hoare annotation was computed. [2022-01-11 03:35:31,443 INFO L858 garLoopResultBuilder]: For program point L302(lines 302 400) no Hoare annotation was computed. [2022-01-11 03:35:31,444 INFO L858 garLoopResultBuilder]: For program point L309(lines 309 400) no Hoare annotation was computed. [2022-01-11 03:35:31,444 INFO L858 garLoopResultBuilder]: For program point L316(lines 316 400) no Hoare annotation was computed. [2022-01-11 03:35:31,444 INFO L858 garLoopResultBuilder]: For program point L322(lines 322 400) no Hoare annotation was computed. [2022-01-11 03:35:31,444 INFO L858 garLoopResultBuilder]: For program point L326(lines 326 400) no Hoare annotation was computed. [2022-01-11 03:35:31,444 INFO L858 garLoopResultBuilder]: For program point L328(lines 328 400) no Hoare annotation was computed. [2022-01-11 03:35:31,444 INFO L858 garLoopResultBuilder]: For program point L334(lines 334 400) no Hoare annotation was computed. [2022-01-11 03:35:31,444 INFO L858 garLoopResultBuilder]: For program point L339(lines 339 400) no Hoare annotation was computed. [2022-01-11 03:35:31,444 INFO L858 garLoopResultBuilder]: For program point L343(lines 343 400) no Hoare annotation was computed. [2022-01-11 03:35:31,444 INFO L858 garLoopResultBuilder]: For program point L347(lines 347 400) no Hoare annotation was computed. [2022-01-11 03:35:31,444 INFO L858 garLoopResultBuilder]: For program point L355(lines 355 400) no Hoare annotation was computed. [2022-01-11 03:35:31,444 INFO L858 garLoopResultBuilder]: For program point L363(lines 363 400) no Hoare annotation was computed. [2022-01-11 03:35:31,444 INFO L858 garLoopResultBuilder]: For program point L365(lines 365 400) no Hoare annotation was computed. [2022-01-11 03:35:31,444 INFO L858 garLoopResultBuilder]: For program point L371(lines 371 400) no Hoare annotation was computed. [2022-01-11 03:35:31,445 INFO L858 garLoopResultBuilder]: For program point L373(lines 373 400) no Hoare annotation was computed. [2022-01-11 03:35:31,445 INFO L858 garLoopResultBuilder]: For program point L375(lines 375 400) no Hoare annotation was computed. [2022-01-11 03:35:31,445 INFO L858 garLoopResultBuilder]: For program point L382(lines 382 400) no Hoare annotation was computed. [2022-01-11 03:35:31,445 INFO L858 garLoopResultBuilder]: For program point L387(lines 387 400) no Hoare annotation was computed. [2022-01-11 03:35:31,445 INFO L858 garLoopResultBuilder]: For program point L392(lines 392 400) no Hoare annotation was computed. [2022-01-11 03:35:31,445 INFO L858 garLoopResultBuilder]: For program point L401(lines 401 403) no Hoare annotation was computed. [2022-01-11 03:35:31,445 INFO L858 garLoopResultBuilder]: For program point L402(line 402) no Hoare annotation was computed. [2022-01-11 03:35:31,445 INFO L858 garLoopResultBuilder]: For program point L401-2(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,445 INFO L858 garLoopResultBuilder]: For program point L405(line 405) no Hoare annotation was computed. [2022-01-11 03:35:31,445 INFO L858 garLoopResultBuilder]: For program point L404-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,445 INFO L858 garLoopResultBuilder]: For program point L408(line 408) no Hoare annotation was computed. [2022-01-11 03:35:31,445 INFO L858 garLoopResultBuilder]: For program point L407-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,446 INFO L858 garLoopResultBuilder]: For program point L411(line 411) no Hoare annotation was computed. [2022-01-11 03:35:31,446 INFO L858 garLoopResultBuilder]: For program point L410-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,446 INFO L858 garLoopResultBuilder]: For program point L414(line 414) no Hoare annotation was computed. [2022-01-11 03:35:31,446 INFO L858 garLoopResultBuilder]: For program point L413-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,446 INFO L858 garLoopResultBuilder]: For program point L417(line 417) no Hoare annotation was computed. [2022-01-11 03:35:31,446 INFO L858 garLoopResultBuilder]: For program point L416-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,446 INFO L858 garLoopResultBuilder]: For program point L420(line 420) no Hoare annotation was computed. [2022-01-11 03:35:31,446 INFO L858 garLoopResultBuilder]: For program point L419-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,446 INFO L858 garLoopResultBuilder]: For program point L423(line 423) no Hoare annotation was computed. [2022-01-11 03:35:31,446 INFO L858 garLoopResultBuilder]: For program point L422-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,446 INFO L858 garLoopResultBuilder]: For program point L426(line 426) no Hoare annotation was computed. [2022-01-11 03:35:31,446 INFO L858 garLoopResultBuilder]: For program point L425-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,446 INFO L858 garLoopResultBuilder]: For program point L429(line 429) no Hoare annotation was computed. [2022-01-11 03:35:31,447 INFO L858 garLoopResultBuilder]: For program point L428-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,447 INFO L858 garLoopResultBuilder]: For program point L432(line 432) no Hoare annotation was computed. [2022-01-11 03:35:31,447 INFO L858 garLoopResultBuilder]: For program point L431-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,447 INFO L858 garLoopResultBuilder]: For program point L435(line 435) no Hoare annotation was computed. [2022-01-11 03:35:31,447 INFO L858 garLoopResultBuilder]: For program point L434-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,447 INFO L858 garLoopResultBuilder]: For program point L438(line 438) no Hoare annotation was computed. [2022-01-11 03:35:31,447 INFO L858 garLoopResultBuilder]: For program point L437-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,447 INFO L858 garLoopResultBuilder]: For program point L441(line 441) no Hoare annotation was computed. [2022-01-11 03:35:31,447 INFO L858 garLoopResultBuilder]: For program point L440-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,447 INFO L858 garLoopResultBuilder]: For program point L444(line 444) no Hoare annotation was computed. [2022-01-11 03:35:31,447 INFO L858 garLoopResultBuilder]: For program point L443-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,448 INFO L858 garLoopResultBuilder]: For program point L447(line 447) no Hoare annotation was computed. [2022-01-11 03:35:31,448 INFO L858 garLoopResultBuilder]: For program point L446-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,448 INFO L858 garLoopResultBuilder]: For program point L450(line 450) no Hoare annotation was computed. [2022-01-11 03:35:31,448 INFO L858 garLoopResultBuilder]: For program point L449-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,448 INFO L858 garLoopResultBuilder]: For program point L453(line 453) no Hoare annotation was computed. [2022-01-11 03:35:31,448 INFO L858 garLoopResultBuilder]: For program point L452-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,448 INFO L858 garLoopResultBuilder]: For program point L456(line 456) no Hoare annotation was computed. [2022-01-11 03:35:31,448 INFO L858 garLoopResultBuilder]: For program point L455-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,448 INFO L858 garLoopResultBuilder]: For program point L459(line 459) no Hoare annotation was computed. [2022-01-11 03:35:31,448 INFO L858 garLoopResultBuilder]: For program point L458-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,448 INFO L858 garLoopResultBuilder]: For program point L462(line 462) no Hoare annotation was computed. [2022-01-11 03:35:31,448 INFO L858 garLoopResultBuilder]: For program point L461-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,449 INFO L858 garLoopResultBuilder]: For program point L465(line 465) no Hoare annotation was computed. [2022-01-11 03:35:31,449 INFO L858 garLoopResultBuilder]: For program point L464-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,449 INFO L858 garLoopResultBuilder]: For program point L468(line 468) no Hoare annotation was computed. [2022-01-11 03:35:31,449 INFO L858 garLoopResultBuilder]: For program point L467-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,449 INFO L858 garLoopResultBuilder]: For program point L471(line 471) no Hoare annotation was computed. [2022-01-11 03:35:31,449 INFO L858 garLoopResultBuilder]: For program point L470-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,449 INFO L858 garLoopResultBuilder]: For program point L474(line 474) no Hoare annotation was computed. [2022-01-11 03:35:31,449 INFO L858 garLoopResultBuilder]: For program point L473-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,449 INFO L858 garLoopResultBuilder]: For program point L477(line 477) no Hoare annotation was computed. [2022-01-11 03:35:31,449 INFO L858 garLoopResultBuilder]: For program point L476-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,449 INFO L858 garLoopResultBuilder]: For program point L480(line 480) no Hoare annotation was computed. [2022-01-11 03:35:31,449 INFO L858 garLoopResultBuilder]: For program point L479-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,449 INFO L858 garLoopResultBuilder]: For program point L483(line 483) no Hoare annotation was computed. [2022-01-11 03:35:31,450 INFO L858 garLoopResultBuilder]: For program point L482-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,450 INFO L858 garLoopResultBuilder]: For program point L486(line 486) no Hoare annotation was computed. [2022-01-11 03:35:31,450 INFO L858 garLoopResultBuilder]: For program point L485-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,450 INFO L858 garLoopResultBuilder]: For program point L489(line 489) no Hoare annotation was computed. [2022-01-11 03:35:31,450 INFO L858 garLoopResultBuilder]: For program point L488-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,450 INFO L858 garLoopResultBuilder]: For program point L492(line 492) no Hoare annotation was computed. [2022-01-11 03:35:31,450 INFO L858 garLoopResultBuilder]: For program point L491-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,450 INFO L858 garLoopResultBuilder]: For program point L495(line 495) no Hoare annotation was computed. [2022-01-11 03:35:31,450 INFO L858 garLoopResultBuilder]: For program point L494-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,450 INFO L858 garLoopResultBuilder]: For program point L498(line 498) no Hoare annotation was computed. [2022-01-11 03:35:31,450 INFO L858 garLoopResultBuilder]: For program point L497-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,450 INFO L858 garLoopResultBuilder]: For program point L501(line 501) no Hoare annotation was computed. [2022-01-11 03:35:31,450 INFO L858 garLoopResultBuilder]: For program point L500-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,450 INFO L858 garLoopResultBuilder]: For program point L504(line 504) no Hoare annotation was computed. [2022-01-11 03:35:31,451 INFO L858 garLoopResultBuilder]: For program point L503-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,451 INFO L858 garLoopResultBuilder]: For program point L507(line 507) no Hoare annotation was computed. [2022-01-11 03:35:31,451 INFO L858 garLoopResultBuilder]: For program point L506-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,451 INFO L858 garLoopResultBuilder]: For program point L510(line 510) no Hoare annotation was computed. [2022-01-11 03:35:31,451 INFO L858 garLoopResultBuilder]: For program point L509-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,451 INFO L858 garLoopResultBuilder]: For program point L513(line 513) no Hoare annotation was computed. [2022-01-11 03:35:31,451 INFO L858 garLoopResultBuilder]: For program point L512-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,451 INFO L858 garLoopResultBuilder]: For program point L516(line 516) no Hoare annotation was computed. [2022-01-11 03:35:31,451 INFO L858 garLoopResultBuilder]: For program point L515-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,451 INFO L858 garLoopResultBuilder]: For program point L519(line 519) no Hoare annotation was computed. [2022-01-11 03:35:31,451 INFO L858 garLoopResultBuilder]: For program point L518-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,451 INFO L858 garLoopResultBuilder]: For program point L522(line 522) no Hoare annotation was computed. [2022-01-11 03:35:31,451 INFO L858 garLoopResultBuilder]: For program point L521-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,451 INFO L858 garLoopResultBuilder]: For program point L525(line 525) no Hoare annotation was computed. [2022-01-11 03:35:31,452 INFO L858 garLoopResultBuilder]: For program point L524-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,452 INFO L858 garLoopResultBuilder]: For program point L528(line 528) no Hoare annotation was computed. [2022-01-11 03:35:31,452 INFO L858 garLoopResultBuilder]: For program point L527-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,452 INFO L858 garLoopResultBuilder]: For program point L531(line 531) no Hoare annotation was computed. [2022-01-11 03:35:31,452 INFO L858 garLoopResultBuilder]: For program point L530-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,452 INFO L858 garLoopResultBuilder]: For program point L534(line 534) no Hoare annotation was computed. [2022-01-11 03:35:31,452 INFO L858 garLoopResultBuilder]: For program point L533-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,452 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 534) no Hoare annotation was computed. [2022-01-11 03:35:31,452 INFO L858 garLoopResultBuilder]: For program point L537(line 537) no Hoare annotation was computed. [2022-01-11 03:35:31,452 INFO L858 garLoopResultBuilder]: For program point L536-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,452 INFO L858 garLoopResultBuilder]: For program point L540(line 540) no Hoare annotation was computed. [2022-01-11 03:35:31,452 INFO L858 garLoopResultBuilder]: For program point L539-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,452 INFO L858 garLoopResultBuilder]: For program point L543(line 543) no Hoare annotation was computed. [2022-01-11 03:35:31,453 INFO L858 garLoopResultBuilder]: For program point L542-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,453 INFO L858 garLoopResultBuilder]: For program point L546(line 546) no Hoare annotation was computed. [2022-01-11 03:35:31,453 INFO L858 garLoopResultBuilder]: For program point L545-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,453 INFO L858 garLoopResultBuilder]: For program point L549(line 549) no Hoare annotation was computed. [2022-01-11 03:35:31,453 INFO L858 garLoopResultBuilder]: For program point L548-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,453 INFO L858 garLoopResultBuilder]: For program point L552(line 552) no Hoare annotation was computed. [2022-01-11 03:35:31,453 INFO L858 garLoopResultBuilder]: For program point L551-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,453 INFO L858 garLoopResultBuilder]: For program point L555(line 555) no Hoare annotation was computed. [2022-01-11 03:35:31,453 INFO L858 garLoopResultBuilder]: For program point L554-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,453 INFO L858 garLoopResultBuilder]: For program point L558(line 558) no Hoare annotation was computed. [2022-01-11 03:35:31,453 INFO L858 garLoopResultBuilder]: For program point L557-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,453 INFO L858 garLoopResultBuilder]: For program point L561(line 561) no Hoare annotation was computed. [2022-01-11 03:35:31,453 INFO L858 garLoopResultBuilder]: For program point L560-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,454 INFO L858 garLoopResultBuilder]: For program point L564(line 564) no Hoare annotation was computed. [2022-01-11 03:35:31,454 INFO L858 garLoopResultBuilder]: For program point L563-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,454 INFO L858 garLoopResultBuilder]: For program point L567(line 567) no Hoare annotation was computed. [2022-01-11 03:35:31,454 INFO L858 garLoopResultBuilder]: For program point L566-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,454 INFO L858 garLoopResultBuilder]: For program point L570(line 570) no Hoare annotation was computed. [2022-01-11 03:35:31,454 INFO L858 garLoopResultBuilder]: For program point L569-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,454 INFO L858 garLoopResultBuilder]: For program point L573(line 573) no Hoare annotation was computed. [2022-01-11 03:35:31,454 INFO L858 garLoopResultBuilder]: For program point L572-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,454 INFO L858 garLoopResultBuilder]: For program point L576(line 576) no Hoare annotation was computed. [2022-01-11 03:35:31,454 INFO L858 garLoopResultBuilder]: For program point L575-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,454 INFO L858 garLoopResultBuilder]: For program point L579(line 579) no Hoare annotation was computed. [2022-01-11 03:35:31,454 INFO L858 garLoopResultBuilder]: For program point L578-1(lines 40 585) no Hoare annotation was computed. [2022-01-11 03:35:31,454 INFO L858 garLoopResultBuilder]: For program point L582(line 582) no Hoare annotation was computed. [2022-01-11 03:35:31,455 INFO L858 garLoopResultBuilder]: For program point L581-1(lines 581 583) no Hoare annotation was computed. [2022-01-11 03:35:31,457 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:35:31,458 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 03:35:31,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 03:35:31 BasicIcfg [2022-01-11 03:35:31,486 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 03:35:31,486 INFO L158 Benchmark]: Toolchain (without parser) took 14033.45ms. Allocated memory was 188.7MB in the beginning and 358.6MB in the end (delta: 169.9MB). Free memory was 129.3MB in the beginning and 111.9MB in the end (delta: 17.4MB). Peak memory consumption was 191.7MB. Max. memory is 8.0GB. [2022-01-11 03:35:31,486 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 188.7MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 03:35:31,487 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.74ms. Allocated memory was 188.7MB in the beginning and 283.1MB in the end (delta: 94.4MB). Free memory was 129.2MB in the beginning and 236.9MB in the end (delta: -107.7MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. [2022-01-11 03:35:31,487 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.94ms. Allocated memory is still 283.1MB. Free memory was 236.9MB in the beginning and 231.1MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-01-11 03:35:31,487 INFO L158 Benchmark]: Boogie Preprocessor took 49.15ms. Allocated memory is still 283.1MB. Free memory was 231.1MB in the beginning and 226.4MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-11 03:35:31,487 INFO L158 Benchmark]: RCFGBuilder took 1123.41ms. Allocated memory is still 283.1MB. Free memory was 226.4MB in the beginning and 166.1MB in the end (delta: 60.3MB). Peak memory consumption was 60.8MB. Max. memory is 8.0GB. [2022-01-11 03:35:31,488 INFO L158 Benchmark]: IcfgTransformer took 237.03ms. Allocated memory is still 283.1MB. Free memory was 166.1MB in the beginning and 131.0MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-01-11 03:35:31,488 INFO L158 Benchmark]: TraceAbstraction took 12036.19ms. Allocated memory was 283.1MB in the beginning and 358.6MB in the end (delta: 75.5MB). Free memory was 130.4MB in the beginning and 111.9MB in the end (delta: 18.5MB). Peak memory consumption was 98.7MB. Max. memory is 8.0GB. [2022-01-11 03:35:31,489 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.11ms. Allocated memory is still 188.7MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 496.74ms. Allocated memory was 188.7MB in the beginning and 283.1MB in the end (delta: 94.4MB). Free memory was 129.2MB in the beginning and 236.9MB in the end (delta: -107.7MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 84.94ms. Allocated memory is still 283.1MB. Free memory was 236.9MB in the beginning and 231.1MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.15ms. Allocated memory is still 283.1MB. Free memory was 231.1MB in the beginning and 226.4MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1123.41ms. Allocated memory is still 283.1MB. Free memory was 226.4MB in the beginning and 166.1MB in the end (delta: 60.3MB). Peak memory consumption was 60.8MB. Max. memory is 8.0GB. * IcfgTransformer took 237.03ms. Allocated memory is still 283.1MB. Free memory was 166.1MB in the beginning and 131.0MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 12036.19ms. Allocated memory was 283.1MB in the beginning and 358.6MB in the end (delta: 75.5MB). Free memory was 130.4MB in the beginning and 111.9MB in the end (delta: 18.5MB). Peak memory consumption was 98.7MB. 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: 534]: 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.0s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1375 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1375 mSDsluCounter, 1111 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 81 mSDsCounter, 671 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4656 IncrementalHoareTripleChecker+Invalid, 5327 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 671 mSolverCounterUnsat, 1030 mSDtfsCounter, 4656 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2362occurred in iteration=10, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 2622 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 49 NumberOfFragments, 347 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2188 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 6422 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2487 NumberOfCodeBlocks, 2487 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2473 ConstructedInterpolants, 0 QuantifiedInterpolants, 9640 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3009 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 1430/1446 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 && !(a7 == 1bv32)) && ~bvule32(5bv32, a16)) && ~bvule32(15bv32, a8)) && 1bv32 == a21) || ((((1bv32 == a20 && 8bv32 == a12) && !(a7 == 1bv32)) && 1bv32 == a17) && 1bv32 == a21)) || (((!(a7 == 1bv32) && 1bv32 == a17) && ~bvule32(15bv32, a8)) && 1bv32 == a21)) || (((1bv32 == a20 && !(a7 == 1bv32)) && ~bvule32(a17, 0bv32)) && 1bv32 == a21)) || (((1bv32 == a20 && ~bvule32(a8, 13bv32)) && ~bvule32(a17, 0bv32)) && ~bvule32(5bv32, a16))) || ((~bvule32(a8, 13bv32) && ~bvule32(a16, 5bv32)) && ~bvule32(a17, 0bv32))) || ((!(a7 == 1bv32) && ~bvule32(a17, 0bv32)) && ~bvule32(15bv32, a8))) || (((1bv32 == a20 && ~bvule32(a17, 0bv32)) && ~bvule32(5bv32, a16)) && ~bvule32(15bv32, a8))) || ((((~bvule32(a16, 4bv32) && 1bv32 == a17) && ~bvule32(a20, 0bv32)) && ~bvule32(15bv32, a8)) && 1bv32 == a21)) || (((1bv32 == a20 && ~bvule32(a8, 13bv32)) && ~bvule32(a16, 5bv32)) && 1bv32 == a17)) || ((!(1bv32 == a20) && ~bvule32(a16, 5bv32)) && ~bvule32(a17, 0bv32))) || (((1bv32 == a20 && ~bvule32(a17, 0bv32)) && ~bvule32(5bv32, a16)) && 1bv32 == a21)) || ((~bvule32(a8, 13bv32) && ~bvule32(a16, 4bv32)) && ~bvule32(a20, 0bv32)) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: (((((((((((((((1bv32 == a20 && !(a7 == 1bv32)) && ~bvule32(5bv32, a16)) && ~bvule32(15bv32, a8)) && 1bv32 == a21) || ((((1bv32 == a20 && 8bv32 == a12) && !(a7 == 1bv32)) && 1bv32 == a17) && 1bv32 == a21)) || (((!(a7 == 1bv32) && 1bv32 == a17) && ~bvule32(15bv32, a8)) && 1bv32 == a21)) || (((1bv32 == a20 && !(a7 == 1bv32)) && ~bvule32(a17, 0bv32)) && 1bv32 == a21)) || (((1bv32 == a20 && ~bvule32(a8, 13bv32)) && ~bvule32(a17, 0bv32)) && ~bvule32(5bv32, a16))) || ((~bvule32(a8, 13bv32) && ~bvule32(a16, 5bv32)) && ~bvule32(a17, 0bv32))) || ((!(a7 == 1bv32) && ~bvule32(a17, 0bv32)) && ~bvule32(15bv32, a8))) || (((1bv32 == a20 && ~bvule32(a17, 0bv32)) && ~bvule32(5bv32, a16)) && ~bvule32(15bv32, a8))) || ((((~bvule32(a16, 4bv32) && 1bv32 == a17) && ~bvule32(a20, 0bv32)) && ~bvule32(15bv32, a8)) && 1bv32 == a21)) || (((1bv32 == a20 && ~bvule32(a8, 13bv32)) && ~bvule32(a16, 5bv32)) && 1bv32 == a17)) || ((!(1bv32 == a20) && ~bvule32(a16, 5bv32)) && ~bvule32(a17, 0bv32))) || (((1bv32 == a20 && ~bvule32(a17, 0bv32)) && ~bvule32(5bv32, a16)) && 1bv32 == a21)) || ((~bvule32(a8, 13bv32) && ~bvule32(a16, 4bv32)) && ~bvule32(a20, 0bv32)) RESULT: Ultimate proved your program to be correct! [2022-01-11 03:35:31,547 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...