/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_NONE.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label45.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 21:47:55,287 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 21:47:55,289 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 21:47:55,337 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 21:47:55,348 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 21:47:55,350 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 21:47:55,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 21:47:55,352 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 21:47:55,353 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 21:47:55,354 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 21:47:55,354 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 21:47:55,355 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 21:47:55,361 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 21:47:55,365 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 21:47:55,366 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 21:47:55,370 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 21:47:55,371 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 21:47:55,372 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 21:47:55,374 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 21:47:55,376 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 21:47:55,377 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 21:47:55,378 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 21:47:55,378 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 21:47:55,379 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 21:47:55,381 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 21:47:55,381 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 21:47:55,381 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 21:47:55,382 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 21:47:55,382 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 21:47:55,383 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 21:47:55,383 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 21:47:55,384 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 21:47:55,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 21:47:55,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 21:47:55,386 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 21:47:55,386 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 21:47:55,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 21:47:55,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 21:47:55,387 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 21:47:55,387 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 21:47:55,388 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 21:47:55,389 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-10 21:47:55,405 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 21:47:55,405 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 21:47:55,406 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 21:47:55,406 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 21:47:55,407 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 21:47:55,407 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 21:47:55,407 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 21:47:55,408 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 21:47:55,408 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 21:47:55,408 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 21:47:55,408 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 21:47:55,408 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 21:47:55,408 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 21:47:55,409 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 21:47:55,409 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 21:47:55,409 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 21:47:55,409 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 21:47:55,409 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 21:47:55,410 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 21:47:55,410 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 21:47:55,410 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 21:47:55,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 21:47:55,410 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 21:47:55,410 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 21:47:55,411 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 21:47:55,412 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 21:47:55,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 21:47:55,413 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 21:47:55,414 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 21:47:55,414 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 21:47:55,414 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 21:47:55,414 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 21:47:55,415 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 21:47:55,415 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 21:47:55,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 21:47:55,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 21:47:55,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 21:47:55,700 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 21:47:55,700 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 21:47:55,701 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label45.c [2022-01-10 21:47:55,751 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/323097096/2f05fc3b9b9c44f0b1c8529c38b7bf65/FLAGa440f95fc [2022-01-10 21:47:56,247 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 21:47:56,248 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label45.c [2022-01-10 21:47:56,268 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/323097096/2f05fc3b9b9c44f0b1c8529c38b7bf65/FLAGa440f95fc [2022-01-10 21:47:56,572 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/323097096/2f05fc3b9b9c44f0b1c8529c38b7bf65 [2022-01-10 21:47:56,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 21:47:56,576 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 21:47:56,582 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 21:47:56,582 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 21:47:56,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 21:47:56,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:47:56" (1/1) ... [2022-01-10 21:47:56,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12491e0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:47:56, skipping insertion in model container [2022-01-10 21:47:56,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:47:56" (1/1) ... [2022-01-10 21:47:56,594 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 21:47:56,641 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 21:47:56,950 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label45.c[20099,20112] [2022-01-10 21:47:56,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 21:47:56,978 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 21:47:57,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label45.c[20099,20112] [2022-01-10 21:47:57,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 21:47:57,108 INFO L208 MainTranslator]: Completed translation [2022-01-10 21:47:57,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:47:57 WrapperNode [2022-01-10 21:47:57,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 21:47:57,110 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 21:47:57,110 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 21:47:57,110 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 21:47:57,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:47:57" (1/1) ... [2022-01-10 21:47:57,139 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:47:57" (1/1) ... [2022-01-10 21:47:57,188 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2022-01-10 21:47:57,188 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 21:47:57,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 21:47:57,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 21:47:57,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 21:47:57,196 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:47:57" (1/1) ... [2022-01-10 21:47:57,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:47:57" (1/1) ... [2022-01-10 21:47:57,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:47:57" (1/1) ... [2022-01-10 21:47:57,202 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:47:57" (1/1) ... [2022-01-10 21:47:57,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:47:57" (1/1) ... [2022-01-10 21:47:57,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:47:57" (1/1) ... [2022-01-10 21:47:57,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:47:57" (1/1) ... [2022-01-10 21:47:57,246 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 21:47:57,247 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 21:47:57,247 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 21:47:57,247 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 21:47:57,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:47:57" (1/1) ... [2022-01-10 21:47:57,279 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 21:47:57,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:47:57,305 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 21:47:57,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 21:47:57,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 21:47:57,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 21:47:57,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 21:47:57,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 21:47:57,412 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 21:47:57,414 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 21:47:58,379 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 21:47:58,390 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 21:47:58,390 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 21:47:58,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:47:58 BoogieIcfgContainer [2022-01-10 21:47:58,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 21:47:58,393 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 21:47:58,393 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 21:47:58,394 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 21:47:58,397 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:47:58" (1/1) ... [2022-01-10 21:47:58,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:47:58 BasicIcfg [2022-01-10 21:47:58,667 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 21:47:58,670 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 21:47:58,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 21:47:58,672 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 21:47:58,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 09:47:56" (1/4) ... [2022-01-10 21:47:58,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f255fab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:47:58, skipping insertion in model container [2022-01-10 21:47:58,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:47:57" (2/4) ... [2022-01-10 21:47:58,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f255fab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:47:58, skipping insertion in model container [2022-01-10 21:47:58,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:47:58" (3/4) ... [2022-01-10 21:47:58,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f255fab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 09:47:58, skipping insertion in model container [2022-01-10 21:47:58,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:47:58" (4/4) ... [2022-01-10 21:47:58,675 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem01_label45.cTransformedIcfg [2022-01-10 21:47:58,681 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 21:47:58,681 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 21:47:58,734 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 21:47:58,740 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 21:47:58,740 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 21:47:58,755 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-10 21:47:58,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-01-10 21:47:58,765 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:47:58,766 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:47:58,766 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:47:58,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:47:58,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1052656265, now seen corresponding path program 1 times [2022-01-10 21:47:58,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:47:58,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119870515] [2022-01-10 21:47:58,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:47:58,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:47:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:47:59,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:47:59,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:47:59,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119870515] [2022-01-10 21:47:59,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119870515] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:47:59,316 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:47:59,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 21:47:59,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869446001] [2022-01-10 21:47:59,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:47:59,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:47:59,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:47:59,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:47:59,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:47:59,355 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:00,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:48:00,118 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2022-01-10 21:48:00,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:48:00,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2022-01-10 21:48:00,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:48:00,129 INFO L225 Difference]: With dead ends: 528 [2022-01-10 21:48:00,129 INFO L226 Difference]: Without dead ends: 266 [2022-01-10 21:48:00,132 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-10 21:48:00,135 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 65 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 21:48:00,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 73 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 21:48:00,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-01-10 21:48:00,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2022-01-10 21:48:00,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.411320754716981) internal successors, (374), 265 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:00,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 374 transitions. [2022-01-10 21:48:00,178 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 374 transitions. Word has length 117 [2022-01-10 21:48:00,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:48:00,179 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 374 transitions. [2022-01-10 21:48:00,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:00,179 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 374 transitions. [2022-01-10 21:48:00,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 21:48:00,183 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:48:00,183 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:48:00,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 21:48:00,183 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:48:00,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:48:00,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1714540146, now seen corresponding path program 1 times [2022-01-10 21:48:00,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:48:00,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716204503] [2022-01-10 21:48:00,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:48:00,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:48:00,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:48:00,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 21:48:00,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:48:00,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716204503] [2022-01-10 21:48:00,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716204503] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:48:00,412 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:48:00,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 21:48:00,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143433844] [2022-01-10 21:48:00,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:48:00,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:48:00,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:48:00,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:48:00,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:48:00,415 INFO L87 Difference]: Start difference. First operand 266 states and 374 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:00,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:48:00,898 INFO L93 Difference]: Finished difference Result 792 states and 1117 transitions. [2022-01-10 21:48:00,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:48:00,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-01-10 21:48:00,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:48:00,909 INFO L225 Difference]: With dead ends: 792 [2022-01-10 21:48:00,909 INFO L226 Difference]: Without dead ends: 528 [2022-01-10 21:48:00,917 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-10 21:48:00,919 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 37 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 21:48:00,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 31 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 21:48:00,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-01-10 21:48:00,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2022-01-10 21:48:00,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.3434535104364327) internal successors, (708), 527 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:00,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 708 transitions. [2022-01-10 21:48:00,938 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 708 transitions. Word has length 121 [2022-01-10 21:48:00,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:48:00,939 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 708 transitions. [2022-01-10 21:48:00,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:00,939 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 708 transitions. [2022-01-10 21:48:00,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-01-10 21:48:00,942 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:48:00,943 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:48:00,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 21:48:00,943 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:48:00,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:48:00,944 INFO L85 PathProgramCache]: Analyzing trace with hash 815329483, now seen corresponding path program 1 times [2022-01-10 21:48:00,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:48:00,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378919129] [2022-01-10 21:48:00,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:48:00,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:48:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:48:01,067 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 21:48:01,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:48:01,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378919129] [2022-01-10 21:48:01,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378919129] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:48:01,068 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:48:01,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 21:48:01,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714800573] [2022-01-10 21:48:01,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:48:01,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:48:01,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:48:01,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:48:01,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:48:01,069 INFO L87 Difference]: Start difference. First operand 528 states and 708 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:01,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:48:01,579 INFO L93 Difference]: Finished difference Result 1316 states and 1785 transitions. [2022-01-10 21:48:01,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:48:01,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2022-01-10 21:48:01,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:48:01,583 INFO L225 Difference]: With dead ends: 1316 [2022-01-10 21:48:01,583 INFO L226 Difference]: Without dead ends: 790 [2022-01-10 21:48:01,584 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-10 21:48:01,584 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 147 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 21:48:01,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 30 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 21:48:01,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2022-01-10 21:48:01,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 659. [2022-01-10 21:48:01,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 1.3495440729483283) internal successors, (888), 658 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:01,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 888 transitions. [2022-01-10 21:48:01,614 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 888 transitions. Word has length 151 [2022-01-10 21:48:01,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:48:01,615 INFO L470 AbstractCegarLoop]: Abstraction has 659 states and 888 transitions. [2022-01-10 21:48:01,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:01,615 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 888 transitions. [2022-01-10 21:48:01,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-01-10 21:48:01,619 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:48:01,619 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:48:01,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 21:48:01,620 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:48:01,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:48:01,620 INFO L85 PathProgramCache]: Analyzing trace with hash -13873785, now seen corresponding path program 1 times [2022-01-10 21:48:01,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:48:01,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963161194] [2022-01-10 21:48:01,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:48:01,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:48:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:48:01,722 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-10 21:48:01,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:48:01,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963161194] [2022-01-10 21:48:01,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963161194] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:48:01,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:48:01,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 21:48:01,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93361584] [2022-01-10 21:48:01,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:48:01,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:48:01,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:48:01,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:48:01,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:48:01,726 INFO L87 Difference]: Start difference. First operand 659 states and 888 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:02,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:48:02,191 INFO L93 Difference]: Finished difference Result 1578 states and 2108 transitions. [2022-01-10 21:48:02,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:48:02,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2022-01-10 21:48:02,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:48:02,195 INFO L225 Difference]: With dead ends: 1578 [2022-01-10 21:48:02,195 INFO L226 Difference]: Without dead ends: 921 [2022-01-10 21:48:02,196 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-10 21:48:02,197 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 136 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 21:48:02,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 55 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 21:48:02,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2022-01-10 21:48:02,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921. [2022-01-10 21:48:02,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.2891304347826087) internal successors, (1186), 920 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1186 transitions. [2022-01-10 21:48:02,216 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1186 transitions. Word has length 155 [2022-01-10 21:48:02,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:48:02,217 INFO L470 AbstractCegarLoop]: Abstraction has 921 states and 1186 transitions. [2022-01-10 21:48:02,217 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-10 21:48:02,217 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1186 transitions. [2022-01-10 21:48:02,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-01-10 21:48:02,222 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:48:02,222 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:48:02,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 21:48:02,223 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:48:02,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:48:02,224 INFO L85 PathProgramCache]: Analyzing trace with hash -983169534, now seen corresponding path program 1 times [2022-01-10 21:48:02,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:48:02,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655202626] [2022-01-10 21:48:02,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:48:02,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:48:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:48:02,321 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-01-10 21:48:02,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:48:02,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655202626] [2022-01-10 21:48:02,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655202626] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:48:02,323 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:48:02,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:48:02,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995142697] [2022-01-10 21:48:02,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:48:02,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:48:02,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:48:02,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:48:02,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:48:02,325 INFO L87 Difference]: Start difference. First operand 921 states and 1186 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:02,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:48:02,811 INFO L93 Difference]: Finished difference Result 2495 states and 3175 transitions. [2022-01-10 21:48:02,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:48:02,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2022-01-10 21:48:02,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:48:02,817 INFO L225 Difference]: With dead ends: 2495 [2022-01-10 21:48:02,817 INFO L226 Difference]: Without dead ends: 1576 [2022-01-10 21:48:02,819 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:48:02,820 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 137 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 21:48:02,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 29 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 21:48:02,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2022-01-10 21:48:02,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1183. [2022-01-10 21:48:02,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.2656514382402708) internal successors, (1496), 1182 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:02,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1496 transitions. [2022-01-10 21:48:02,843 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1496 transitions. Word has length 168 [2022-01-10 21:48:02,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:48:02,843 INFO L470 AbstractCegarLoop]: Abstraction has 1183 states and 1496 transitions. [2022-01-10 21:48:02,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:02,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1496 transitions. [2022-01-10 21:48:02,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-01-10 21:48:02,846 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:48:02,847 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:48:02,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 21:48:02,847 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:48:02,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:48:02,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1286563581, now seen corresponding path program 1 times [2022-01-10 21:48:02,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:48:02,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836067005] [2022-01-10 21:48:02,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:48:02,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:48:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:48:02,935 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-01-10 21:48:02,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:48:02,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836067005] [2022-01-10 21:48:02,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836067005] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:48:02,936 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:48:02,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 21:48:02,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255728342] [2022-01-10 21:48:02,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:48:02,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:48:02,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:48:02,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:48:02,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:48:02,938 INFO L87 Difference]: Start difference. First operand 1183 states and 1496 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:03,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:48:03,430 INFO L93 Difference]: Finished difference Result 2495 states and 3163 transitions. [2022-01-10 21:48:03,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:48:03,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-01-10 21:48:03,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:48:03,435 INFO L225 Difference]: With dead ends: 2495 [2022-01-10 21:48:03,435 INFO L226 Difference]: Without dead ends: 1314 [2022-01-10 21:48:03,437 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-10 21:48:03,439 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 122 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 21:48:03,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 62 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 21:48:03,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2022-01-10 21:48:03,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1314. [2022-01-10 21:48:03,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 1313 states have (on average 1.2528560548362528) internal successors, (1645), 1313 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:03,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1645 transitions. [2022-01-10 21:48:03,467 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1645 transitions. Word has length 170 [2022-01-10 21:48:03,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:48:03,468 INFO L470 AbstractCegarLoop]: Abstraction has 1314 states and 1645 transitions. [2022-01-10 21:48:03,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:03,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1645 transitions. [2022-01-10 21:48:03,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-10 21:48:03,471 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:48:03,471 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:48:03,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 21:48:03,472 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:48:03,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:48:03,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1794855860, now seen corresponding path program 1 times [2022-01-10 21:48:03,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:48:03,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112268154] [2022-01-10 21:48:03,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:48:03,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:48:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:48:03,573 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-01-10 21:48:03,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:48:03,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112268154] [2022-01-10 21:48:03,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112268154] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:48:03,574 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:48:03,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:48:03,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902652984] [2022-01-10 21:48:03,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:48:03,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:48:03,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:48:03,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:48:03,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:48:03,575 INFO L87 Difference]: Start difference. First operand 1314 states and 1645 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:04,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:48:04,072 INFO L93 Difference]: Finished difference Result 3019 states and 3753 transitions. [2022-01-10 21:48:04,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:48:04,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 186 [2022-01-10 21:48:04,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:48:04,078 INFO L225 Difference]: With dead ends: 3019 [2022-01-10 21:48:04,079 INFO L226 Difference]: Without dead ends: 1707 [2022-01-10 21:48:04,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:48:04,081 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 121 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 21:48:04,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 211 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 21:48:04,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2022-01-10 21:48:04,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1576. [2022-01-10 21:48:04,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.2336507936507937) internal successors, (1943), 1575 states have internal predecessors, (1943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:04,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1943 transitions. [2022-01-10 21:48:04,113 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1943 transitions. Word has length 186 [2022-01-10 21:48:04,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:48:04,114 INFO L470 AbstractCegarLoop]: Abstraction has 1576 states and 1943 transitions. [2022-01-10 21:48:04,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:04,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1943 transitions. [2022-01-10 21:48:04,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-01-10 21:48:04,117 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:48:04,118 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:48:04,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 21:48:04,118 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:48:04,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:48:04,118 INFO L85 PathProgramCache]: Analyzing trace with hash -281543134, now seen corresponding path program 1 times [2022-01-10 21:48:04,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:48:04,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785185663] [2022-01-10 21:48:04,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:48:04,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:48:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:48:04,227 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-01-10 21:48:04,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:48:04,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785185663] [2022-01-10 21:48:04,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785185663] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:48:04,228 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:48:04,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:48:04,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36775353] [2022-01-10 21:48:04,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:48:04,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:48:04,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:48:04,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:48:04,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:48:04,229 INFO L87 Difference]: Start difference. First operand 1576 states and 1943 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:04,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:48:04,713 INFO L93 Difference]: Finished difference Result 3543 states and 4380 transitions. [2022-01-10 21:48:04,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:48:04,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2022-01-10 21:48:04,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:48:04,721 INFO L225 Difference]: With dead ends: 3543 [2022-01-10 21:48:04,721 INFO L226 Difference]: Without dead ends: 1969 [2022-01-10 21:48:04,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:48:04,724 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 121 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 21:48:04,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 205 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 21:48:04,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2022-01-10 21:48:04,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2022-01-10 21:48:04,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.1867174741426239) internal successors, (2180), 1837 states have internal predecessors, (2180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:04,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2180 transitions. [2022-01-10 21:48:04,762 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2180 transitions. Word has length 200 [2022-01-10 21:48:04,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:48:04,765 INFO L470 AbstractCegarLoop]: Abstraction has 1838 states and 2180 transitions. [2022-01-10 21:48:04,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:04,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2180 transitions. [2022-01-10 21:48:04,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-01-10 21:48:04,769 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:48:04,770 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:48:04,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 21:48:04,770 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:48:04,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:48:04,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1172000828, now seen corresponding path program 1 times [2022-01-10 21:48:04,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:48:04,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5966388] [2022-01-10 21:48:04,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:48:04,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:48:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:48:05,096 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:48:05,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:48:05,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5966388] [2022-01-10 21:48:05,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5966388] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:48:05,097 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:48:05,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 21:48:05,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004806525] [2022-01-10 21:48:05,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:48:05,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 21:48:05,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:48:05,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 21:48:05,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-01-10 21:48:05,099 INFO L87 Difference]: Start difference. First operand 1838 states and 2180 transitions. Second operand has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 5 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:06,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:48:06,422 INFO L93 Difference]: Finished difference Result 4675 states and 5612 transitions. [2022-01-10 21:48:06,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 21:48:06,423 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 5 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 221 [2022-01-10 21:48:06,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:48:06,432 INFO L225 Difference]: With dead ends: 4675 [2022-01-10 21:48:06,432 INFO L226 Difference]: Without dead ends: 2757 [2022-01-10 21:48:06,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-01-10 21:48:06,436 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 373 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:48:06,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 58 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-10 21:48:06,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2022-01-10 21:48:06,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 2100. [2022-01-10 21:48:06,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2099 states have (on average 1.1600762267746545) internal successors, (2435), 2099 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:06,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2435 transitions. [2022-01-10 21:48:06,480 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2435 transitions. Word has length 221 [2022-01-10 21:48:06,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:48:06,480 INFO L470 AbstractCegarLoop]: Abstraction has 2100 states and 2435 transitions. [2022-01-10 21:48:06,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 5 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:06,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2435 transitions. [2022-01-10 21:48:06,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-01-10 21:48:06,485 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:48:06,485 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:48:06,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 21:48:06,486 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:48:06,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:48:06,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1776230601, now seen corresponding path program 1 times [2022-01-10 21:48:06,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:48:06,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377488712] [2022-01-10 21:48:06,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:48:06,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:48:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:48:06,587 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-01-10 21:48:06,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:48:06,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377488712] [2022-01-10 21:48:06,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377488712] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:48:06,587 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:48:06,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:48:06,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042568625] [2022-01-10 21:48:06,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:48:06,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:48:06,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:48:06,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:48:06,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:48:06,589 INFO L87 Difference]: Start difference. First operand 2100 states and 2435 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:07,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:48:07,293 INFO L93 Difference]: Finished difference Result 4591 states and 5309 transitions. [2022-01-10 21:48:07,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:48:07,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 222 [2022-01-10 21:48:07,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:48:07,303 INFO L225 Difference]: With dead ends: 4591 [2022-01-10 21:48:07,304 INFO L226 Difference]: Without dead ends: 2493 [2022-01-10 21:48:07,307 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-10 21:48:07,307 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 374 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 21:48:07,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [374 Valid, 53 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 21:48:07,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2022-01-10 21:48:07,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 2362. [2022-01-10 21:48:07,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 2361 states have (on average 1.1499364675984751) internal successors, (2715), 2361 states have internal predecessors, (2715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:07,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 2715 transitions. [2022-01-10 21:48:07,354 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 2715 transitions. Word has length 222 [2022-01-10 21:48:07,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:48:07,354 INFO L470 AbstractCegarLoop]: Abstraction has 2362 states and 2715 transitions. [2022-01-10 21:48:07,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:07,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 2715 transitions. [2022-01-10 21:48:07,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2022-01-10 21:48:07,360 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:48:07,360 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:48:07,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 21:48:07,361 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:48:07,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:48:07,361 INFO L85 PathProgramCache]: Analyzing trace with hash 234245641, now seen corresponding path program 1 times [2022-01-10 21:48:07,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:48:07,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457137495] [2022-01-10 21:48:07,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:48:07,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:48:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:48:07,586 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 134 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:48:07,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:48:07,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457137495] [2022-01-10 21:48:07,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457137495] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 21:48:07,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326614262] [2022-01-10 21:48:07,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:48:07,587 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 21:48:07,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:48:07,595 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-10 21:48:07,621 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-10 21:48:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:48:08,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 3974 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 21:48:08,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 21:48:08,472 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-01-10 21:48:08,472 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 21:48:08,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326614262] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:48:08,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 21:48:08,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-01-10 21:48:08,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532775450] [2022-01-10 21:48:08,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:48:08,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:48:08,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:48:08,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:48:08,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 21:48:08,474 INFO L87 Difference]: Start difference. First operand 2362 states and 2715 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:08,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:48:08,906 INFO L93 Difference]: Finished difference Result 2757 states and 3182 transitions. [2022-01-10 21:48:08,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:48:08,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 236 [2022-01-10 21:48:08,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:48:08,915 INFO L225 Difference]: With dead ends: 2757 [2022-01-10 21:48:08,915 INFO L226 Difference]: Without dead ends: 2755 [2022-01-10 21:48:08,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 21:48:08,917 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 39 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 21:48:08,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 31 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 21:48:08,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2022-01-10 21:48:08,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2231. [2022-01-10 21:48:08,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2231 states, 2230 states have (on average 1.1506726457399103) internal successors, (2566), 2230 states have internal predecessors, (2566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:08,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2566 transitions. [2022-01-10 21:48:08,974 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2566 transitions. Word has length 236 [2022-01-10 21:48:08,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:48:08,975 INFO L470 AbstractCegarLoop]: Abstraction has 2231 states and 2566 transitions. [2022-01-10 21:48:08,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:08,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2566 transitions. [2022-01-10 21:48:08,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-01-10 21:48:08,980 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:48:08,980 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:48:09,013 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-10 21:48:09,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-10 21:48:09,208 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:48:09,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:48:09,208 INFO L85 PathProgramCache]: Analyzing trace with hash -980825597, now seen corresponding path program 1 times [2022-01-10 21:48:09,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:48:09,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074472942] [2022-01-10 21:48:09,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:48:09,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:48:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:48:09,362 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-01-10 21:48:09,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:48:09,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074472942] [2022-01-10 21:48:09,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074472942] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:48:09,363 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:48:09,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:48:09,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752385706] [2022-01-10 21:48:09,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:48:09,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:48:09,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:48:09,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:48:09,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:48:09,364 INFO L87 Difference]: Start difference. First operand 2231 states and 2566 transitions. Second operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:10,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:48:10,112 INFO L93 Difference]: Finished difference Result 4722 states and 5415 transitions. [2022-01-10 21:48:10,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:48:10,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 248 [2022-01-10 21:48:10,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:48:10,120 INFO L225 Difference]: With dead ends: 4722 [2022-01-10 21:48:10,120 INFO L226 Difference]: Without dead ends: 2493 [2022-01-10 21:48:10,124 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-10 21:48:10,124 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 222 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 21:48:10,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 31 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 21:48:10,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2022-01-10 21:48:10,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 2362. [2022-01-10 21:48:10,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 2361 states have (on average 1.1266412537060568) internal successors, (2660), 2361 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:10,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 2660 transitions. [2022-01-10 21:48:10,165 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 2660 transitions. Word has length 248 [2022-01-10 21:48:10,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:48:10,166 INFO L470 AbstractCegarLoop]: Abstraction has 2362 states and 2660 transitions. [2022-01-10 21:48:10,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:10,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 2660 transitions. [2022-01-10 21:48:10,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-01-10 21:48:10,171 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:48:10,172 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:48:10,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 21:48:10,172 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:48:10,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:48:10,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1901364315, now seen corresponding path program 1 times [2022-01-10 21:48:10,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:48:10,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359997333] [2022-01-10 21:48:10,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:48:10,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:48:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:48:10,316 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-01-10 21:48:10,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:48:10,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359997333] [2022-01-10 21:48:10,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359997333] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:48:10,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:48:10,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 21:48:10,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735595106] [2022-01-10 21:48:10,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:48:10,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:48:10,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:48:10,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:48:10,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:48:10,318 INFO L87 Difference]: Start difference. First operand 2362 states and 2660 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:10,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:48:10,754 INFO L93 Difference]: Finished difference Result 4722 states and 5318 transitions. [2022-01-10 21:48:10,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:48:10,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 257 [2022-01-10 21:48:10,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:48:10,761 INFO L225 Difference]: With dead ends: 4722 [2022-01-10 21:48:10,761 INFO L226 Difference]: Without dead ends: 2362 [2022-01-10 21:48:10,763 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-10 21:48:10,765 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 82 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 21:48:10,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 62 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 21:48:10,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2022-01-10 21:48:10,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2362. [2022-01-10 21:48:10,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 2361 states have (on average 1.1240999576450657) internal successors, (2654), 2361 states have internal predecessors, (2654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:10,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 2654 transitions. [2022-01-10 21:48:10,801 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 2654 transitions. Word has length 257 [2022-01-10 21:48:10,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:48:10,801 INFO L470 AbstractCegarLoop]: Abstraction has 2362 states and 2654 transitions. [2022-01-10 21:48:10,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:10,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 2654 transitions. [2022-01-10 21:48:10,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2022-01-10 21:48:10,807 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:48:10,807 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:48:10,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 21:48:10,808 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:48:10,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:48:10,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1574517919, now seen corresponding path program 1 times [2022-01-10 21:48:10,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:48:10,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208810290] [2022-01-10 21:48:10,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:48:10,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:48:10,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:48:11,029 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-01-10 21:48:11,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:48:11,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208810290] [2022-01-10 21:48:11,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208810290] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:48:11,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:48:11,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:48:11,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124506027] [2022-01-10 21:48:11,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:48:11,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:48:11,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:48:11,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:48:11,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:48:11,031 INFO L87 Difference]: Start difference. First operand 2362 states and 2654 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:11,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:48:11,494 INFO L93 Difference]: Finished difference Result 4851 states and 5435 transitions. [2022-01-10 21:48:11,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:48:11,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 313 [2022-01-10 21:48:11,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:48:11,497 INFO L225 Difference]: With dead ends: 4851 [2022-01-10 21:48:11,497 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 21:48:11,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:48:11,502 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 86 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 21:48:11,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 189 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 21:48:11,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 21:48:11,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 21:48:11,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:11,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 21:48:11,503 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 313 [2022-01-10 21:48:11,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:48:11,504 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 21:48:11,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:11,504 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 21:48:11,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 21:48:11,506 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 21:48:11,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 21:48:11,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 21:48:12,735 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 21:48:12,735 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 21:48:12,735 INFO L854 garLoopResultBuilder]: At program point L593-2(lines 593 603) the Hoare annotation is: (let ((.cse7 (= ~a7~0Int 1))) (let ((.cse0 (<= ~a17~0Int 0)) (.cse2 (not .cse7)) (.cse3 (<= 15 ~a8~0Int)) (.cse5 (<= ~a16~0Int 5)) (.cse9 (<= 14 ~a8~0Int)) (.cse1 (= ~a21~0Int 1)) (.cse8 (= ~a17~0Int 1)) (.cse6 (= ~a20~0Int 1)) (.cse4 (= ~a12~0Int 8))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse4) (and .cse0 .cse1 .cse2 (= ~a16~0Int 4) (= ~a8~0Int 13) .cse4) (and .cse6 .cse7) (and (<= ~a16~0Int 4) (<= ~a20~0Int 0) .cse8 .cse7) (and .cse1 .cse9 .cse6 .cse4) (and .cse5 .cse0 .cse1 .cse9 .cse4) (and .cse1 .cse2 .cse3 .cse8 .cse4) (and .cse5 .cse1 .cse9 .cse4 .cse7) (and .cse1 .cse8 .cse6 .cse4)))) [2022-01-10 21:48:12,736 INFO L861 garLoopResultBuilder]: At program point L587(lines 587 604) the Hoare annotation is: true [2022-01-10 21:48:12,736 INFO L858 garLoopResultBuilder]: For program point L598(line 598) no Hoare annotation was computed. [2022-01-10 21:48:12,736 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 21:48:12,736 INFO L858 garLoopResultBuilder]: For program point L41(lines 41 400) no Hoare annotation was computed. [2022-01-10 21:48:12,736 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 21:48:12,736 INFO L854 garLoopResultBuilder]: At program point L584(lines 40 585) the Hoare annotation is: (let ((.cse7 (= ~a7~0Int 1))) (let ((.cse0 (<= ~a17~0Int 0)) (.cse2 (not .cse7)) (.cse3 (<= 15 ~a8~0Int)) (.cse5 (<= ~a16~0Int 5)) (.cse9 (<= 14 ~a8~0Int)) (.cse1 (= ~a21~0Int 1)) (.cse8 (= ~a17~0Int 1)) (.cse6 (= ~a20~0Int 1)) (.cse4 (= ~a12~0Int 8))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse4) (and .cse0 .cse1 .cse2 (= ~a16~0Int 4) (= ~a8~0Int 13) .cse4) (and .cse6 .cse7) (and (<= ~a16~0Int 4) (<= ~a20~0Int 0) .cse8 .cse7) (and .cse1 .cse9 .cse6 .cse4) (and .cse5 .cse0 .cse1 .cse9 .cse4) (and .cse1 .cse2 .cse3 .cse8 .cse4) (and .cse5 .cse1 .cse9 .cse4 .cse7) (and .cse1 .cse8 .cse6 .cse4)))) [2022-01-10 21:48:12,736 INFO L858 garLoopResultBuilder]: For program point L45(lines 45 400) no Hoare annotation was computed. [2022-01-10 21:48:12,736 INFO L858 garLoopResultBuilder]: For program point L53(lines 53 400) no Hoare annotation was computed. [2022-01-10 21:48:12,736 INFO L858 garLoopResultBuilder]: For program point L59(lines 59 400) no Hoare annotation was computed. [2022-01-10 21:48:12,736 INFO L858 garLoopResultBuilder]: For program point L64(lines 64 400) no Hoare annotation was computed. [2022-01-10 21:48:12,736 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 400) no Hoare annotation was computed. [2022-01-10 21:48:12,736 INFO L858 garLoopResultBuilder]: For program point L75(lines 75 400) no Hoare annotation was computed. [2022-01-10 21:48:12,736 INFO L858 garLoopResultBuilder]: For program point L82(lines 82 400) no Hoare annotation was computed. [2022-01-10 21:48:12,736 INFO L858 garLoopResultBuilder]: For program point L90(lines 90 400) no Hoare annotation was computed. [2022-01-10 21:48:12,736 INFO L858 garLoopResultBuilder]: For program point L94(lines 94 400) no Hoare annotation was computed. [2022-01-10 21:48:12,736 INFO L858 garLoopResultBuilder]: For program point L102(lines 102 400) no Hoare annotation was computed. [2022-01-10 21:48:12,737 INFO L858 garLoopResultBuilder]: For program point L107(lines 107 400) no Hoare annotation was computed. [2022-01-10 21:48:12,737 INFO L858 garLoopResultBuilder]: For program point L112(lines 112 400) no Hoare annotation was computed. [2022-01-10 21:48:12,737 INFO L858 garLoopResultBuilder]: For program point L118(lines 118 400) no Hoare annotation was computed. [2022-01-10 21:48:12,737 INFO L858 garLoopResultBuilder]: For program point L124(lines 124 400) no Hoare annotation was computed. [2022-01-10 21:48:12,737 INFO L858 garLoopResultBuilder]: For program point L129(lines 129 400) no Hoare annotation was computed. [2022-01-10 21:48:12,737 INFO L858 garLoopResultBuilder]: For program point L134(lines 134 400) no Hoare annotation was computed. [2022-01-10 21:48:12,737 INFO L858 garLoopResultBuilder]: For program point L139(lines 139 400) no Hoare annotation was computed. [2022-01-10 21:48:12,737 INFO L858 garLoopResultBuilder]: For program point L146(lines 146 400) no Hoare annotation was computed. [2022-01-10 21:48:12,737 INFO L858 garLoopResultBuilder]: For program point L150(lines 150 400) no Hoare annotation was computed. [2022-01-10 21:48:12,737 INFO L858 garLoopResultBuilder]: For program point L154(lines 154 400) no Hoare annotation was computed. [2022-01-10 21:48:12,737 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 400) no Hoare annotation was computed. [2022-01-10 21:48:12,737 INFO L858 garLoopResultBuilder]: For program point L162(lines 162 400) no Hoare annotation was computed. [2022-01-10 21:48:12,737 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 400) no Hoare annotation was computed. [2022-01-10 21:48:12,737 INFO L858 garLoopResultBuilder]: For program point L175(lines 175 400) no Hoare annotation was computed. [2022-01-10 21:48:12,737 INFO L858 garLoopResultBuilder]: For program point L183(lines 183 400) no Hoare annotation was computed. [2022-01-10 21:48:12,737 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 400) no Hoare annotation was computed. [2022-01-10 21:48:12,737 INFO L858 garLoopResultBuilder]: For program point L196(lines 196 400) no Hoare annotation was computed. [2022-01-10 21:48:12,737 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 400) no Hoare annotation was computed. [2022-01-10 21:48:12,738 INFO L858 garLoopResultBuilder]: For program point L204(lines 204 400) no Hoare annotation was computed. [2022-01-10 21:48:12,738 INFO L858 garLoopResultBuilder]: For program point L207(lines 207 400) no Hoare annotation was computed. [2022-01-10 21:48:12,738 INFO L858 garLoopResultBuilder]: For program point L213(lines 213 400) no Hoare annotation was computed. [2022-01-10 21:48:12,738 INFO L858 garLoopResultBuilder]: For program point L218(lines 218 400) no Hoare annotation was computed. [2022-01-10 21:48:12,738 INFO L858 garLoopResultBuilder]: For program point L224(lines 224 400) no Hoare annotation was computed. [2022-01-10 21:48:12,738 INFO L858 garLoopResultBuilder]: For program point L228(lines 228 400) no Hoare annotation was computed. [2022-01-10 21:48:12,738 INFO L858 garLoopResultBuilder]: For program point L233(lines 233 400) no Hoare annotation was computed. [2022-01-10 21:48:12,738 INFO L858 garLoopResultBuilder]: For program point L241(lines 241 400) no Hoare annotation was computed. [2022-01-10 21:48:12,738 INFO L858 garLoopResultBuilder]: For program point L248(lines 248 400) no Hoare annotation was computed. [2022-01-10 21:48:12,738 INFO L858 garLoopResultBuilder]: For program point L255(lines 255 400) no Hoare annotation was computed. [2022-01-10 21:48:12,738 INFO L858 garLoopResultBuilder]: For program point L260(lines 260 400) no Hoare annotation was computed. [2022-01-10 21:48:12,738 INFO L858 garLoopResultBuilder]: For program point L266(lines 266 400) no Hoare annotation was computed. [2022-01-10 21:48:12,738 INFO L858 garLoopResultBuilder]: For program point L271(lines 271 400) no Hoare annotation was computed. [2022-01-10 21:48:12,738 INFO L858 garLoopResultBuilder]: For program point L275(lines 275 400) no Hoare annotation was computed. [2022-01-10 21:48:12,738 INFO L858 garLoopResultBuilder]: For program point L278(lines 278 400) no Hoare annotation was computed. [2022-01-10 21:48:12,739 INFO L858 garLoopResultBuilder]: For program point L283(lines 283 400) no Hoare annotation was computed. [2022-01-10 21:48:12,739 INFO L858 garLoopResultBuilder]: For program point L288(lines 288 400) no Hoare annotation was computed. [2022-01-10 21:48:12,739 INFO L858 garLoopResultBuilder]: For program point L296(lines 296 400) no Hoare annotation was computed. [2022-01-10 21:48:12,739 INFO L858 garLoopResultBuilder]: For program point L302(lines 302 400) no Hoare annotation was computed. [2022-01-10 21:48:12,739 INFO L858 garLoopResultBuilder]: For program point L309(lines 309 400) no Hoare annotation was computed. [2022-01-10 21:48:12,739 INFO L858 garLoopResultBuilder]: For program point L316(lines 316 400) no Hoare annotation was computed. [2022-01-10 21:48:12,739 INFO L858 garLoopResultBuilder]: For program point L322(lines 322 400) no Hoare annotation was computed. [2022-01-10 21:48:12,739 INFO L858 garLoopResultBuilder]: For program point L326(lines 326 400) no Hoare annotation was computed. [2022-01-10 21:48:12,739 INFO L858 garLoopResultBuilder]: For program point L328(lines 328 400) no Hoare annotation was computed. [2022-01-10 21:48:12,739 INFO L858 garLoopResultBuilder]: For program point L334(lines 334 400) no Hoare annotation was computed. [2022-01-10 21:48:12,739 INFO L858 garLoopResultBuilder]: For program point L339(lines 339 400) no Hoare annotation was computed. [2022-01-10 21:48:12,739 INFO L858 garLoopResultBuilder]: For program point L343(lines 343 400) no Hoare annotation was computed. [2022-01-10 21:48:12,739 INFO L858 garLoopResultBuilder]: For program point L347(lines 347 400) no Hoare annotation was computed. [2022-01-10 21:48:12,739 INFO L858 garLoopResultBuilder]: For program point L355(lines 355 400) no Hoare annotation was computed. [2022-01-10 21:48:12,739 INFO L858 garLoopResultBuilder]: For program point L363(lines 363 400) no Hoare annotation was computed. [2022-01-10 21:48:12,739 INFO L858 garLoopResultBuilder]: For program point L365(lines 365 400) no Hoare annotation was computed. [2022-01-10 21:48:12,739 INFO L858 garLoopResultBuilder]: For program point L371(lines 371 400) no Hoare annotation was computed. [2022-01-10 21:48:12,739 INFO L858 garLoopResultBuilder]: For program point L373(lines 373 400) no Hoare annotation was computed. [2022-01-10 21:48:12,739 INFO L858 garLoopResultBuilder]: For program point L375(lines 375 400) no Hoare annotation was computed. [2022-01-10 21:48:12,739 INFO L858 garLoopResultBuilder]: For program point L382(lines 382 400) no Hoare annotation was computed. [2022-01-10 21:48:12,739 INFO L858 garLoopResultBuilder]: For program point L387(lines 387 400) no Hoare annotation was computed. [2022-01-10 21:48:12,740 INFO L858 garLoopResultBuilder]: For program point L392(lines 392 400) no Hoare annotation was computed. [2022-01-10 21:48:12,740 INFO L858 garLoopResultBuilder]: For program point L401(lines 401 403) no Hoare annotation was computed. [2022-01-10 21:48:12,740 INFO L858 garLoopResultBuilder]: For program point L402(line 402) no Hoare annotation was computed. [2022-01-10 21:48:12,740 INFO L858 garLoopResultBuilder]: For program point L401-2(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,740 INFO L858 garLoopResultBuilder]: For program point L405(line 405) no Hoare annotation was computed. [2022-01-10 21:48:12,740 INFO L858 garLoopResultBuilder]: For program point L404-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,740 INFO L858 garLoopResultBuilder]: For program point L408(line 408) no Hoare annotation was computed. [2022-01-10 21:48:12,740 INFO L858 garLoopResultBuilder]: For program point L407-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,740 INFO L858 garLoopResultBuilder]: For program point L411(line 411) no Hoare annotation was computed. [2022-01-10 21:48:12,740 INFO L858 garLoopResultBuilder]: For program point L410-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,740 INFO L858 garLoopResultBuilder]: For program point L414(line 414) no Hoare annotation was computed. [2022-01-10 21:48:12,741 INFO L858 garLoopResultBuilder]: For program point L413-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,741 INFO L858 garLoopResultBuilder]: For program point L417(line 417) no Hoare annotation was computed. [2022-01-10 21:48:12,741 INFO L858 garLoopResultBuilder]: For program point L416-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,741 INFO L858 garLoopResultBuilder]: For program point L420(line 420) no Hoare annotation was computed. [2022-01-10 21:48:12,741 INFO L858 garLoopResultBuilder]: For program point L419-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,741 INFO L858 garLoopResultBuilder]: For program point L423(line 423) no Hoare annotation was computed. [2022-01-10 21:48:12,741 INFO L858 garLoopResultBuilder]: For program point L422-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,741 INFO L858 garLoopResultBuilder]: For program point L426(line 426) no Hoare annotation was computed. [2022-01-10 21:48:12,741 INFO L858 garLoopResultBuilder]: For program point L425-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,741 INFO L858 garLoopResultBuilder]: For program point L429(line 429) no Hoare annotation was computed. [2022-01-10 21:48:12,741 INFO L858 garLoopResultBuilder]: For program point L428-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,741 INFO L858 garLoopResultBuilder]: For program point L432(line 432) no Hoare annotation was computed. [2022-01-10 21:48:12,741 INFO L858 garLoopResultBuilder]: For program point L431-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,741 INFO L858 garLoopResultBuilder]: For program point L435(line 435) no Hoare annotation was computed. [2022-01-10 21:48:12,742 INFO L858 garLoopResultBuilder]: For program point L434-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,742 INFO L858 garLoopResultBuilder]: For program point L438(line 438) no Hoare annotation was computed. [2022-01-10 21:48:12,742 INFO L858 garLoopResultBuilder]: For program point L437-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,742 INFO L858 garLoopResultBuilder]: For program point L441(line 441) no Hoare annotation was computed. [2022-01-10 21:48:12,742 INFO L858 garLoopResultBuilder]: For program point L440-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,742 INFO L858 garLoopResultBuilder]: For program point L444(line 444) no Hoare annotation was computed. [2022-01-10 21:48:12,742 INFO L858 garLoopResultBuilder]: For program point L443-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,742 INFO L858 garLoopResultBuilder]: For program point L447(line 447) no Hoare annotation was computed. [2022-01-10 21:48:12,742 INFO L858 garLoopResultBuilder]: For program point L446-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,742 INFO L858 garLoopResultBuilder]: For program point L450(line 450) no Hoare annotation was computed. [2022-01-10 21:48:12,742 INFO L858 garLoopResultBuilder]: For program point L449-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,742 INFO L858 garLoopResultBuilder]: For program point L453(line 453) no Hoare annotation was computed. [2022-01-10 21:48:12,742 INFO L858 garLoopResultBuilder]: For program point L452-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,742 INFO L858 garLoopResultBuilder]: For program point L456(line 456) no Hoare annotation was computed. [2022-01-10 21:48:12,742 INFO L858 garLoopResultBuilder]: For program point L455-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,742 INFO L858 garLoopResultBuilder]: For program point L459(line 459) no Hoare annotation was computed. [2022-01-10 21:48:12,742 INFO L858 garLoopResultBuilder]: For program point L458-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,743 INFO L858 garLoopResultBuilder]: For program point L462(line 462) no Hoare annotation was computed. [2022-01-10 21:48:12,743 INFO L858 garLoopResultBuilder]: For program point L461-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,743 INFO L858 garLoopResultBuilder]: For program point L465(line 465) no Hoare annotation was computed. [2022-01-10 21:48:12,743 INFO L858 garLoopResultBuilder]: For program point L464-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,743 INFO L858 garLoopResultBuilder]: For program point L468(line 468) no Hoare annotation was computed. [2022-01-10 21:48:12,743 INFO L858 garLoopResultBuilder]: For program point L467-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,743 INFO L858 garLoopResultBuilder]: For program point L471(line 471) no Hoare annotation was computed. [2022-01-10 21:48:12,743 INFO L858 garLoopResultBuilder]: For program point L470-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,743 INFO L858 garLoopResultBuilder]: For program point L474(line 474) no Hoare annotation was computed. [2022-01-10 21:48:12,743 INFO L858 garLoopResultBuilder]: For program point L473-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,743 INFO L858 garLoopResultBuilder]: For program point L477(line 477) no Hoare annotation was computed. [2022-01-10 21:48:12,743 INFO L858 garLoopResultBuilder]: For program point L476-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,743 INFO L858 garLoopResultBuilder]: For program point L480(line 480) no Hoare annotation was computed. [2022-01-10 21:48:12,743 INFO L858 garLoopResultBuilder]: For program point L479-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,743 INFO L858 garLoopResultBuilder]: For program point L483(line 483) no Hoare annotation was computed. [2022-01-10 21:48:12,744 INFO L858 garLoopResultBuilder]: For program point L482-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,744 INFO L858 garLoopResultBuilder]: For program point L486(line 486) no Hoare annotation was computed. [2022-01-10 21:48:12,744 INFO L858 garLoopResultBuilder]: For program point L485-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,744 INFO L858 garLoopResultBuilder]: For program point L489(line 489) no Hoare annotation was computed. [2022-01-10 21:48:12,744 INFO L858 garLoopResultBuilder]: For program point L488-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,744 INFO L858 garLoopResultBuilder]: For program point L492(line 492) no Hoare annotation was computed. [2022-01-10 21:48:12,744 INFO L858 garLoopResultBuilder]: For program point L491-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,744 INFO L858 garLoopResultBuilder]: For program point L495(line 495) no Hoare annotation was computed. [2022-01-10 21:48:12,744 INFO L858 garLoopResultBuilder]: For program point L494-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,744 INFO L858 garLoopResultBuilder]: For program point L498(line 498) no Hoare annotation was computed. [2022-01-10 21:48:12,744 INFO L858 garLoopResultBuilder]: For program point L497-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,744 INFO L858 garLoopResultBuilder]: For program point L501(line 501) no Hoare annotation was computed. [2022-01-10 21:48:12,744 INFO L858 garLoopResultBuilder]: For program point L500-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,744 INFO L858 garLoopResultBuilder]: For program point L504(line 504) no Hoare annotation was computed. [2022-01-10 21:48:12,744 INFO L858 garLoopResultBuilder]: For program point L503-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,744 INFO L858 garLoopResultBuilder]: For program point L507(line 507) no Hoare annotation was computed. [2022-01-10 21:48:12,744 INFO L858 garLoopResultBuilder]: For program point L506-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,745 INFO L858 garLoopResultBuilder]: For program point L510(line 510) no Hoare annotation was computed. [2022-01-10 21:48:12,745 INFO L858 garLoopResultBuilder]: For program point L509-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,745 INFO L858 garLoopResultBuilder]: For program point L513(line 513) no Hoare annotation was computed. [2022-01-10 21:48:12,745 INFO L858 garLoopResultBuilder]: For program point L512-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,745 INFO L858 garLoopResultBuilder]: For program point L516(line 516) no Hoare annotation was computed. [2022-01-10 21:48:12,745 INFO L858 garLoopResultBuilder]: For program point L515-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,745 INFO L858 garLoopResultBuilder]: For program point L519(line 519) no Hoare annotation was computed. [2022-01-10 21:48:12,745 INFO L858 garLoopResultBuilder]: For program point L518-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,745 INFO L858 garLoopResultBuilder]: For program point L522(line 522) no Hoare annotation was computed. [2022-01-10 21:48:12,745 INFO L858 garLoopResultBuilder]: For program point L521-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,745 INFO L858 garLoopResultBuilder]: For program point L525(line 525) no Hoare annotation was computed. [2022-01-10 21:48:12,745 INFO L858 garLoopResultBuilder]: For program point L524-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,745 INFO L858 garLoopResultBuilder]: For program point L528(line 528) no Hoare annotation was computed. [2022-01-10 21:48:12,745 INFO L858 garLoopResultBuilder]: For program point L527-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,745 INFO L858 garLoopResultBuilder]: For program point L531(line 531) no Hoare annotation was computed. [2022-01-10 21:48:12,745 INFO L858 garLoopResultBuilder]: For program point L530-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,745 INFO L858 garLoopResultBuilder]: For program point L534(line 534) no Hoare annotation was computed. [2022-01-10 21:48:12,745 INFO L858 garLoopResultBuilder]: For program point L533-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,746 INFO L858 garLoopResultBuilder]: For program point L537(line 537) no Hoare annotation was computed. [2022-01-10 21:48:12,746 INFO L858 garLoopResultBuilder]: For program point L536-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,746 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 537) no Hoare annotation was computed. [2022-01-10 21:48:12,746 INFO L858 garLoopResultBuilder]: For program point L540(line 540) no Hoare annotation was computed. [2022-01-10 21:48:12,746 INFO L858 garLoopResultBuilder]: For program point L539-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,746 INFO L858 garLoopResultBuilder]: For program point L543(line 543) no Hoare annotation was computed. [2022-01-10 21:48:12,746 INFO L858 garLoopResultBuilder]: For program point L542-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,746 INFO L858 garLoopResultBuilder]: For program point L546(line 546) no Hoare annotation was computed. [2022-01-10 21:48:12,746 INFO L858 garLoopResultBuilder]: For program point L545-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,746 INFO L858 garLoopResultBuilder]: For program point L549(line 549) no Hoare annotation was computed. [2022-01-10 21:48:12,746 INFO L858 garLoopResultBuilder]: For program point L548-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,746 INFO L858 garLoopResultBuilder]: For program point L552(line 552) no Hoare annotation was computed. [2022-01-10 21:48:12,746 INFO L858 garLoopResultBuilder]: For program point L551-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,746 INFO L858 garLoopResultBuilder]: For program point L555(line 555) no Hoare annotation was computed. [2022-01-10 21:48:12,746 INFO L858 garLoopResultBuilder]: For program point L554-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,747 INFO L858 garLoopResultBuilder]: For program point L558(line 558) no Hoare annotation was computed. [2022-01-10 21:48:12,747 INFO L858 garLoopResultBuilder]: For program point L557-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,747 INFO L858 garLoopResultBuilder]: For program point L561(line 561) no Hoare annotation was computed. [2022-01-10 21:48:12,747 INFO L858 garLoopResultBuilder]: For program point L560-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,747 INFO L858 garLoopResultBuilder]: For program point L564(line 564) no Hoare annotation was computed. [2022-01-10 21:48:12,747 INFO L858 garLoopResultBuilder]: For program point L563-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,747 INFO L858 garLoopResultBuilder]: For program point L567(line 567) no Hoare annotation was computed. [2022-01-10 21:48:12,747 INFO L858 garLoopResultBuilder]: For program point L566-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,747 INFO L858 garLoopResultBuilder]: For program point L570(line 570) no Hoare annotation was computed. [2022-01-10 21:48:12,747 INFO L858 garLoopResultBuilder]: For program point L569-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,747 INFO L858 garLoopResultBuilder]: For program point L573(line 573) no Hoare annotation was computed. [2022-01-10 21:48:12,747 INFO L858 garLoopResultBuilder]: For program point L572-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,747 INFO L858 garLoopResultBuilder]: For program point L576(line 576) no Hoare annotation was computed. [2022-01-10 21:48:12,747 INFO L858 garLoopResultBuilder]: For program point L575-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,747 INFO L858 garLoopResultBuilder]: For program point L579(line 579) no Hoare annotation was computed. [2022-01-10 21:48:12,747 INFO L858 garLoopResultBuilder]: For program point L578-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:12,747 INFO L858 garLoopResultBuilder]: For program point L582(line 582) no Hoare annotation was computed. [2022-01-10 21:48:12,748 INFO L858 garLoopResultBuilder]: For program point L581-1(lines 581 583) no Hoare annotation was computed. [2022-01-10 21:48:12,751 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:48:12,752 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 21:48:12,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 09:48:12 BasicIcfg [2022-01-10 21:48:12,783 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 21:48:12,784 INFO L158 Benchmark]: Toolchain (without parser) took 16207.38ms. Allocated memory was 173.0MB in the beginning and 286.3MB in the end (delta: 113.2MB). Free memory was 113.2MB in the beginning and 138.2MB in the end (delta: -25.0MB). Peak memory consumption was 156.6MB. Max. memory is 8.0GB. [2022-01-10 21:48:12,784 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 173.0MB. Free memory is still 131.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 21:48:12,784 INFO L158 Benchmark]: CACSL2BoogieTranslator took 527.15ms. Allocated memory was 173.0MB in the beginning and 230.7MB in the end (delta: 57.7MB). Free memory was 113.0MB in the beginning and 184.0MB in the end (delta: -71.0MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. [2022-01-10 21:48:12,784 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.28ms. Allocated memory is still 230.7MB. Free memory was 184.0MB in the beginning and 178.3MB in the end (delta: 5.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-10 21:48:12,785 INFO L158 Benchmark]: Boogie Preprocessor took 57.25ms. Allocated memory is still 230.7MB. Free memory was 178.3MB in the beginning and 173.5MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-10 21:48:12,785 INFO L158 Benchmark]: RCFGBuilder took 1145.49ms. Allocated memory is still 230.7MB. Free memory was 173.5MB in the beginning and 112.7MB in the end (delta: 60.8MB). Peak memory consumption was 60.8MB. Max. memory is 8.0GB. [2022-01-10 21:48:12,785 INFO L158 Benchmark]: IcfgTransformer took 274.40ms. Allocated memory is still 230.7MB. Free memory was 112.7MB in the beginning and 76.0MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-01-10 21:48:12,785 INFO L158 Benchmark]: TraceAbstraction took 14113.44ms. Allocated memory was 230.7MB in the beginning and 286.3MB in the end (delta: 55.6MB). Free memory was 75.5MB in the beginning and 138.2MB in the end (delta: -62.7MB). Peak memory consumption was 62.1MB. Max. memory is 8.0GB. [2022-01-10 21:48:12,787 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 173.0MB. Free memory is still 131.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 527.15ms. Allocated memory was 173.0MB in the beginning and 230.7MB in the end (delta: 57.7MB). Free memory was 113.0MB in the beginning and 184.0MB in the end (delta: -71.0MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 78.28ms. Allocated memory is still 230.7MB. Free memory was 184.0MB in the beginning and 178.3MB in the end (delta: 5.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.25ms. Allocated memory is still 230.7MB. Free memory was 178.3MB in the beginning and 173.5MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1145.49ms. Allocated memory is still 230.7MB. Free memory was 173.5MB in the beginning and 112.7MB in the end (delta: 60.8MB). Peak memory consumption was 60.8MB. Max. memory is 8.0GB. * IcfgTransformer took 274.40ms. Allocated memory is still 230.7MB. Free memory was 112.7MB in the beginning and 76.0MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 14113.44ms. Allocated memory was 230.7MB in the beginning and 286.3MB in the end (delta: 55.6MB). Free memory was 75.5MB in the beginning and 138.2MB in the end (delta: -62.7MB). Peak memory consumption was 62.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 537]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.0s, OverallIterations: 14, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2062 SdHoareTripleChecker+Valid, 7.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2062 mSDsluCounter, 1120 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 985 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5985 IncrementalHoareTripleChecker+Invalid, 6970 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 985 mSolverCounterUnsat, 1019 mSDtfsCounter, 5985 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2362occurred in iteration=10, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 2229 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 45 NumberOfFragments, 293 HoareAnnotationTreeSize, 3 FomulaSimplifications, 3182 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 3 FomulaSimplificationsInter, 10640 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 3001 NumberOfCodeBlocks, 3001 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2986 ConstructedInterpolants, 0 QuantifiedInterpolants, 12078 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3974 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 2104/2140 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: (((((((((((1bv32 == a20 && 8bv32 == a12) && ~bvule32(a16, 5bv32)) && 1bv32 == a21) || ((((8bv32 == a12 && !(a7 == 1bv32)) && ~bvule32(a17, 0bv32)) && ~bvule32(15bv32, a8)) && 1bv32 == a21)) || ((((8bv32 == a12 && ~bvule32(14bv32, a8)) && ~bvule32(a16, 5bv32)) && ~bvule32(a17, 0bv32)) && 1bv32 == a21)) || ((((8bv32 == a12 && a7 == 1bv32) && ~bvule32(14bv32, a8)) && ~bvule32(a16, 5bv32)) && 1bv32 == a21)) || (((1bv32 == a20 && 8bv32 == a12) && ~bvule32(14bv32, a8)) && 1bv32 == a21)) || (((1bv32 == a20 && 8bv32 == a12) && 1bv32 == a17) && 1bv32 == a21)) || (((a7 == 1bv32 && ~bvule32(a16, 4bv32)) && 1bv32 == a17) && ~bvule32(a20, 0bv32))) || (((((8bv32 == a12 && !(a7 == 1bv32)) && 4bv32 == a16) && ~bvule32(a17, 0bv32)) && a8 == 13bv32) && 1bv32 == a21)) || ((((8bv32 == a12 && !(a7 == 1bv32)) && 1bv32 == a17) && ~bvule32(15bv32, a8)) && 1bv32 == a21)) || (1bv32 == a20 && a7 == 1bv32) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: (((((((((((1bv32 == a20 && 8bv32 == a12) && ~bvule32(a16, 5bv32)) && 1bv32 == a21) || ((((8bv32 == a12 && !(a7 == 1bv32)) && ~bvule32(a17, 0bv32)) && ~bvule32(15bv32, a8)) && 1bv32 == a21)) || ((((8bv32 == a12 && ~bvule32(14bv32, a8)) && ~bvule32(a16, 5bv32)) && ~bvule32(a17, 0bv32)) && 1bv32 == a21)) || ((((8bv32 == a12 && a7 == 1bv32) && ~bvule32(14bv32, a8)) && ~bvule32(a16, 5bv32)) && 1bv32 == a21)) || (((1bv32 == a20 && 8bv32 == a12) && ~bvule32(14bv32, a8)) && 1bv32 == a21)) || (((1bv32 == a20 && 8bv32 == a12) && 1bv32 == a17) && 1bv32 == a21)) || (((a7 == 1bv32 && ~bvule32(a16, 4bv32)) && 1bv32 == a17) && ~bvule32(a20, 0bv32))) || (((((8bv32 == a12 && !(a7 == 1bv32)) && 4bv32 == a16) && ~bvule32(a17, 0bv32)) && a8 == 13bv32) && 1bv32 == a21)) || ((((8bv32 == a12 && !(a7 == 1bv32)) && 1bv32 == a17) && ~bvule32(15bv32, a8)) && 1bv32 == a21)) || (1bv32 == a20 && a7 == 1bv32) RESULT: Ultimate proved your program to be correct! [2022-01-10 21:48:12,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...