/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label46.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 03:36:52,375 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 03:36:52,378 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 03:36:52,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 03:36:52,440 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 03:36:52,441 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 03:36:52,443 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 03:36:52,445 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 03:36:52,446 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 03:36:52,447 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 03:36:52,448 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 03:36:52,449 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 03:36:52,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 03:36:52,453 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 03:36:52,454 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 03:36:52,456 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 03:36:52,456 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 03:36:52,457 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 03:36:52,460 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 03:36:52,470 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 03:36:52,473 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 03:36:52,477 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 03:36:52,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 03:36:52,478 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 03:36:52,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 03:36:52,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 03:36:52,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 03:36:52,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 03:36:52,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 03:36:52,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 03:36:52,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 03:36:52,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 03:36:52,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 03:36:52,485 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 03:36:52,486 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 03:36:52,486 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 03:36:52,493 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 03:36:52,494 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 03:36:52,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 03:36:52,495 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 03:36:52,496 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 03:36:52,497 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 03:36:52,535 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 03:36:52,535 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 03:36:52,536 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 03:36:52,536 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 03:36:52,538 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 03:36:52,538 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 03:36:52,538 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 03:36:52,538 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 03:36:52,538 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 03:36:52,538 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 03:36:52,539 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 03:36:52,539 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 03:36:52,540 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 03:36:52,540 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 03:36:52,540 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 03:36:52,540 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 03:36:52,540 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 03:36:52,540 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 03:36:52,540 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 03:36:52,541 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 03:36:52,541 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 03:36:52,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 03:36:52,541 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 03:36:52,541 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 03:36:52,541 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 03:36:52,541 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 03:36:52,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 03:36:52,542 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 03:36:52,542 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 03:36:52,542 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 03:36:52,542 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 03:36:52,542 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 03:36:52,543 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 03:36:52,543 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 03:36:52,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 03:36:52,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 03:36:52,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 03:36:52,793 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 03:36:52,793 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 03:36:52,794 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label46.c [2022-01-11 03:36:52,852 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eec432f9/9d304018ba304bd396ca61673119db64/FLAGff5b37578 [2022-01-11 03:36:53,304 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 03:36:53,304 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label46.c [2022-01-11 03:36:53,315 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eec432f9/9d304018ba304bd396ca61673119db64/FLAGff5b37578 [2022-01-11 03:36:53,637 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eec432f9/9d304018ba304bd396ca61673119db64 [2022-01-11 03:36:53,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 03:36:53,640 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 03:36:53,641 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 03:36:53,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 03:36:53,649 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 03:36:53,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 03:36:53" (1/1) ... [2022-01-11 03:36:53,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79936ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:36:53, skipping insertion in model container [2022-01-11 03:36:53,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 03:36:53" (1/1) ... [2022-01-11 03:36:53,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 03:36:53,714 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 03:36:54,037 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/Problem02_label46.c[18150,18163] [2022-01-11 03:36:54,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 03:36:54,075 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 03:36:54,124 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/Problem02_label46.c[18150,18163] [2022-01-11 03:36:54,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 03:36:54,146 INFO L208 MainTranslator]: Completed translation [2022-01-11 03:36:54,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:36:54 WrapperNode [2022-01-11 03:36:54,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 03:36:54,148 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 03:36:54,148 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 03:36:54,148 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 03:36:54,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:36:54" (1/1) ... [2022-01-11 03:36:54,179 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:36:54" (1/1) ... [2022-01-11 03:36:54,242 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 666 [2022-01-11 03:36:54,243 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 03:36:54,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 03:36:54,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 03:36:54,251 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 03:36:54,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:36:54" (1/1) ... [2022-01-11 03:36:54,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:36:54" (1/1) ... [2022-01-11 03:36:54,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:36:54" (1/1) ... [2022-01-11 03:36:54,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:36:54" (1/1) ... [2022-01-11 03:36:54,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:36:54" (1/1) ... [2022-01-11 03:36:54,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:36:54" (1/1) ... [2022-01-11 03:36:54,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:36:54" (1/1) ... [2022-01-11 03:36:54,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 03:36:54,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 03:36:54,305 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 03:36:54,305 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 03:36:54,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:36:54" (1/1) ... [2022-01-11 03:36:54,312 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 03:36:54,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:36:54,365 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 03:36:54,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 03:36:54,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 03:36:54,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 03:36:54,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 03:36:54,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 03:36:54,473 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 03:36:54,474 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 03:36:55,394 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 03:36:55,406 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 03:36:55,407 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-11 03:36:55,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:36:55 BoogieIcfgContainer [2022-01-11 03:36:55,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 03:36:55,411 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 03:36:55,412 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 03:36:55,413 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 03:36:55,415 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:36:55" (1/1) ... [2022-01-11 03:36:55,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 03:36:55 BasicIcfg [2022-01-11 03:36:55,669 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 03:36:55,671 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 03:36:55,671 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 03:36:55,674 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 03:36:55,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 03:36:53" (1/4) ... [2022-01-11 03:36:55,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e7f82b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 03:36:55, skipping insertion in model container [2022-01-11 03:36:55,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:36:54" (2/4) ... [2022-01-11 03:36:55,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e7f82b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 03:36:55, skipping insertion in model container [2022-01-11 03:36:55,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:36:55" (3/4) ... [2022-01-11 03:36:55,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e7f82b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 03:36:55, skipping insertion in model container [2022-01-11 03:36:55,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 03:36:55" (4/4) ... [2022-01-11 03:36:55,678 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem02_label46.cTransformedIcfg [2022-01-11 03:36:55,683 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 03:36:55,683 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 03:36:55,740 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 03:36:55,751 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 03:36:55,751 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 03:36:55,770 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:55,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-11 03:36:55,782 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:36:55,783 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] [2022-01-11 03:36:55,783 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:36:55,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:36:55,788 INFO L85 PathProgramCache]: Analyzing trace with hash -352490928, now seen corresponding path program 1 times [2022-01-11 03:36:55,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:36:55,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425824838] [2022-01-11 03:36:55,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:36:55,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:36:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:36:56,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:36:56,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:36:56,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425824838] [2022-01-11 03:36:56,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425824838] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:36:56,283 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:36:56,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 03:36:56,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014186079] [2022-01-11 03:36:56,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:36:56,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:36:56,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:36:56,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:36:56,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:36:56,316 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 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 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:57,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:36:57,108 INFO L93 Difference]: Finished difference Result 630 states and 1070 transitions. [2022-01-11 03:36:57,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:36:57,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2022-01-11 03:36:57,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:36:57,121 INFO L225 Difference]: With dead ends: 630 [2022-01-11 03:36:57,121 INFO L226 Difference]: Without dead ends: 318 [2022-01-11 03:36:57,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:36:57,128 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 118 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-11 03:36:57,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 119 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-11 03:36:57,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-01-11 03:36:57,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2022-01-11 03:36:57,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 1.473186119873817) internal successors, (467), 317 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 467 transitions. [2022-01-11 03:36:57,192 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 467 transitions. Word has length 112 [2022-01-11 03:36:57,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:36:57,193 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 467 transitions. [2022-01-11 03:36:57,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:57,193 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 467 transitions. [2022-01-11 03:36:57,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-01-11 03:36:57,196 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:36:57,196 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] [2022-01-11 03:36:57,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 03:36:57,196 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:36:57,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:36:57,197 INFO L85 PathProgramCache]: Analyzing trace with hash 806022453, now seen corresponding path program 1 times [2022-01-11 03:36:57,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:36:57,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152845782] [2022-01-11 03:36:57,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:36:57,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:36:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:36:57,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:36:57,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:36:57,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152845782] [2022-01-11 03:36:57,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152845782] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:36:57,523 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:36:57,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:36:57,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555921794] [2022-01-11 03:36:57,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:36:57,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:36:57,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:36:57,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:36:57,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:36:57,527 INFO L87 Difference]: Start difference. First operand 318 states and 467 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:58,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:36:58,353 INFO L93 Difference]: Finished difference Result 999 states and 1508 transitions. [2022-01-11 03:36:58,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:36:58,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2022-01-11 03:36:58,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:36:58,357 INFO L225 Difference]: With dead ends: 999 [2022-01-11 03:36:58,358 INFO L226 Difference]: Without dead ends: 600 [2022-01-11 03:36:58,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:36:58,360 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 173 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-11 03:36:58,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 113 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-11 03:36:58,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2022-01-11 03:36:58,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2022-01-11 03:36:58,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.358931552587646) internal successors, (814), 599 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:58,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 814 transitions. [2022-01-11 03:36:58,407 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 814 transitions. Word has length 116 [2022-01-11 03:36:58,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:36:58,409 INFO L470 AbstractCegarLoop]: Abstraction has 600 states and 814 transitions. [2022-01-11 03:36:58,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:58,410 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 814 transitions. [2022-01-11 03:36:58,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-01-11 03:36:58,419 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:36:58,419 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1] [2022-01-11 03:36:58,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 03:36:58,420 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:36:58,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:36:58,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1772190396, now seen corresponding path program 1 times [2022-01-11 03:36:58,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:36:58,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635303420] [2022-01-11 03:36:58,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:36:58,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:36:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:36:58,544 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:36:58,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:36:58,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635303420] [2022-01-11 03:36:58,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635303420] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:36:58,545 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:36:58,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 03:36:58,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9958929] [2022-01-11 03:36:58,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:36:58,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:36:58,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:36:58,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:36:58,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:36:58,547 INFO L87 Difference]: Start difference. First operand 600 states and 814 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:59,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:36:59,068 INFO L93 Difference]: Finished difference Result 1764 states and 2397 transitions. [2022-01-11 03:36:59,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:36:59,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2022-01-11 03:36:59,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:36:59,075 INFO L225 Difference]: With dead ends: 1764 [2022-01-11 03:36:59,075 INFO L226 Difference]: Without dead ends: 1166 [2022-01-11 03:36:59,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:36:59,078 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 130 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-11 03:36:59,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 130 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-11 03:36:59,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2022-01-11 03:36:59,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1164. [2022-01-11 03:36:59,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 1163 states have (on average 1.2149613069647462) internal successors, (1413), 1163 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:59,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1413 transitions. [2022-01-11 03:36:59,105 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1413 transitions. Word has length 130 [2022-01-11 03:36:59,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:36:59,105 INFO L470 AbstractCegarLoop]: Abstraction has 1164 states and 1413 transitions. [2022-01-11 03:36:59,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:59,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1413 transitions. [2022-01-11 03:36:59,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-01-11 03:36:59,108 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:36:59,108 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1] [2022-01-11 03:36:59,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 03:36:59,109 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:36:59,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:36:59,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1200575771, now seen corresponding path program 1 times [2022-01-11 03:36:59,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:36:59,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284004250] [2022-01-11 03:36:59,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:36:59,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:36:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:36:59,172 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:36:59,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:36:59,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284004250] [2022-01-11 03:36:59,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284004250] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:36:59,173 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:36:59,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:36:59,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189412955] [2022-01-11 03:36:59,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:36:59,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:36:59,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:36:59,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:36:59,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:36:59,175 INFO L87 Difference]: Start difference. First operand 1164 states and 1413 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:59,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:36:59,728 INFO L93 Difference]: Finished difference Result 2890 states and 3593 transitions. [2022-01-11 03:36:59,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:36:59,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2022-01-11 03:36:59,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:36:59,735 INFO L225 Difference]: With dead ends: 2890 [2022-01-11 03:36:59,735 INFO L226 Difference]: Without dead ends: 1728 [2022-01-11 03:36:59,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:36:59,738 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 167 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-11 03:36:59,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 53 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-11 03:36:59,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2022-01-11 03:36:59,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1724. [2022-01-11 03:36:59,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1724 states, 1723 states have (on average 1.2385374347069065) internal successors, (2134), 1723 states have internal predecessors, (2134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:59,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2134 transitions. [2022-01-11 03:36:59,767 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2134 transitions. Word has length 135 [2022-01-11 03:36:59,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:36:59,768 INFO L470 AbstractCegarLoop]: Abstraction has 1724 states and 2134 transitions. [2022-01-11 03:36:59,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:36:59,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2134 transitions. [2022-01-11 03:36:59,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-01-11 03:36:59,771 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:36:59,771 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:36:59,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 03:36:59,771 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:36:59,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:36:59,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1913406433, now seen corresponding path program 1 times [2022-01-11 03:36:59,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:36:59,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827425166] [2022-01-11 03:36:59,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:36:59,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:36:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:36:59,916 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 03:36:59,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:36:59,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827425166] [2022-01-11 03:36:59,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827425166] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:36:59,917 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:36:59,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:36:59,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431410285] [2022-01-11 03:36:59,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:36:59,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:36:59,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:36:59,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:36:59,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:36:59,919 INFO L87 Difference]: Start difference. First operand 1724 states and 2134 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:00,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:37:00,437 INFO L93 Difference]: Finished difference Result 4165 states and 5188 transitions. [2022-01-11 03:37:00,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:37:00,437 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 139 [2022-01-11 03:37:00,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:37:00,449 INFO L225 Difference]: With dead ends: 4165 [2022-01-11 03:37:00,449 INFO L226 Difference]: Without dead ends: 2443 [2022-01-11 03:37:00,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:37:00,460 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 54 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-11 03:37:00,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 256 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-11 03:37:00,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2443 states. [2022-01-11 03:37:00,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2443 to 2303. [2022-01-11 03:37:00,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2303 states, 2302 states have (on average 1.2063423110338836) internal successors, (2777), 2302 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:00,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 2777 transitions. [2022-01-11 03:37:00,507 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 2777 transitions. Word has length 139 [2022-01-11 03:37:00,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:37:00,509 INFO L470 AbstractCegarLoop]: Abstraction has 2303 states and 2777 transitions. [2022-01-11 03:37:00,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:00,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 2777 transitions. [2022-01-11 03:37:00,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-01-11 03:37:00,520 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:37:00,520 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:37:00,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 03:37:00,521 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:37:00,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:37:00,522 INFO L85 PathProgramCache]: Analyzing trace with hash -428948007, now seen corresponding path program 1 times [2022-01-11 03:37:00,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:37:00,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317389148] [2022-01-11 03:37:00,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:37:00,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:37:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:37:00,604 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 03:37:00,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:37:00,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317389148] [2022-01-11 03:37:00,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317389148] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:37:00,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:37:00,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:37:00,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115146274] [2022-01-11 03:37:00,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:37:00,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:37:00,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:37:00,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:37:00,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:37:00,607 INFO L87 Difference]: Start difference. First operand 2303 states and 2777 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:01,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:37:01,123 INFO L93 Difference]: Finished difference Result 5304 states and 6427 transitions. [2022-01-11 03:37:01,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:37:01,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2022-01-11 03:37:01,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:37:01,131 INFO L225 Difference]: With dead ends: 5304 [2022-01-11 03:37:01,131 INFO L226 Difference]: Without dead ends: 2012 [2022-01-11 03:37:01,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:37:01,136 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 130 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-11 03:37:01,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 276 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-11 03:37:01,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2012 states. [2022-01-11 03:37:01,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2012 to 2012. [2022-01-11 03:37:01,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2012 states, 2011 states have (on average 1.1476877175534559) internal successors, (2308), 2011 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:01,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 2308 transitions. [2022-01-11 03:37:01,188 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 2308 transitions. Word has length 155 [2022-01-11 03:37:01,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:37:01,188 INFO L470 AbstractCegarLoop]: Abstraction has 2012 states and 2308 transitions. [2022-01-11 03:37:01,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:01,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 2308 transitions. [2022-01-11 03:37:01,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-01-11 03:37:01,193 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:37:01,193 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:37:01,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 03:37:01,193 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:37:01,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:37:01,194 INFO L85 PathProgramCache]: Analyzing trace with hash -789659511, now seen corresponding path program 1 times [2022-01-11 03:37:01,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:37:01,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277342763] [2022-01-11 03:37:01,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:37:01,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:37:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:37:01,282 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-11 03:37:01,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:37:01,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277342763] [2022-01-11 03:37:01,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277342763] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:37:01,283 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:37:01,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:37:01,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251146343] [2022-01-11 03:37:01,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:37:01,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:37:01,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:37:01,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:37:01,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:37:01,285 INFO L87 Difference]: Start difference. First operand 2012 states and 2308 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:01,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:37:01,751 INFO L93 Difference]: Finished difference Result 5716 states and 6588 transitions. [2022-01-11 03:37:01,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:37:01,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 169 [2022-01-11 03:37:01,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:37:01,765 INFO L225 Difference]: With dead ends: 5716 [2022-01-11 03:37:01,765 INFO L226 Difference]: Without dead ends: 3705 [2022-01-11 03:37:01,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:37:01,772 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 129 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:37:01,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 101 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:37:01,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3705 states. [2022-01-11 03:37:01,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3705 to 3275. [2022-01-11 03:37:01,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3275 states, 3274 states have (on average 1.1505803298717165) internal successors, (3767), 3274 states have internal predecessors, (3767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:01,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 3275 states and 3767 transitions. [2022-01-11 03:37:01,837 INFO L78 Accepts]: Start accepts. Automaton has 3275 states and 3767 transitions. Word has length 169 [2022-01-11 03:37:01,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:37:01,838 INFO L470 AbstractCegarLoop]: Abstraction has 3275 states and 3767 transitions. [2022-01-11 03:37:01,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:01,838 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 3767 transitions. [2022-01-11 03:37:01,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-01-11 03:37:01,843 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:37:01,843 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-11 03:37:01,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 03:37:01,844 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:37:01,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:37:01,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1988453587, now seen corresponding path program 1 times [2022-01-11 03:37:01,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:37:01,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947252090] [2022-01-11 03:37:01,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:37:01,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:37:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:37:01,957 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-11 03:37:01,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:37:01,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947252090] [2022-01-11 03:37:01,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947252090] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:37:01,958 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:37:01,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:37:01,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094461255] [2022-01-11 03:37:01,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:37:01,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:37:01,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:37:01,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:37:01,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:37:01,959 INFO L87 Difference]: Start difference. First operand 3275 states and 3767 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:02,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:37:02,402 INFO L93 Difference]: Finished difference Result 6693 states and 7650 transitions. [2022-01-11 03:37:02,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:37:02,403 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 172 [2022-01-11 03:37:02,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:37:02,413 INFO L225 Difference]: With dead ends: 6693 [2022-01-11 03:37:02,413 INFO L226 Difference]: Without dead ends: 3140 [2022-01-11 03:37:02,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:37:02,418 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 140 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:37:02,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 238 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:37:02,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3140 states. [2022-01-11 03:37:02,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3140 to 2847. [2022-01-11 03:37:02,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2847 states, 2846 states have (on average 1.112789880534083) internal successors, (3167), 2846 states have internal predecessors, (3167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:02,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2847 states to 2847 states and 3167 transitions. [2022-01-11 03:37:02,467 INFO L78 Accepts]: Start accepts. Automaton has 2847 states and 3167 transitions. Word has length 172 [2022-01-11 03:37:02,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:37:02,468 INFO L470 AbstractCegarLoop]: Abstraction has 2847 states and 3167 transitions. [2022-01-11 03:37:02,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:02,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2847 states and 3167 transitions. [2022-01-11 03:37:02,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-01-11 03:37:02,473 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:37:02,473 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:37:02,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 03:37:02,474 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:37:02,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:37:02,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1226675942, now seen corresponding path program 1 times [2022-01-11 03:37:02,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:37:02,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254188524] [2022-01-11 03:37:02,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:37:02,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:37:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:37:02,597 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-01-11 03:37:02,597 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:37:02,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254188524] [2022-01-11 03:37:02,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254188524] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:37:02,597 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:37:02,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:37:02,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274936814] [2022-01-11 03:37:02,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:37:02,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 03:37:02,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:37:02,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 03:37:02,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:37:02,599 INFO L87 Difference]: Start difference. First operand 2847 states and 3167 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:03,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:37:03,426 INFO L93 Difference]: Finished difference Result 5746 states and 6386 transitions. [2022-01-11 03:37:03,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 03:37:03,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 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 181 [2022-01-11 03:37:03,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:37:03,436 INFO L225 Difference]: With dead ends: 5746 [2022-01-11 03:37:03,436 INFO L226 Difference]: Without dead ends: 2901 [2022-01-11 03:37:03,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-11 03:37:03,440 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 413 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-11 03:37:03,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [413 Valid, 95 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-11 03:37:03,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2022-01-11 03:37:03,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 2847. [2022-01-11 03:37:03,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2847 states, 2846 states have (on average 1.1036542515811665) internal successors, (3141), 2846 states have internal predecessors, (3141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:03,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2847 states to 2847 states and 3141 transitions. [2022-01-11 03:37:03,504 INFO L78 Accepts]: Start accepts. Automaton has 2847 states and 3141 transitions. Word has length 181 [2022-01-11 03:37:03,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:37:03,505 INFO L470 AbstractCegarLoop]: Abstraction has 2847 states and 3141 transitions. [2022-01-11 03:37:03,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:03,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2847 states and 3141 transitions. [2022-01-11 03:37:03,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-11 03:37:03,511 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:37:03,512 INFO L514 BasicCegarLoop]: trace histogram [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, 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] [2022-01-11 03:37:03,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 03:37:03,512 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:37:03,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:37:03,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1954593302, now seen corresponding path program 1 times [2022-01-11 03:37:03,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:37:03,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359487932] [2022-01-11 03:37:03,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:37:03,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:37:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:37:03,698 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 03:37:03,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:37:03,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359487932] [2022-01-11 03:37:03,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359487932] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:37:03,699 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:37:03,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:37:03,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91466972] [2022-01-11 03:37:03,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:37:03,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:37:03,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:37:03,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:37:03,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:37:03,701 INFO L87 Difference]: Start difference. First operand 2847 states and 3141 transitions. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:04,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:37:04,318 INFO L93 Difference]: Finished difference Result 5778 states and 6384 transitions. [2022-01-11 03:37:04,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:37:04,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 186 [2022-01-11 03:37:04,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:37:04,325 INFO L225 Difference]: With dead ends: 5778 [2022-01-11 03:37:04,325 INFO L226 Difference]: Without dead ends: 2847 [2022-01-11 03:37:04,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:37:04,329 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 104 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-11 03:37:04,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 75 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-11 03:37:04,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2847 states. [2022-01-11 03:37:04,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2847 to 2847. [2022-01-11 03:37:04,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2847 states, 2846 states have (on average 1.1022487702037949) internal successors, (3137), 2846 states have internal predecessors, (3137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2847 states to 2847 states and 3137 transitions. [2022-01-11 03:37:04,375 INFO L78 Accepts]: Start accepts. Automaton has 2847 states and 3137 transitions. Word has length 186 [2022-01-11 03:37:04,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:37:04,375 INFO L470 AbstractCegarLoop]: Abstraction has 2847 states and 3137 transitions. [2022-01-11 03:37:04,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2847 states and 3137 transitions. [2022-01-11 03:37:04,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-01-11 03:37:04,381 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:37:04,381 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-11 03:37:04,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 03:37:04,381 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:37:04,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:37:04,382 INFO L85 PathProgramCache]: Analyzing trace with hash 664461041, now seen corresponding path program 1 times [2022-01-11 03:37:04,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:37:04,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735543672] [2022-01-11 03:37:04,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:37:04,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:37:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:37:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-01-11 03:37:04,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:37:04,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735543672] [2022-01-11 03:37:04,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735543672] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:37:04,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:37:04,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:37:04,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460534873] [2022-01-11 03:37:04,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:37:04,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:37:04,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:37:04,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:37:04,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:37:04,475 INFO L87 Difference]: Start difference. First operand 2847 states and 3137 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:04,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:37:04,937 INFO L93 Difference]: Finished difference Result 6816 states and 7578 transitions. [2022-01-11 03:37:04,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:37:04,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 202 [2022-01-11 03:37:04,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:37:04,950 INFO L225 Difference]: With dead ends: 6816 [2022-01-11 03:37:04,951 INFO L226 Difference]: Without dead ends: 3971 [2022-01-11 03:37:04,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:37:04,955 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 133 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 03:37:04,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 201 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-11 03:37:04,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3971 states. [2022-01-11 03:37:05,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3971 to 3969. [2022-01-11 03:37:05,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3969 states, 3968 states have (on average 1.1008064516129032) internal successors, (4368), 3968 states have internal predecessors, (4368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:05,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3969 states to 3969 states and 4368 transitions. [2022-01-11 03:37:05,024 INFO L78 Accepts]: Start accepts. Automaton has 3969 states and 4368 transitions. Word has length 202 [2022-01-11 03:37:05,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:37:05,024 INFO L470 AbstractCegarLoop]: Abstraction has 3969 states and 4368 transitions. [2022-01-11 03:37:05,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:05,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3969 states and 4368 transitions. [2022-01-11 03:37:05,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-01-11 03:37:05,031 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:37:05,031 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 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, 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] [2022-01-11 03:37:05,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 03:37:05,031 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:37:05,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:37:05,032 INFO L85 PathProgramCache]: Analyzing trace with hash 331489964, now seen corresponding path program 1 times [2022-01-11 03:37:05,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:37:05,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951330508] [2022-01-11 03:37:05,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:37:05,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:37:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:37:05,183 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-01-11 03:37:05,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:37:05,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951330508] [2022-01-11 03:37:05,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951330508] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:37:05,184 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:37:05,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:37:05,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195613024] [2022-01-11 03:37:05,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:37:05,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 03:37:05,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:37:05,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 03:37:05,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:37:05,186 INFO L87 Difference]: Start difference. First operand 3969 states and 4368 transitions. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:05,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:37:05,984 INFO L93 Difference]: Finished difference Result 6315 states and 6856 transitions. [2022-01-11 03:37:05,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 03:37:05,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 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 225 [2022-01-11 03:37:05,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:37:06,000 INFO L225 Difference]: With dead ends: 6315 [2022-01-11 03:37:06,001 INFO L226 Difference]: Without dead ends: 3619 [2022-01-11 03:37:06,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-11 03:37:06,005 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 343 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-11 03:37:06,006 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 94 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-11 03:37:06,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3619 states. [2022-01-11 03:37:06,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3619 to 3547. [2022-01-11 03:37:06,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3547 states, 3546 states have (on average 1.0645798082346305) internal successors, (3775), 3546 states have internal predecessors, (3775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:06,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3547 states to 3547 states and 3775 transitions. [2022-01-11 03:37:06,082 INFO L78 Accepts]: Start accepts. Automaton has 3547 states and 3775 transitions. Word has length 225 [2022-01-11 03:37:06,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:37:06,082 INFO L470 AbstractCegarLoop]: Abstraction has 3547 states and 3775 transitions. [2022-01-11 03:37:06,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:06,084 INFO L276 IsEmpty]: Start isEmpty. Operand 3547 states and 3775 transitions. [2022-01-11 03:37:06,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-01-11 03:37:06,090 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:37:06,090 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:37:06,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 03:37:06,090 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:37:06,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:37:06,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1785315811, now seen corresponding path program 1 times [2022-01-11 03:37:06,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:37:06,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552243389] [2022-01-11 03:37:06,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:37:06,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:37:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:37:06,216 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-01-11 03:37:06,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:37:06,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552243389] [2022-01-11 03:37:06,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552243389] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:37:06,217 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:37:06,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:37:06,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850413912] [2022-01-11 03:37:06,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:37:06,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:37:06,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:37:06,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:37:06,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:37:06,218 INFO L87 Difference]: Start difference. First operand 3547 states and 3775 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:06,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:37:06,596 INFO L93 Difference]: Finished difference Result 5530 states and 5842 transitions. [2022-01-11 03:37:06,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:37:06,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 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 240 [2022-01-11 03:37:06,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:37:06,605 INFO L225 Difference]: With dead ends: 5530 [2022-01-11 03:37:06,605 INFO L226 Difference]: Without dead ends: 1985 [2022-01-11 03:37:06,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:37:06,610 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 148 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 03:37:06,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 44 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-11 03:37:06,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2022-01-11 03:37:06,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1845. [2022-01-11 03:37:06,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1845 states, 1844 states have (on average 1.0368763557483731) internal successors, (1912), 1844 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 1912 transitions. [2022-01-11 03:37:06,637 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 1912 transitions. Word has length 240 [2022-01-11 03:37:06,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:37:06,637 INFO L470 AbstractCegarLoop]: Abstraction has 1845 states and 1912 transitions. [2022-01-11 03:37:06,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:06,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 1912 transitions. [2022-01-11 03:37:06,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-01-11 03:37:06,642 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:37:06,643 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-11 03:37:06,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 03:37:06,643 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:37:06,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:37:06,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1539137918, now seen corresponding path program 1 times [2022-01-11 03:37:06,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:37:06,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784431331] [2022-01-11 03:37:06,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:37:06,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:37:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:37:06,772 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-01-11 03:37:06,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:37:06,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784431331] [2022-01-11 03:37:06,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784431331] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:37:06,773 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:37:06,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:37:06,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098829381] [2022-01-11 03:37:06,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:37:06,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:37:06,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:37:06,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:37:06,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:37:06,774 INFO L87 Difference]: Start difference. First operand 1845 states and 1912 transitions. Second operand has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:07,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:37:07,267 INFO L93 Difference]: Finished difference Result 3545 states and 3671 transitions. [2022-01-11 03:37:07,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 03:37:07,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 0 states have call successors, (0), 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 283 [2022-01-11 03:37:07,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:37:07,270 INFO L225 Difference]: With dead ends: 3545 [2022-01-11 03:37:07,271 INFO L226 Difference]: Without dead ends: 2128 [2022-01-11 03:37:07,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:37:07,273 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 258 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-11 03:37:07,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 219 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-11 03:37:07,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2128 states. [2022-01-11 03:37:07,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2128 to 1845. [2022-01-11 03:37:07,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1845 states, 1844 states have (on average 1.0309110629067244) internal successors, (1901), 1844 states have internal predecessors, (1901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:07,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 1901 transitions. [2022-01-11 03:37:07,301 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 1901 transitions. Word has length 283 [2022-01-11 03:37:07,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:37:07,301 INFO L470 AbstractCegarLoop]: Abstraction has 1845 states and 1901 transitions. [2022-01-11 03:37:07,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:07,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 1901 transitions. [2022-01-11 03:37:07,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2022-01-11 03:37:07,307 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:37:07,307 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 4, 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] [2022-01-11 03:37:07,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 03:37:07,308 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:37:07,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:37:07,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1711187566, now seen corresponding path program 1 times [2022-01-11 03:37:07,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:37:07,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959698395] [2022-01-11 03:37:07,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:37:07,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:37:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:37:07,494 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-01-11 03:37:07,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:37:07,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959698395] [2022-01-11 03:37:07,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959698395] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:37:07,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:37:07,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:37:07,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100897560] [2022-01-11 03:37:07,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:37:07,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:37:07,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:37:07,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:37:07,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:37:07,496 INFO L87 Difference]: Start difference. First operand 1845 states and 1901 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:07,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:37:07,838 INFO L93 Difference]: Finished difference Result 1985 states and 2043 transitions. [2022-01-11 03:37:07,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:37:07,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 315 [2022-01-11 03:37:07,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:37:07,839 INFO L225 Difference]: With dead ends: 1985 [2022-01-11 03:37:07,839 INFO L226 Difference]: Without dead ends: 0 [2022-01-11 03:37:07,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:37:07,841 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 128 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 03:37:07,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 189 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-11 03:37:07,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-11 03:37:07,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-11 03:37:07,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:07,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-11 03:37:07,842 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 315 [2022-01-11 03:37:07,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:37:07,843 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-11 03:37:07,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:37:07,843 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-11 03:37:07,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-11 03:37:07,845 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-11 03:37:07,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 03:37:07,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-11 03:37:09,356 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-11 03:37:09,356 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-11 03:37:09,357 INFO L854 garLoopResultBuilder]: At program point L616-2(lines 616 626) the Hoare annotation is: (let ((.cse10 (= ~a11~0Int 1)) (.cse8 (= ~a25~0Int 1))) (let ((.cse5 (<= 10 ~a28~0Int)) (.cse2 (<= ~a19~0Int 0)) (.cse0 (not .cse8)) (.cse3 (<= ~a28~0Int 7)) (.cse1 (= ~a11~0Int 0)) (.cse7 (<= ~a28~0Int 10)) (.cse12 (= 9 ~a28~0Int)) (.cse4 (= ~a21~0Int 1)) (.cse6 (= ~a17~0Int 8)) (.cse11 (not .cse10)) (.cse9 (= ~a19~0Int 1))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse3 .cse8 .cse9) (and .cse0 .cse4 .cse6 .cse11 .cse7 (= ~a28~0Int 10) .cse9) (and .cse10 .cse3 .cse2) (and .cse4 .cse6 .cse1 .cse3 .cse9) (and .cse5 .cse1 .cse2) (and .cse10 .cse0 .cse12 .cse4 .cse6 (<= ~a25~0Int 0) .cse7 .cse9) (<= ~a17~0Int 7) (and .cse1 .cse7 .cse8 .cse9) (and .cse4 .cse6 .cse3 .cse8 .cse9) (and (<= 9 ~a28~0Int) .cse4 .cse6 .cse1 .cse7 .cse9) (and .cse10 .cse12 .cse4 .cse6 .cse8 .cse9) (and .cse4 .cse6 (not (= |ULTIMATE.start_ULTIMATE.start_calculate_output_~input#1Int| 3)) .cse11 (= ~a28~0Int 11) .cse8 .cse9)))) [2022-01-11 03:37:09,357 INFO L861 garLoopResultBuilder]: At program point L610(lines 610 627) the Hoare annotation is: true [2022-01-11 03:37:09,357 INFO L858 garLoopResultBuilder]: For program point L621(line 621) no Hoare annotation was computed. [2022-01-11 03:37:09,358 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-11 03:37:09,359 INFO L858 garLoopResultBuilder]: For program point L40(lines 40 423) no Hoare annotation was computed. [2022-01-11 03:37:09,359 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-11 03:37:09,359 INFO L854 garLoopResultBuilder]: At program point L607(lines 39 608) the Hoare annotation is: (let ((.cse10 (= ~a11~0Int 1)) (.cse8 (= ~a25~0Int 1))) (let ((.cse5 (<= 10 ~a28~0Int)) (.cse2 (<= ~a19~0Int 0)) (.cse0 (not .cse8)) (.cse3 (<= ~a28~0Int 7)) (.cse1 (= ~a11~0Int 0)) (.cse7 (<= ~a28~0Int 10)) (.cse12 (= 9 ~a28~0Int)) (.cse4 (= ~a21~0Int 1)) (.cse6 (= ~a17~0Int 8)) (.cse11 (not .cse10)) (.cse9 (= ~a19~0Int 1))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse3 .cse8 .cse9) (and .cse0 .cse4 .cse6 .cse11 .cse7 (= ~a28~0Int 10) .cse9) (and .cse10 .cse3 .cse2) (and .cse4 .cse6 .cse1 .cse3 .cse9) (and .cse5 .cse1 .cse2) (and .cse10 .cse0 .cse12 .cse4 .cse6 (<= ~a25~0Int 0) .cse7 .cse9) (<= ~a17~0Int 7) (and .cse1 .cse7 .cse8 .cse9) (and .cse4 .cse6 .cse3 .cse8 .cse9) (and (<= 9 ~a28~0Int) .cse4 .cse6 .cse1 .cse7 .cse9) (and .cse10 .cse12 .cse4 .cse6 .cse8 .cse9) (and .cse4 .cse6 (not (= |ULTIMATE.start_ULTIMATE.start_calculate_output_~input#1Int| 3)) .cse11 (= ~a28~0Int 11) .cse8 .cse9)))) [2022-01-11 03:37:09,359 INFO L858 garLoopResultBuilder]: For program point L45(lines 45 423) no Hoare annotation was computed. [2022-01-11 03:37:09,359 INFO L858 garLoopResultBuilder]: For program point L48(lines 48 423) no Hoare annotation was computed. [2022-01-11 03:37:09,359 INFO L858 garLoopResultBuilder]: For program point L52(lines 52 423) no Hoare annotation was computed. [2022-01-11 03:37:09,359 INFO L858 garLoopResultBuilder]: For program point L57(lines 57 423) no Hoare annotation was computed. [2022-01-11 03:37:09,360 INFO L858 garLoopResultBuilder]: For program point L60(lines 60 423) no Hoare annotation was computed. [2022-01-11 03:37:09,360 INFO L858 garLoopResultBuilder]: For program point L64(lines 64 423) no Hoare annotation was computed. [2022-01-11 03:37:09,360 INFO L858 garLoopResultBuilder]: For program point L69(lines 69 423) no Hoare annotation was computed. [2022-01-11 03:37:09,360 INFO L858 garLoopResultBuilder]: For program point L75(lines 75 423) no Hoare annotation was computed. [2022-01-11 03:37:09,360 INFO L858 garLoopResultBuilder]: For program point L79(lines 79 423) no Hoare annotation was computed. [2022-01-11 03:37:09,360 INFO L858 garLoopResultBuilder]: For program point L84(lines 84 423) no Hoare annotation was computed. [2022-01-11 03:37:09,360 INFO L858 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2022-01-11 03:37:09,360 INFO L858 garLoopResultBuilder]: For program point L92(lines 92 423) no Hoare annotation was computed. [2022-01-11 03:37:09,360 INFO L858 garLoopResultBuilder]: For program point L85-2(lines 85 90) no Hoare annotation was computed. [2022-01-11 03:37:09,360 INFO L858 garLoopResultBuilder]: For program point L93(lines 93 99) no Hoare annotation was computed. [2022-01-11 03:37:09,360 INFO L858 garLoopResultBuilder]: For program point L101(lines 101 423) no Hoare annotation was computed. [2022-01-11 03:37:09,360 INFO L858 garLoopResultBuilder]: For program point L93-2(lines 93 99) no Hoare annotation was computed. [2022-01-11 03:37:09,360 INFO L858 garLoopResultBuilder]: For program point L105(lines 105 423) no Hoare annotation was computed. [2022-01-11 03:37:09,360 INFO L858 garLoopResultBuilder]: For program point L109(lines 109 423) no Hoare annotation was computed. [2022-01-11 03:37:09,360 INFO L858 garLoopResultBuilder]: For program point L116(lines 116 423) no Hoare annotation was computed. [2022-01-11 03:37:09,360 INFO L858 garLoopResultBuilder]: For program point L123(lines 123 423) no Hoare annotation was computed. [2022-01-11 03:37:09,361 INFO L858 garLoopResultBuilder]: For program point L129(lines 129 423) no Hoare annotation was computed. [2022-01-11 03:37:09,361 INFO L858 garLoopResultBuilder]: For program point L133(lines 133 423) no Hoare annotation was computed. [2022-01-11 03:37:09,361 INFO L858 garLoopResultBuilder]: For program point L140(lines 140 423) no Hoare annotation was computed. [2022-01-11 03:37:09,361 INFO L858 garLoopResultBuilder]: For program point L144(lines 144 423) no Hoare annotation was computed. [2022-01-11 03:37:09,361 INFO L858 garLoopResultBuilder]: For program point L149(lines 149 423) no Hoare annotation was computed. [2022-01-11 03:37:09,361 INFO L858 garLoopResultBuilder]: For program point L153(lines 153 423) no Hoare annotation was computed. [2022-01-11 03:37:09,361 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 423) no Hoare annotation was computed. [2022-01-11 03:37:09,361 INFO L858 garLoopResultBuilder]: For program point L164(lines 164 423) no Hoare annotation was computed. [2022-01-11 03:37:09,361 INFO L858 garLoopResultBuilder]: For program point L169(lines 169 423) no Hoare annotation was computed. [2022-01-11 03:37:09,361 INFO L858 garLoopResultBuilder]: For program point L175(lines 175 423) no Hoare annotation was computed. [2022-01-11 03:37:09,361 INFO L858 garLoopResultBuilder]: For program point L179(lines 179 423) no Hoare annotation was computed. [2022-01-11 03:37:09,361 INFO L858 garLoopResultBuilder]: For program point L185(lines 185 423) no Hoare annotation was computed. [2022-01-11 03:37:09,361 INFO L858 garLoopResultBuilder]: For program point L189(lines 189 423) no Hoare annotation was computed. [2022-01-11 03:37:09,361 INFO L858 garLoopResultBuilder]: For program point L195(lines 195 423) no Hoare annotation was computed. [2022-01-11 03:37:09,361 INFO L858 garLoopResultBuilder]: For program point L197(lines 197 423) no Hoare annotation was computed. [2022-01-11 03:37:09,362 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 423) no Hoare annotation was computed. [2022-01-11 03:37:09,362 INFO L858 garLoopResultBuilder]: For program point L201(lines 201 423) no Hoare annotation was computed. [2022-01-11 03:37:09,362 INFO L858 garLoopResultBuilder]: For program point L204(lines 204 423) no Hoare annotation was computed. [2022-01-11 03:37:09,362 INFO L858 garLoopResultBuilder]: For program point L208(lines 208 423) no Hoare annotation was computed. [2022-01-11 03:37:09,362 INFO L858 garLoopResultBuilder]: For program point L212(lines 212 423) no Hoare annotation was computed. [2022-01-11 03:37:09,362 INFO L858 garLoopResultBuilder]: For program point L213(lines 213 220) no Hoare annotation was computed. [2022-01-11 03:37:09,362 INFO L858 garLoopResultBuilder]: For program point L222(lines 222 423) no Hoare annotation was computed. [2022-01-11 03:37:09,362 INFO L858 garLoopResultBuilder]: For program point L213-2(lines 213 220) no Hoare annotation was computed. [2022-01-11 03:37:09,362 INFO L858 garLoopResultBuilder]: For program point L225(lines 225 423) no Hoare annotation was computed. [2022-01-11 03:37:09,362 INFO L858 garLoopResultBuilder]: For program point L228(lines 228 423) no Hoare annotation was computed. [2022-01-11 03:37:09,362 INFO L858 garLoopResultBuilder]: For program point L233(lines 233 423) no Hoare annotation was computed. [2022-01-11 03:37:09,362 INFO L858 garLoopResultBuilder]: For program point L235(lines 235 423) no Hoare annotation was computed. [2022-01-11 03:37:09,362 INFO L858 garLoopResultBuilder]: For program point L242(lines 242 423) no Hoare annotation was computed. [2022-01-11 03:37:09,362 INFO L858 garLoopResultBuilder]: For program point L244(lines 244 423) no Hoare annotation was computed. [2022-01-11 03:37:09,362 INFO L858 garLoopResultBuilder]: For program point L247(lines 247 423) no Hoare annotation was computed. [2022-01-11 03:37:09,362 INFO L858 garLoopResultBuilder]: For program point L248(lines 248 256) no Hoare annotation was computed. [2022-01-11 03:37:09,363 INFO L858 garLoopResultBuilder]: For program point L258(lines 258 423) no Hoare annotation was computed. [2022-01-11 03:37:09,363 INFO L858 garLoopResultBuilder]: For program point L248-2(lines 248 256) no Hoare annotation was computed. [2022-01-11 03:37:09,363 INFO L858 garLoopResultBuilder]: For program point L263(lines 263 423) no Hoare annotation was computed. [2022-01-11 03:37:09,363 INFO L858 garLoopResultBuilder]: For program point L269(lines 269 423) no Hoare annotation was computed. [2022-01-11 03:37:09,363 INFO L858 garLoopResultBuilder]: For program point L271(lines 271 423) no Hoare annotation was computed. [2022-01-11 03:37:09,363 INFO L858 garLoopResultBuilder]: For program point L272(lines 272 284) no Hoare annotation was computed. [2022-01-11 03:37:09,363 INFO L858 garLoopResultBuilder]: For program point L286(lines 286 423) no Hoare annotation was computed. [2022-01-11 03:37:09,363 INFO L858 garLoopResultBuilder]: For program point L272-2(lines 272 284) no Hoare annotation was computed. [2022-01-11 03:37:09,363 INFO L858 garLoopResultBuilder]: For program point L290(lines 290 423) no Hoare annotation was computed. [2022-01-11 03:37:09,363 INFO L858 garLoopResultBuilder]: For program point L293(lines 293 423) no Hoare annotation was computed. [2022-01-11 03:37:09,363 INFO L858 garLoopResultBuilder]: For program point L296(lines 296 423) no Hoare annotation was computed. [2022-01-11 03:37:09,363 INFO L858 garLoopResultBuilder]: For program point L301(lines 301 423) no Hoare annotation was computed. [2022-01-11 03:37:09,364 INFO L858 garLoopResultBuilder]: For program point L303(lines 303 423) no Hoare annotation was computed. [2022-01-11 03:37:09,364 INFO L858 garLoopResultBuilder]: For program point L307(lines 307 423) no Hoare annotation was computed. [2022-01-11 03:37:09,364 INFO L858 garLoopResultBuilder]: For program point L308(lines 308 317) no Hoare annotation was computed. [2022-01-11 03:37:09,364 INFO L858 garLoopResultBuilder]: For program point L319(lines 319 423) no Hoare annotation was computed. [2022-01-11 03:37:09,364 INFO L858 garLoopResultBuilder]: For program point L308-2(lines 308 317) no Hoare annotation was computed. [2022-01-11 03:37:09,364 INFO L858 garLoopResultBuilder]: For program point L324(lines 324 423) no Hoare annotation was computed. [2022-01-11 03:37:09,364 INFO L858 garLoopResultBuilder]: For program point L325(lines 325 336) no Hoare annotation was computed. [2022-01-11 03:37:09,364 INFO L858 garLoopResultBuilder]: For program point L338(lines 338 423) no Hoare annotation was computed. [2022-01-11 03:37:09,364 INFO L858 garLoopResultBuilder]: For program point L325-2(lines 325 336) no Hoare annotation was computed. [2022-01-11 03:37:09,364 INFO L858 garLoopResultBuilder]: For program point L341(lines 341 423) no Hoare annotation was computed. [2022-01-11 03:37:09,364 INFO L858 garLoopResultBuilder]: For program point L342(lines 342 345) no Hoare annotation was computed. [2022-01-11 03:37:09,364 INFO L858 garLoopResultBuilder]: For program point L347(lines 347 423) no Hoare annotation was computed. [2022-01-11 03:37:09,364 INFO L858 garLoopResultBuilder]: For program point L342-2(lines 342 345) no Hoare annotation was computed. [2022-01-11 03:37:09,365 INFO L858 garLoopResultBuilder]: For program point L348(lines 348 357) no Hoare annotation was computed. [2022-01-11 03:37:09,365 INFO L858 garLoopResultBuilder]: For program point L359(lines 359 423) no Hoare annotation was computed. [2022-01-11 03:37:09,365 INFO L858 garLoopResultBuilder]: For program point L348-2(lines 348 357) no Hoare annotation was computed. [2022-01-11 03:37:09,365 INFO L858 garLoopResultBuilder]: For program point L364(lines 364 423) no Hoare annotation was computed. [2022-01-11 03:37:09,365 INFO L858 garLoopResultBuilder]: For program point L371(lines 371 423) no Hoare annotation was computed. [2022-01-11 03:37:09,365 INFO L858 garLoopResultBuilder]: For program point L378(lines 378 423) no Hoare annotation was computed. [2022-01-11 03:37:09,365 INFO L858 garLoopResultBuilder]: For program point L385(lines 385 423) no Hoare annotation was computed. [2022-01-11 03:37:09,365 INFO L858 garLoopResultBuilder]: For program point L388(lines 388 423) no Hoare annotation was computed. [2022-01-11 03:37:09,365 INFO L858 garLoopResultBuilder]: For program point L390(lines 390 423) no Hoare annotation was computed. [2022-01-11 03:37:09,365 INFO L858 garLoopResultBuilder]: For program point L391(lines 391 397) no Hoare annotation was computed. [2022-01-11 03:37:09,365 INFO L858 garLoopResultBuilder]: For program point L399(lines 399 423) no Hoare annotation was computed. [2022-01-11 03:37:09,365 INFO L858 garLoopResultBuilder]: For program point L391-2(lines 391 397) no Hoare annotation was computed. [2022-01-11 03:37:09,365 INFO L858 garLoopResultBuilder]: For program point L404(lines 404 423) no Hoare annotation was computed. [2022-01-11 03:37:09,366 INFO L858 garLoopResultBuilder]: For program point L408(lines 408 423) no Hoare annotation was computed. [2022-01-11 03:37:09,366 INFO L858 garLoopResultBuilder]: For program point L412(lines 412 423) no Hoare annotation was computed. [2022-01-11 03:37:09,366 INFO L858 garLoopResultBuilder]: For program point L414(lines 414 423) no Hoare annotation was computed. [2022-01-11 03:37:09,366 INFO L858 garLoopResultBuilder]: For program point L417(lines 417 423) no Hoare annotation was computed. [2022-01-11 03:37:09,366 INFO L858 garLoopResultBuilder]: For program point L419(lines 419 423) no Hoare annotation was computed. [2022-01-11 03:37:09,366 INFO L858 garLoopResultBuilder]: For program point L424(lines 424 426) no Hoare annotation was computed. [2022-01-11 03:37:09,366 INFO L858 garLoopResultBuilder]: For program point L425(line 425) no Hoare annotation was computed. [2022-01-11 03:37:09,366 INFO L858 garLoopResultBuilder]: For program point L424-2(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,366 INFO L858 garLoopResultBuilder]: For program point L428(line 428) no Hoare annotation was computed. [2022-01-11 03:37:09,366 INFO L858 garLoopResultBuilder]: For program point L427-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,366 INFO L858 garLoopResultBuilder]: For program point L431(line 431) no Hoare annotation was computed. [2022-01-11 03:37:09,366 INFO L858 garLoopResultBuilder]: For program point L430-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,366 INFO L858 garLoopResultBuilder]: For program point L434(line 434) no Hoare annotation was computed. [2022-01-11 03:37:09,366 INFO L858 garLoopResultBuilder]: For program point L433-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,367 INFO L858 garLoopResultBuilder]: For program point L437(line 437) no Hoare annotation was computed. [2022-01-11 03:37:09,367 INFO L858 garLoopResultBuilder]: For program point L436-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,367 INFO L858 garLoopResultBuilder]: For program point L440(line 440) no Hoare annotation was computed. [2022-01-11 03:37:09,367 INFO L858 garLoopResultBuilder]: For program point L439-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,367 INFO L858 garLoopResultBuilder]: For program point L443(line 443) no Hoare annotation was computed. [2022-01-11 03:37:09,367 INFO L858 garLoopResultBuilder]: For program point L442-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,367 INFO L858 garLoopResultBuilder]: For program point L446(line 446) no Hoare annotation was computed. [2022-01-11 03:37:09,367 INFO L858 garLoopResultBuilder]: For program point L445-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,367 INFO L858 garLoopResultBuilder]: For program point L449(line 449) no Hoare annotation was computed. [2022-01-11 03:37:09,367 INFO L858 garLoopResultBuilder]: For program point L448-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,367 INFO L858 garLoopResultBuilder]: For program point L452(line 452) no Hoare annotation was computed. [2022-01-11 03:37:09,367 INFO L858 garLoopResultBuilder]: For program point L451-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,367 INFO L858 garLoopResultBuilder]: For program point L455(line 455) no Hoare annotation was computed. [2022-01-11 03:37:09,368 INFO L858 garLoopResultBuilder]: For program point L454-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,368 INFO L858 garLoopResultBuilder]: For program point L458(line 458) no Hoare annotation was computed. [2022-01-11 03:37:09,368 INFO L858 garLoopResultBuilder]: For program point L457-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,368 INFO L858 garLoopResultBuilder]: For program point L461(line 461) no Hoare annotation was computed. [2022-01-11 03:37:09,368 INFO L858 garLoopResultBuilder]: For program point L460-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,368 INFO L858 garLoopResultBuilder]: For program point L464(line 464) no Hoare annotation was computed. [2022-01-11 03:37:09,368 INFO L858 garLoopResultBuilder]: For program point L463-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,368 INFO L858 garLoopResultBuilder]: For program point L467(line 467) no Hoare annotation was computed. [2022-01-11 03:37:09,368 INFO L858 garLoopResultBuilder]: For program point L466-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,368 INFO L858 garLoopResultBuilder]: For program point L470(line 470) no Hoare annotation was computed. [2022-01-11 03:37:09,368 INFO L858 garLoopResultBuilder]: For program point L469-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,368 INFO L858 garLoopResultBuilder]: For program point L473(line 473) no Hoare annotation was computed. [2022-01-11 03:37:09,368 INFO L858 garLoopResultBuilder]: For program point L472-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,368 INFO L858 garLoopResultBuilder]: For program point L476(line 476) no Hoare annotation was computed. [2022-01-11 03:37:09,368 INFO L858 garLoopResultBuilder]: For program point L475-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,369 INFO L858 garLoopResultBuilder]: For program point L479(line 479) no Hoare annotation was computed. [2022-01-11 03:37:09,369 INFO L858 garLoopResultBuilder]: For program point L478-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,369 INFO L858 garLoopResultBuilder]: For program point L482(line 482) no Hoare annotation was computed. [2022-01-11 03:37:09,369 INFO L858 garLoopResultBuilder]: For program point L481-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,369 INFO L858 garLoopResultBuilder]: For program point L485(line 485) no Hoare annotation was computed. [2022-01-11 03:37:09,369 INFO L858 garLoopResultBuilder]: For program point L484-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,369 INFO L858 garLoopResultBuilder]: For program point L488(line 488) no Hoare annotation was computed. [2022-01-11 03:37:09,369 INFO L858 garLoopResultBuilder]: For program point L487-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,369 INFO L858 garLoopResultBuilder]: For program point L491(line 491) no Hoare annotation was computed. [2022-01-11 03:37:09,369 INFO L858 garLoopResultBuilder]: For program point L490-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,369 INFO L858 garLoopResultBuilder]: For program point L494(line 494) no Hoare annotation was computed. [2022-01-11 03:37:09,369 INFO L858 garLoopResultBuilder]: For program point L493-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,369 INFO L858 garLoopResultBuilder]: For program point L497(line 497) no Hoare annotation was computed. [2022-01-11 03:37:09,370 INFO L858 garLoopResultBuilder]: For program point L496-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,370 INFO L858 garLoopResultBuilder]: For program point L500(line 500) no Hoare annotation was computed. [2022-01-11 03:37:09,370 INFO L858 garLoopResultBuilder]: For program point L499-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,370 INFO L858 garLoopResultBuilder]: For program point L503(line 503) no Hoare annotation was computed. [2022-01-11 03:37:09,370 INFO L858 garLoopResultBuilder]: For program point L502-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,370 INFO L858 garLoopResultBuilder]: For program point L506(line 506) no Hoare annotation was computed. [2022-01-11 03:37:09,370 INFO L858 garLoopResultBuilder]: For program point L505-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,370 INFO L858 garLoopResultBuilder]: For program point L509(line 509) no Hoare annotation was computed. [2022-01-11 03:37:09,370 INFO L858 garLoopResultBuilder]: For program point L508-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,370 INFO L858 garLoopResultBuilder]: For program point L512(line 512) no Hoare annotation was computed. [2022-01-11 03:37:09,370 INFO L858 garLoopResultBuilder]: For program point L511-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,370 INFO L858 garLoopResultBuilder]: For program point L515(line 515) no Hoare annotation was computed. [2022-01-11 03:37:09,370 INFO L858 garLoopResultBuilder]: For program point L514-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,371 INFO L858 garLoopResultBuilder]: For program point L518(line 518) no Hoare annotation was computed. [2022-01-11 03:37:09,371 INFO L858 garLoopResultBuilder]: For program point L517-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,371 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 518) no Hoare annotation was computed. [2022-01-11 03:37:09,371 INFO L858 garLoopResultBuilder]: For program point L521(line 521) no Hoare annotation was computed. [2022-01-11 03:37:09,371 INFO L858 garLoopResultBuilder]: For program point L520-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,371 INFO L858 garLoopResultBuilder]: For program point L524(line 524) no Hoare annotation was computed. [2022-01-11 03:37:09,371 INFO L858 garLoopResultBuilder]: For program point L523-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,371 INFO L858 garLoopResultBuilder]: For program point L527(line 527) no Hoare annotation was computed. [2022-01-11 03:37:09,371 INFO L858 garLoopResultBuilder]: For program point L526-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,371 INFO L858 garLoopResultBuilder]: For program point L530(line 530) no Hoare annotation was computed. [2022-01-11 03:37:09,371 INFO L858 garLoopResultBuilder]: For program point L529-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,371 INFO L858 garLoopResultBuilder]: For program point L533(line 533) no Hoare annotation was computed. [2022-01-11 03:37:09,372 INFO L858 garLoopResultBuilder]: For program point L532-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,372 INFO L858 garLoopResultBuilder]: For program point L536(line 536) no Hoare annotation was computed. [2022-01-11 03:37:09,372 INFO L858 garLoopResultBuilder]: For program point L535-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,372 INFO L858 garLoopResultBuilder]: For program point L539(line 539) no Hoare annotation was computed. [2022-01-11 03:37:09,372 INFO L858 garLoopResultBuilder]: For program point L538-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,372 INFO L858 garLoopResultBuilder]: For program point L542(line 542) no Hoare annotation was computed. [2022-01-11 03:37:09,372 INFO L858 garLoopResultBuilder]: For program point L541-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,372 INFO L858 garLoopResultBuilder]: For program point L545(line 545) no Hoare annotation was computed. [2022-01-11 03:37:09,372 INFO L858 garLoopResultBuilder]: For program point L544-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,372 INFO L858 garLoopResultBuilder]: For program point L548(line 548) no Hoare annotation was computed. [2022-01-11 03:37:09,372 INFO L858 garLoopResultBuilder]: For program point L547-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,372 INFO L858 garLoopResultBuilder]: For program point L551(line 551) no Hoare annotation was computed. [2022-01-11 03:37:09,372 INFO L858 garLoopResultBuilder]: For program point L550-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,372 INFO L858 garLoopResultBuilder]: For program point L554(line 554) no Hoare annotation was computed. [2022-01-11 03:37:09,373 INFO L858 garLoopResultBuilder]: For program point L553-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,373 INFO L858 garLoopResultBuilder]: For program point L557(line 557) no Hoare annotation was computed. [2022-01-11 03:37:09,373 INFO L858 garLoopResultBuilder]: For program point L556-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,373 INFO L858 garLoopResultBuilder]: For program point L560(line 560) no Hoare annotation was computed. [2022-01-11 03:37:09,373 INFO L858 garLoopResultBuilder]: For program point L559-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,373 INFO L858 garLoopResultBuilder]: For program point L563(line 563) no Hoare annotation was computed. [2022-01-11 03:37:09,373 INFO L858 garLoopResultBuilder]: For program point L562-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,373 INFO L858 garLoopResultBuilder]: For program point L566(line 566) no Hoare annotation was computed. [2022-01-11 03:37:09,373 INFO L858 garLoopResultBuilder]: For program point L565-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,373 INFO L858 garLoopResultBuilder]: For program point L569(line 569) no Hoare annotation was computed. [2022-01-11 03:37:09,373 INFO L858 garLoopResultBuilder]: For program point L568-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,373 INFO L858 garLoopResultBuilder]: For program point L572(line 572) no Hoare annotation was computed. [2022-01-11 03:37:09,374 INFO L858 garLoopResultBuilder]: For program point L571-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,374 INFO L858 garLoopResultBuilder]: For program point L575(line 575) no Hoare annotation was computed. [2022-01-11 03:37:09,374 INFO L858 garLoopResultBuilder]: For program point L574-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,374 INFO L858 garLoopResultBuilder]: For program point L578(line 578) no Hoare annotation was computed. [2022-01-11 03:37:09,374 INFO L858 garLoopResultBuilder]: For program point L577-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,374 INFO L858 garLoopResultBuilder]: For program point L581(line 581) no Hoare annotation was computed. [2022-01-11 03:37:09,374 INFO L858 garLoopResultBuilder]: For program point L580-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,374 INFO L858 garLoopResultBuilder]: For program point L584(line 584) no Hoare annotation was computed. [2022-01-11 03:37:09,374 INFO L858 garLoopResultBuilder]: For program point L583-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,374 INFO L858 garLoopResultBuilder]: For program point L587(line 587) no Hoare annotation was computed. [2022-01-11 03:37:09,374 INFO L858 garLoopResultBuilder]: For program point L586-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,374 INFO L858 garLoopResultBuilder]: For program point L590(line 590) no Hoare annotation was computed. [2022-01-11 03:37:09,374 INFO L858 garLoopResultBuilder]: For program point L589-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,374 INFO L858 garLoopResultBuilder]: For program point L593(line 593) no Hoare annotation was computed. [2022-01-11 03:37:09,374 INFO L858 garLoopResultBuilder]: For program point L592-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,375 INFO L858 garLoopResultBuilder]: For program point L596(line 596) no Hoare annotation was computed. [2022-01-11 03:37:09,375 INFO L858 garLoopResultBuilder]: For program point L595-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,375 INFO L858 garLoopResultBuilder]: For program point L599(line 599) no Hoare annotation was computed. [2022-01-11 03:37:09,375 INFO L858 garLoopResultBuilder]: For program point L598-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,375 INFO L858 garLoopResultBuilder]: For program point L602(line 602) no Hoare annotation was computed. [2022-01-11 03:37:09,375 INFO L858 garLoopResultBuilder]: For program point L601-1(lines 39 608) no Hoare annotation was computed. [2022-01-11 03:37:09,375 INFO L858 garLoopResultBuilder]: For program point L605(line 605) no Hoare annotation was computed. [2022-01-11 03:37:09,375 INFO L858 garLoopResultBuilder]: For program point L604-1(lines 604 606) no Hoare annotation was computed. [2022-01-11 03:37:09,378 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:37:09,379 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 03:37:09,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 03:37:09 BasicIcfg [2022-01-11 03:37:09,408 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 03:37:09,408 INFO L158 Benchmark]: Toolchain (without parser) took 15767.98ms. Allocated memory was 169.9MB in the beginning and 346.0MB in the end (delta: 176.2MB). Free memory was 111.1MB in the beginning and 111.6MB in the end (delta: -485.5kB). Peak memory consumption was 184.8MB. Max. memory is 8.0GB. [2022-01-11 03:37:09,408 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 169.9MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 03:37:09,409 INFO L158 Benchmark]: CACSL2BoogieTranslator took 505.60ms. Allocated memory was 169.9MB in the beginning and 237.0MB in the end (delta: 67.1MB). Free memory was 110.9MB in the beginning and 191.4MB in the end (delta: -80.6MB). Peak memory consumption was 7.8MB. Max. memory is 8.0GB. [2022-01-11 03:37:09,409 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.83ms. Allocated memory is still 237.0MB. Free memory was 191.4MB in the beginning and 186.2MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-11 03:37:09,409 INFO L158 Benchmark]: Boogie Preprocessor took 53.11ms. Allocated memory is still 237.0MB. Free memory was 186.2MB in the beginning and 182.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-11 03:37:09,409 INFO L158 Benchmark]: RCFGBuilder took 1106.12ms. Allocated memory is still 237.0MB. Free memory was 182.0MB in the beginning and 124.3MB in the end (delta: 57.7MB). Peak memory consumption was 57.7MB. Max. memory is 8.0GB. [2022-01-11 03:37:09,410 INFO L158 Benchmark]: IcfgTransformer took 257.32ms. Allocated memory is still 237.0MB. Free memory was 124.3MB in the beginning and 90.8MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-01-11 03:37:09,410 INFO L158 Benchmark]: TraceAbstraction took 13736.83ms. Allocated memory was 237.0MB in the beginning and 346.0MB in the end (delta: 109.1MB). Free memory was 90.2MB in the beginning and 111.6MB in the end (delta: -21.3MB). Peak memory consumption was 97.7MB. Max. memory is 8.0GB. [2022-01-11 03:37:09,412 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 169.9MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 505.60ms. Allocated memory was 169.9MB in the beginning and 237.0MB in the end (delta: 67.1MB). Free memory was 110.9MB in the beginning and 191.4MB in the end (delta: -80.6MB). Peak memory consumption was 7.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 94.83ms. Allocated memory is still 237.0MB. Free memory was 191.4MB in the beginning and 186.2MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.11ms. Allocated memory is still 237.0MB. Free memory was 186.2MB in the beginning and 182.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1106.12ms. Allocated memory is still 237.0MB. Free memory was 182.0MB in the beginning and 124.3MB in the end (delta: 57.7MB). Peak memory consumption was 57.7MB. Max. memory is 8.0GB. * IcfgTransformer took 257.32ms. Allocated memory is still 237.0MB. Free memory was 124.3MB in the beginning and 90.8MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 13736.83ms. Allocated memory was 237.0MB in the beginning and 346.0MB in the end (delta: 109.1MB). Free memory was 90.2MB in the beginning and 111.6MB in the end (delta: -21.3MB). Peak memory consumption was 97.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 518]: 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, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.6s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2568 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2568 mSDsluCounter, 2203 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 328 mSDsCounter, 1043 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6968 IncrementalHoareTripleChecker+Invalid, 8011 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1043 mSolverCounterUnsat, 1875 mSDtfsCounter, 6968 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3969occurred in iteration=11, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 1420 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 67 NumberOfFragments, 469 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1654 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 4618 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2760 NumberOfCodeBlocks, 2760 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2745 ConstructedInterpolants, 0 QuantifiedInterpolants, 10656 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 1960/1960 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: 616]: Loop Invariant Derived loop invariant: ((((((((((((((((((((1bv32 == a11 && 1bv32 == a19) && ~bvule32(a25, 0bv32)) && ~bvule32(a28, 10bv32)) && a28 == 9bv32) && !(1bv32 == a25)) && 1bv32 == a21) && 8bv32 == a17) || ((0bv32 == a11 && ~bvule32(a19, 0bv32)) && !(1bv32 == a25))) || ((((((!(3bv32 == input) && 1bv32 == a25) && !(1bv32 == a11)) && 1bv32 == a19) && 11bv32 == a28) && 1bv32 == a21) && 8bv32 == a17)) || ((1bv32 == a11 && ~bvule32(a19, 0bv32)) && ~bvule32(a28, 7bv32))) || (((((~bvule32(10bv32, a28) && 1bv32 == a25) && 1bv32 == a19) && ~bvule32(a28, 10bv32)) && 1bv32 == a21) && 8bv32 == a17)) || (((1bv32 == a25 && 1bv32 == a19) && 0bv32 == a11) && ~bvule32(a28, 10bv32))) || ((0bv32 == a11 && ~bvule32(a19, 0bv32)) && ~bvule32(a28, 7bv32))) || (((((1bv32 == a11 && 1bv32 == a25) && 1bv32 == a19) && a28 == 9bv32) && 1bv32 == a21) && 8bv32 == a17)) || ~bvule32(a17, 7bv32)) || (((((1bv32 == a19 && 0bv32 == a11) && ~bvule32(a28, 10bv32)) && ~bvule32(9bv32, a28)) && 1bv32 == a21) && 8bv32 == a17)) || (((1bv32 == a11 && 1bv32 == a25) && 1bv32 == a19) && ~bvule32(a28, 7bv32))) || ((~bvule32(10bv32, a28) && 0bv32 == a11) && ~bvule32(a19, 0bv32))) || ((((1bv32 == a19 && 0bv32 == a11) && ~bvule32(a28, 7bv32)) && 1bv32 == a21) && 8bv32 == a17)) || ((((1bv32 == a25 && 1bv32 == a19) && ~bvule32(a28, 7bv32)) && 1bv32 == a21) && 8bv32 == a17)) || ((((((!(1bv32 == a11) && 1bv32 == a19) && 10bv32 == a28) && ~bvule32(a28, 10bv32)) && !(1bv32 == a25)) && 1bv32 == a21) && 8bv32 == a17) - InvariantResult [Line: 610]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ((((((((((((((((((((1bv32 == a11 && 1bv32 == a19) && ~bvule32(a25, 0bv32)) && ~bvule32(a28, 10bv32)) && a28 == 9bv32) && !(1bv32 == a25)) && 1bv32 == a21) && 8bv32 == a17) || ((0bv32 == a11 && ~bvule32(a19, 0bv32)) && !(1bv32 == a25))) || ((((((!(3bv32 == input) && 1bv32 == a25) && !(1bv32 == a11)) && 1bv32 == a19) && 11bv32 == a28) && 1bv32 == a21) && 8bv32 == a17)) || ((1bv32 == a11 && ~bvule32(a19, 0bv32)) && ~bvule32(a28, 7bv32))) || (((((~bvule32(10bv32, a28) && 1bv32 == a25) && 1bv32 == a19) && ~bvule32(a28, 10bv32)) && 1bv32 == a21) && 8bv32 == a17)) || (((1bv32 == a25 && 1bv32 == a19) && 0bv32 == a11) && ~bvule32(a28, 10bv32))) || ((0bv32 == a11 && ~bvule32(a19, 0bv32)) && ~bvule32(a28, 7bv32))) || (((((1bv32 == a11 && 1bv32 == a25) && 1bv32 == a19) && a28 == 9bv32) && 1bv32 == a21) && 8bv32 == a17)) || ~bvule32(a17, 7bv32)) || (((((1bv32 == a19 && 0bv32 == a11) && ~bvule32(a28, 10bv32)) && ~bvule32(9bv32, a28)) && 1bv32 == a21) && 8bv32 == a17)) || (((1bv32 == a11 && 1bv32 == a25) && 1bv32 == a19) && ~bvule32(a28, 7bv32))) || ((~bvule32(10bv32, a28) && 0bv32 == a11) && ~bvule32(a19, 0bv32))) || ((((1bv32 == a19 && 0bv32 == a11) && ~bvule32(a28, 7bv32)) && 1bv32 == a21) && 8bv32 == a17)) || ((((1bv32 == a25 && 1bv32 == a19) && ~bvule32(a28, 7bv32)) && 1bv32 == a21) && 8bv32 == a17)) || ((((((!(1bv32 == a11) && 1bv32 == a19) && 10bv32 == a28) && ~bvule32(a28, 10bv32)) && !(1bv32 == a25)) && 1bv32 == a21) && 8bv32 == a17) RESULT: Ultimate proved your program to be correct! [2022-01-11 03:37:09,455 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...