/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/ldv-regression/rule60_list2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 05:20:04,362 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 05:20:04,363 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 05:20:04,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 05:20:04,390 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 05:20:04,391 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 05:20:04,392 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 05:20:04,393 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 05:20:04,394 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 05:20:04,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 05:20:04,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 05:20:04,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 05:20:04,396 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 05:20:04,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 05:20:04,397 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 05:20:04,398 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 05:20:04,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 05:20:04,399 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 05:20:04,400 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 05:20:04,401 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 05:20:04,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 05:20:04,403 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 05:20:04,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 05:20:04,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 05:20:04,406 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 05:20:04,406 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 05:20:04,407 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 05:20:04,407 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 05:20:04,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 05:20:04,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 05:20:04,408 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 05:20:04,409 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 05:20:04,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 05:20:04,410 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 05:20:04,410 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 05:20:04,410 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 05:20:04,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 05:20:04,411 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 05:20:04,411 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 05:20:04,412 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 05:20:04,412 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 05:20:04,413 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 05:20:04,471 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 05:20:04,472 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 05:20:04,472 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 05:20:04,472 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 05:20:04,474 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 05:20:04,474 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 05:20:04,474 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 05:20:04,474 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 05:20:04,474 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 05:20:04,474 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 05:20:04,474 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 05:20:04,474 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 05:20:04,475 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 05:20:04,475 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 05:20:04,475 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 05:20:04,475 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 05:20:04,475 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 05:20:04,475 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 05:20:04,475 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 05:20:04,475 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 05:20:04,475 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 05:20:04,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:20:04,476 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 05:20:04,476 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 05:20:04,476 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 05:20:04,476 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 05:20:04,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 05:20:04,476 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 05:20:04,476 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 05:20:04,476 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 05:20:04,476 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 05:20:04,476 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 05:20:04,477 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 05:20:04,477 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 05:20:04,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 05:20:04,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 05:20:04,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 05:20:04,633 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 05:20:04,633 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 05:20:04,634 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/rule60_list2.i [2022-01-11 05:20:04,693 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b69aab316/767167e4b5d74193993d821e44459475/FLAG5e326391b [2022-01-11 05:20:05,055 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 05:20:05,055 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list2.i [2022-01-11 05:20:05,063 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b69aab316/767167e4b5d74193993d821e44459475/FLAG5e326391b [2022-01-11 05:20:05,495 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b69aab316/767167e4b5d74193993d821e44459475 [2022-01-11 05:20:05,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 05:20:05,504 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 05:20:05,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 05:20:05,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 05:20:05,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 05:20:05,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:20:05" (1/1) ... [2022-01-11 05:20:05,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dbd3d90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:20:05, skipping insertion in model container [2022-01-11 05:20:05,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:20:05" (1/1) ... [2022-01-11 05:20:05,529 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 05:20:05,575 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 05:20:05,748 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list2.i[292,305] [2022-01-11 05:20:05,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:20:05,884 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 05:20:05,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list2.i[292,305] [2022-01-11 05:20:05,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:20:05,962 INFO L208 MainTranslator]: Completed translation [2022-01-11 05:20:05,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:20:05 WrapperNode [2022-01-11 05:20:05,963 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 05:20:05,964 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 05:20:05,964 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 05:20:05,964 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 05:20:05,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:20:05" (1/1) ... [2022-01-11 05:20:05,994 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:20:05" (1/1) ... [2022-01-11 05:20:06,018 INFO L137 Inliner]: procedures = 127, calls = 19, calls flagged for inlining = 11, calls inlined = 15, statements flattened = 110 [2022-01-11 05:20:06,018 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 05:20:06,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 05:20:06,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 05:20:06,019 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 05:20:06,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:20:05" (1/1) ... [2022-01-11 05:20:06,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:20:05" (1/1) ... [2022-01-11 05:20:06,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:20:05" (1/1) ... [2022-01-11 05:20:06,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:20:05" (1/1) ... [2022-01-11 05:20:06,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:20:05" (1/1) ... [2022-01-11 05:20:06,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:20:05" (1/1) ... [2022-01-11 05:20:06,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:20:05" (1/1) ... [2022-01-11 05:20:06,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 05:20:06,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 05:20:06,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 05:20:06,056 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 05:20:06,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:20:05" (1/1) ... [2022-01-11 05:20:06,079 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:20:06,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:20:06,111 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 05:20:06,119 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 05:20:06,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 05:20:06,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-11 05:20:06,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 05:20:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 05:20:06,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 05:20:06,329 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 05:20:06,331 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 05:20:06,638 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 05:20:06,643 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 05:20:06,643 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-11 05:20:06,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:20:06 BoogieIcfgContainer [2022-01-11 05:20:06,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 05:20:06,645 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 05:20:06,645 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 05:20:06,652 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 05:20:06,658 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:20:06" (1/1) ... [2022-01-11 05:20:06,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:20:06 BasicIcfg [2022-01-11 05:20:06,814 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 05:20:06,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 05:20:06,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 05:20:06,828 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 05:20:06,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 05:20:05" (1/4) ... [2022-01-11 05:20:06,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404779ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:20:06, skipping insertion in model container [2022-01-11 05:20:06,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:20:05" (2/4) ... [2022-01-11 05:20:06,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404779ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:20:06, skipping insertion in model container [2022-01-11 05:20:06,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:20:06" (3/4) ... [2022-01-11 05:20:06,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404779ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 05:20:06, skipping insertion in model container [2022-01-11 05:20:06,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:20:06" (4/4) ... [2022-01-11 05:20:06,840 INFO L111 eAbstractionObserver]: Analyzing ICFG rule60_list2.iTransformedIcfg [2022-01-11 05:20:06,847 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 05:20:06,847 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2022-01-11 05:20:06,895 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 05:20:06,902 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 05:20:06,902 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-11 05:20:06,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 42 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:20:06,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-01-11 05:20:06,927 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:20:06,927 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-01-11 05:20:06,928 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 05:20:06,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:20:06,933 INFO L85 PathProgramCache]: Analyzing trace with hash 4495524, now seen corresponding path program 1 times [2022-01-11 05:20:06,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:20:06,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227364117] [2022-01-11 05:20:06,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:20:06,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:20:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:20:07,301 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 05:20:07,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:20:07,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227364117] [2022-01-11 05:20:07,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227364117] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:20:07,315 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:20:07,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:20:07,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386166857] [2022-01-11 05:20:07,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:20:07,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 05:20:07,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:20:07,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 05:20:07,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:20:07,370 INFO L87 Difference]: Start difference. First operand has 43 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 42 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 05:20:07,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:20:07,411 INFO L93 Difference]: Finished difference Result 74 states and 95 transitions. [2022-01-11 05:20:07,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 05:20:07,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-01-11 05:20:07,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:20:07,418 INFO L225 Difference]: With dead ends: 74 [2022-01-11 05:20:07,418 INFO L226 Difference]: Without dead ends: 28 [2022-01-11 05:20:07,420 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 05:20:07,428 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 37 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:20:07,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 39 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:20:07,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-11 05:20:07,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-01-11 05:20:07,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 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 05:20:07,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-01-11 05:20:07,455 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 4 [2022-01-11 05:20:07,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:20:07,456 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-01-11 05:20:07,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 05:20:07,456 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-01-11 05:20:07,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-11 05:20:07,457 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:20:07,457 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:20:07,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 05:20:07,457 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 05:20:07,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:20:07,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1798453922, now seen corresponding path program 1 times [2022-01-11 05:20:07,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:20:07,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379621609] [2022-01-11 05:20:07,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:20:07,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:20:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:20:07,628 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 05:20:07,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:20:07,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379621609] [2022-01-11 05:20:07,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379621609] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:20:07,629 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:20:07,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 05:20:07,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341233903] [2022-01-11 05:20:07,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:20:07,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 05:20:07,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:20:07,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 05:20:07,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 05:20:07,631 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:20:07,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:20:07,711 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-01-11 05:20:07,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 05:20:07,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-11 05:20:07,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:20:07,712 INFO L225 Difference]: With dead ends: 48 [2022-01-11 05:20:07,712 INFO L226 Difference]: Without dead ends: 30 [2022-01-11 05:20:07,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 05:20:07,716 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:20:07,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 103 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:20:07,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-11 05:20:07,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-01-11 05:20:07,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 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 05:20:07,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-01-11 05:20:07,724 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 15 [2022-01-11 05:20:07,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:20:07,724 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-01-11 05:20:07,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:20:07,725 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-01-11 05:20:07,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-11 05:20:07,726 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:20:07,727 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:20:07,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 05:20:07,732 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 05:20:07,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:20:07,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1827083073, now seen corresponding path program 1 times [2022-01-11 05:20:07,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:20:07,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251689970] [2022-01-11 05:20:07,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:20:07,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:20:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:20:07,883 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 05:20:07,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:20:07,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251689970] [2022-01-11 05:20:07,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251689970] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:20:07,884 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:20:07,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-11 05:20:07,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657386255] [2022-01-11 05:20:07,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:20:07,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-11 05:20:07,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:20:07,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-11 05:20:07,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-11 05:20:07,886 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:20:07,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:20:07,999 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-01-11 05:20:07,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 05:20:07,999 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-11 05:20:08,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:20:08,000 INFO L225 Difference]: With dead ends: 39 [2022-01-11 05:20:08,000 INFO L226 Difference]: Without dead ends: 37 [2022-01-11 05:20:08,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-01-11 05:20:08,001 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 67 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:20:08,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 62 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:20:08,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-11 05:20:08,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2022-01-11 05:20:08,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 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 05:20:08,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-01-11 05:20:08,005 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 15 [2022-01-11 05:20:08,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:20:08,005 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-01-11 05:20:08,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:20:08,005 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-01-11 05:20:08,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-11 05:20:08,005 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:20:08,005 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:20:08,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 05:20:08,006 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 05:20:08,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:20:08,006 INFO L85 PathProgramCache]: Analyzing trace with hash 510479318, now seen corresponding path program 1 times [2022-01-11 05:20:08,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:20:08,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381785739] [2022-01-11 05:20:08,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:20:08,007 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:20:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:20:08,067 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 05:20:08,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:20:08,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381785739] [2022-01-11 05:20:08,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381785739] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:20:08,067 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:20:08,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 05:20:08,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822921468] [2022-01-11 05:20:08,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:20:08,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 05:20:08,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:20:08,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 05:20:08,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 05:20:08,069 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:20:08,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:20:08,091 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-01-11 05:20:08,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 05:20:08,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-11 05:20:08,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:20:08,092 INFO L225 Difference]: With dead ends: 47 [2022-01-11 05:20:08,092 INFO L226 Difference]: Without dead ends: 26 [2022-01-11 05:20:08,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-11 05:20:08,093 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:20:08,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 97 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:20:08,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-11 05:20:08,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-01-11 05:20:08,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 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 05:20:08,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-01-11 05:20:08,096 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 18 [2022-01-11 05:20:08,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:20:08,096 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-01-11 05:20:08,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:20:08,097 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-01-11 05:20:08,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-11 05:20:08,097 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:20:08,097 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:20:08,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 05:20:08,097 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 05:20:08,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:20:08,097 INFO L85 PathProgramCache]: Analyzing trace with hash 4920693, now seen corresponding path program 1 times [2022-01-11 05:20:08,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:20:08,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40205351] [2022-01-11 05:20:08,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:20:08,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:20:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:20:08,186 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 05:20:08,186 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:20:08,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40205351] [2022-01-11 05:20:08,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40205351] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:20:08,186 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:20:08,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-11 05:20:08,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668546586] [2022-01-11 05:20:08,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:20:08,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-11 05:20:08,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:20:08,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-11 05:20:08,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-11 05:20:08,187 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:20:08,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:20:08,339 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-01-11 05:20:08,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-11 05:20:08,339 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-11 05:20:08,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:20:08,340 INFO L225 Difference]: With dead ends: 37 [2022-01-11 05:20:08,340 INFO L226 Difference]: Without dead ends: 35 [2022-01-11 05:20:08,340 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2022-01-11 05:20:08,341 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 85 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:20:08,341 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 62 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:20:08,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-11 05:20:08,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2022-01-11 05:20:08,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 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 05:20:08,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-01-11 05:20:08,345 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 18 [2022-01-11 05:20:08,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:20:08,345 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-01-11 05:20:08,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:20:08,345 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-01-11 05:20:08,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-11 05:20:08,346 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:20:08,346 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:20:08,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 05:20:08,346 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 05:20:08,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:20:08,346 INFO L85 PathProgramCache]: Analyzing trace with hash 4890902, now seen corresponding path program 1 times [2022-01-11 05:20:08,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:20:08,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333641360] [2022-01-11 05:20:08,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:20:08,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:20:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:20:08,537 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 05:20:08,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:20:08,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333641360] [2022-01-11 05:20:08,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333641360] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:20:08,538 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:20:08,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-11 05:20:08,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40366396] [2022-01-11 05:20:08,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:20:08,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-11 05:20:08,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:20:08,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-11 05:20:08,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-01-11 05:20:08,540 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:20:08,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:20:08,882 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-01-11 05:20:08,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-11 05:20:08,882 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-11 05:20:08,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:20:08,883 INFO L225 Difference]: With dead ends: 33 [2022-01-11 05:20:08,883 INFO L226 Difference]: Without dead ends: 31 [2022-01-11 05:20:08,883 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-01-11 05:20:08,884 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 101 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:20:08,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 66 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:20:08,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-11 05:20:08,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2022-01-11 05:20:08,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 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 05:20:08,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-01-11 05:20:08,888 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 18 [2022-01-11 05:20:08,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:20:08,888 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-01-11 05:20:08,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:20:08,888 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-01-11 05:20:08,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-11 05:20:08,889 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:20:08,889 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] [2022-01-11 05:20:08,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 05:20:08,889 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 05:20:08,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:20:08,889 INFO L85 PathProgramCache]: Analyzing trace with hash -459229843, now seen corresponding path program 1 times [2022-01-11 05:20:08,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:20:08,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683432497] [2022-01-11 05:20:08,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:20:08,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:20:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:20:09,067 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 05:20:09,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:20:09,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683432497] [2022-01-11 05:20:09,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683432497] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:20:09,067 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:20:09,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-11 05:20:09,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863233151] [2022-01-11 05:20:09,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:20:09,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-11 05:20:09,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:20:09,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-11 05:20:09,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-01-11 05:20:09,068 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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 05:20:09,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:20:09,377 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-01-11 05:20:09,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-11 05:20:09,378 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-01-11 05:20:09,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:20:09,379 INFO L225 Difference]: With dead ends: 30 [2022-01-11 05:20:09,379 INFO L226 Difference]: Without dead ends: 26 [2022-01-11 05:20:09,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-01-11 05:20:09,380 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 104 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:20:09,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 61 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:20:09,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-11 05:20:09,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-01-11 05:20:09,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 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 05:20:09,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-01-11 05:20:09,383 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2022-01-11 05:20:09,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:20:09,383 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-01-11 05:20:09,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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 05:20:09,383 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-01-11 05:20:09,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-11 05:20:09,383 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:20:09,384 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] [2022-01-11 05:20:09,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 05:20:09,384 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 05:20:09,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:20:09,384 INFO L85 PathProgramCache]: Analyzing trace with hash -459259634, now seen corresponding path program 1 times [2022-01-11 05:20:09,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:20:09,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219467508] [2022-01-11 05:20:09,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:20:09,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:20:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:20:09,482 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 05:20:09,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:20:09,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219467508] [2022-01-11 05:20:09,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219467508] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:20:09,482 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:20:09,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-11 05:20:09,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463151345] [2022-01-11 05:20:09,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:20:09,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-11 05:20:09,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:20:09,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-11 05:20:09,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-11 05:20:09,484 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 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 05:20:09,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:20:09,606 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-01-11 05:20:09,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-11 05:20:09,606 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-01-11 05:20:09,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:20:09,606 INFO L225 Difference]: With dead ends: 30 [2022-01-11 05:20:09,606 INFO L226 Difference]: Without dead ends: 24 [2022-01-11 05:20:09,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2022-01-11 05:20:09,607 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 80 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:20:09,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 39 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:20:09,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-01-11 05:20:09,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-01-11 05:20:09,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 0 states have call successors, (0), 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 05:20:09,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-01-11 05:20:09,610 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 23 [2022-01-11 05:20:09,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:20:09,610 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-01-11 05:20:09,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 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 05:20:09,611 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-01-11 05:20:09,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-11 05:20:09,611 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:20:09,611 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] [2022-01-11 05:20:09,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 05:20:09,611 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 05:20:09,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:20:09,612 INFO L85 PathProgramCache]: Analyzing trace with hash -430600692, now seen corresponding path program 1 times [2022-01-11 05:20:09,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:20:09,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982434951] [2022-01-11 05:20:09,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:20:09,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:20:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:20:09,691 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 05:20:09,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:20:09,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982434951] [2022-01-11 05:20:09,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982434951] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:20:09,692 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:20:09,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-11 05:20:09,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655764436] [2022-01-11 05:20:09,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:20:09,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-11 05:20:09,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:20:09,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-11 05:20:09,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-11 05:20:09,693 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 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 05:20:09,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:20:09,805 INFO L93 Difference]: Finished difference Result 33 states and 32 transitions. [2022-01-11 05:20:09,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 05:20:09,805 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-01-11 05:20:09,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:20:09,805 INFO L225 Difference]: With dead ends: 33 [2022-01-11 05:20:09,805 INFO L226 Difference]: Without dead ends: 24 [2022-01-11 05:20:09,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-01-11 05:20:09,806 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 51 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:20:09,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 48 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:20:09,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-01-11 05:20:09,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-01-11 05:20:09,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.0) internal successors, (23), 23 states have internal predecessors, (23), 0 states have call successors, (0), 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 05:20:09,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2022-01-11 05:20:09,809 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 23 [2022-01-11 05:20:09,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:20:09,809 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2022-01-11 05:20:09,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 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 05:20:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2022-01-11 05:20:09,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-11 05:20:09,809 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:20:09,810 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] [2022-01-11 05:20:09,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 05:20:09,810 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 05:20:09,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:20:09,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1376853771, now seen corresponding path program 1 times [2022-01-11 05:20:09,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:20:09,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097710704] [2022-01-11 05:20:09,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:20:09,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:20:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:20:09,924 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 05:20:09,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:20:09,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097710704] [2022-01-11 05:20:09,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097710704] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:20:09,924 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:20:09,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-11 05:20:09,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214506654] [2022-01-11 05:20:09,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:20:09,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-11 05:20:09,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:20:09,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-11 05:20:09,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-11 05:20:09,925 INFO L87 Difference]: Start difference. First operand 24 states and 23 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 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 05:20:10,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:20:10,022 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2022-01-11 05:20:10,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-11 05:20:10,022 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-01-11 05:20:10,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:20:10,022 INFO L225 Difference]: With dead ends: 24 [2022-01-11 05:20:10,022 INFO L226 Difference]: Without dead ends: 0 [2022-01-11 05:20:10,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2022-01-11 05:20:10,023 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 52 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:20:10,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 21 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:20:10,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-11 05:20:10,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-11 05:20:10,024 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 05:20:10,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-11 05:20:10,024 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-01-11 05:20:10,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:20:10,024 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-11 05:20:10,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 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 05:20:10,024 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-11 05:20:10,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-11 05:20:10,026 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-01-11 05:20:10,026 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-01-11 05:20:10,026 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-01-11 05:20:10,026 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-01-11 05:20:10,026 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-01-11 05:20:10,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 05:20:10,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-11 05:20:10,451 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-11 05:20:10,452 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-11 05:20:10,452 INFO L858 garLoopResultBuilder]: For program point L522(line 522) no Hoare annotation was computed. [2022-01-11 05:20:10,452 INFO L858 garLoopResultBuilder]: For program point L522-2(line 522) no Hoare annotation was computed. [2022-01-11 05:20:10,452 INFO L858 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-01-11 05:20:10,452 INFO L858 garLoopResultBuilder]: For program point L524(lines 524 525) no Hoare annotation was computed. [2022-01-11 05:20:10,452 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2022-01-11 05:20:10,452 INFO L858 garLoopResultBuilder]: For program point L4(lines 4 7) no Hoare annotation was computed. [2022-01-11 05:20:10,452 INFO L854 garLoopResultBuilder]: At program point L526(lines 520 527) the Hoare annotation is: (let ((.cse0 (= ~guard_malloc_counter~0.baseInt 0)) (.cse1 (<= 16 |ULTIMATE.start_ULTIMATE.start___getMemory_~size#1Int|)) (.cse2 (= ~elem~0.offsetInt 0)) (.cse3 (<= (div |ULTIMATE.start_ULTIMATE.start___getMemory_~size#1Int| 2147483648) 0)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start___getMemory_#res#1.baseInt| 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ULTIMATE.start___getMemory_#res#1.offsetInt| 0) .cse2 .cse3 .cse4) (let ((.cse5 (<= (div (+ ~guard_malloc_counter~0.offsetInt 1) 18446744073709551616) 0))) (and .cse0 .cse1 (or (<= ~guard_malloc_counter~0.offsetInt |ULTIMATE.start_ULTIMATE.start___getMemory_#res#1.offsetInt|) .cse5) (or (<= |ULTIMATE.start_ULTIMATE.start___getMemory_#res#1.offsetInt| ~guard_malloc_counter~0.offsetInt) (not .cse5)) .cse2 .cse3 .cse4)))) [2022-01-11 05:20:10,452 INFO L854 garLoopResultBuilder]: At program point L529(lines 528 530) the Hoare annotation is: (let ((.cse0 (= ~guard_malloc_counter~0.baseInt 0)) (.cse1 (<= 16 |ULTIMATE.start_ULTIMATE.start___getMemory_~size#1Int|)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_my_malloc_#res#1.baseInt| 0)) (.cse3 (= ~elem~0.offsetInt 0)) (.cse4 (<= (div |ULTIMATE.start_ULTIMATE.start___getMemory_~size#1Int| 2147483648) 0)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start___getMemory_#res#1.baseInt| 0))) (or (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_my_malloc_#res#1.offsetInt| 0) .cse1 (= |ULTIMATE.start_ULTIMATE.start___getMemory_#res#1.offsetInt| 0) .cse2 .cse3 .cse4 .cse5) (let ((.cse6 (<= (div (+ ~guard_malloc_counter~0.offsetInt 1) 18446744073709551616) 0))) (let ((.cse7 (not .cse6))) (and .cse0 (or (<= ~guard_malloc_counter~0.offsetInt |ULTIMATE.start_ULTIMATE.start_my_malloc_#res#1.offsetInt|) .cse6) .cse1 (or (<= ~guard_malloc_counter~0.offsetInt |ULTIMATE.start_ULTIMATE.start___getMemory_#res#1.offsetInt|) .cse6) (or (<= |ULTIMATE.start_ULTIMATE.start___getMemory_#res#1.offsetInt| ~guard_malloc_counter~0.offsetInt) .cse7) .cse2 (or .cse7 (<= |ULTIMATE.start_ULTIMATE.start_my_malloc_#res#1.offsetInt| ~guard_malloc_counter~0.offsetInt)) .cse3 .cse4 .cse5))))) [2022-01-11 05:20:10,452 INFO L858 garLoopResultBuilder]: For program point L522-3(line 522) no Hoare annotation was computed. [2022-01-11 05:20:10,453 INFO L858 garLoopResultBuilder]: For program point L522-5(line 522) no Hoare annotation was computed. [2022-01-11 05:20:10,453 INFO L858 garLoopResultBuilder]: For program point L6-1(line 6) no Hoare annotation was computed. [2022-01-11 05:20:10,453 INFO L858 garLoopResultBuilder]: For program point L524-1(lines 524 525) no Hoare annotation was computed. [2022-01-11 05:20:10,453 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2022-01-11 05:20:10,453 INFO L858 garLoopResultBuilder]: For program point L4-1(lines 4 7) no Hoare annotation was computed. [2022-01-11 05:20:10,453 INFO L854 garLoopResultBuilder]: At program point L526-1(lines 520 527) the Hoare annotation is: (let ((.cse8 (+ |ULTIMATE.start_ULTIMATE.start_main_~dev1~0#1.offsetInt| 1))) (let ((.cse0 (= ~guard_malloc_counter~0.baseInt 0)) (.cse1 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_main_~dev1~0#1.baseInt| 1))) (.cse3 (< 0 .cse8)) (.cse4 (= ~elem~0.offsetInt 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start___getMemory_#res#1.baseInt| 0)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_main_~dev1~0#1.baseInt| 0)) (.cse2 (<= 16 |ULTIMATE.start_ULTIMATE.start___getMemory_~size#1Int|)) (.cse5 (<= (div |ULTIMATE.start_ULTIMATE.start___getMemory_~size#1Int| 2147483648) 0))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ULTIMATE.start_main_~dev1~0#1.offsetInt| 0) .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse9 (<= (div (+ ~guard_malloc_counter~0.offsetInt 1) 18446744073709551616) 0))) (and .cse0 .cse1 .cse2 (or (<= (+ ~guard_malloc_counter~0.offsetInt 18446744073709551615) |ULTIMATE.start_ULTIMATE.start_main_~dev1~0#1.offsetInt|) (<= .cse8 ~guard_malloc_counter~0.offsetInt)) (or (<= .cse8 |ULTIMATE.start_ULTIMATE.start___getMemory_#res#1.offsetInt|) (<= (+ 18446744073709551615 |ULTIMATE.start_ULTIMATE.start___getMemory_#res#1.offsetInt|) |ULTIMATE.start_ULTIMATE.start_main_~dev1~0#1.offsetInt|)) (or (<= ~guard_malloc_counter~0.offsetInt |ULTIMATE.start_ULTIMATE.start___getMemory_#res#1.offsetInt|) .cse9) (or (<= |ULTIMATE.start_ULTIMATE.start___getMemory_#res#1.offsetInt| ~guard_malloc_counter~0.offsetInt) (not .cse9)) .cse3 .cse4 .cse5 .cse6 .cse7)) (and .cse2 (= |ULTIMATE.start_ULTIMATE.start___getMemory_#res#1.baseInt| 0) (<= |ULTIMATE.start_ULTIMATE.start___getMemory_#res#1.offsetInt| 0) .cse5)))) [2022-01-11 05:20:10,453 INFO L854 garLoopResultBuilder]: At program point L529-1(lines 528 530) the Hoare annotation is: (let ((.cse10 (+ |ULTIMATE.start_ULTIMATE.start_main_~dev1~0#1.offsetInt| 1))) (let ((.cse0 (= ~guard_malloc_counter~0.baseInt 0)) (.cse1 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_main_~dev1~0#1.baseInt| 1))) (.cse2 (<= 16 |ULTIMATE.start_ULTIMATE.start___getMemory_~size#1Int|)) (.cse3 (< 0 .cse10)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_my_malloc_#res#1.baseInt| 0)) (.cse5 (= ~elem~0.offsetInt 0)) (.cse6 (<= (div |ULTIMATE.start_ULTIMATE.start___getMemory_~size#1Int| 2147483648) 0)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start___getMemory_#res#1.baseInt| 0)) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_main_~dev1~0#1.baseInt| 0))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ULTIMATE.start_main_~dev1~0#1.offsetInt| 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 (<= |ULTIMATE.start_ULTIMATE.start_my_malloc_#res#1.offsetInt| 0) (= |ULTIMATE.start_ULTIMATE.start___getMemory_#res#1.baseInt| 0) .cse4 (<= |ULTIMATE.start_ULTIMATE.start___getMemory_#res#1.offsetInt| 0) .cse6) (let ((.cse9 (<= (div (+ ~guard_malloc_counter~0.offsetInt 1) 18446744073709551616) 0))) (let ((.cse11 (not .cse9))) (and .cse0 (or (<= ~guard_malloc_counter~0.offsetInt |ULTIMATE.start_ULTIMATE.start_my_malloc_#res#1.offsetInt|) .cse9) .cse1 .cse2 (or (<= .cse10 |ULTIMATE.start_ULTIMATE.start_my_malloc_#res#1.offsetInt|) (<= (+ |ULTIMATE.start_ULTIMATE.start_my_malloc_#res#1.offsetInt| 18446744073709551615) |ULTIMATE.start_ULTIMATE.start_main_~dev1~0#1.offsetInt|)) (or (<= (+ ~guard_malloc_counter~0.offsetInt 18446744073709551615) |ULTIMATE.start_ULTIMATE.start_main_~dev1~0#1.offsetInt|) (<= .cse10 ~guard_malloc_counter~0.offsetInt)) (or (<= .cse10 |ULTIMATE.start_ULTIMATE.start___getMemory_#res#1.offsetInt|) (<= (+ 18446744073709551615 |ULTIMATE.start_ULTIMATE.start___getMemory_#res#1.offsetInt|) |ULTIMATE.start_ULTIMATE.start_main_~dev1~0#1.offsetInt|)) (or (<= ~guard_malloc_counter~0.offsetInt |ULTIMATE.start_ULTIMATE.start___getMemory_#res#1.offsetInt|) .cse9) (or (<= |ULTIMATE.start_ULTIMATE.start___getMemory_#res#1.offsetInt| ~guard_malloc_counter~0.offsetInt) .cse11) .cse3 .cse4 (or .cse11 (<= |ULTIMATE.start_ULTIMATE.start_my_malloc_#res#1.offsetInt| ~guard_malloc_counter~0.offsetInt)) .cse5 .cse6 .cse7 .cse8)))))) [2022-01-11 05:20:10,453 INFO L858 garLoopResultBuilder]: For program point L549(lines 549 554) no Hoare annotation was computed. [2022-01-11 05:20:10,453 INFO L858 garLoopResultBuilder]: For program point L536(line 536) no Hoare annotation was computed. [2022-01-11 05:20:10,453 INFO L858 garLoopResultBuilder]: For program point L549-2(lines 549 554) no Hoare annotation was computed. [2022-01-11 05:20:10,453 INFO L858 garLoopResultBuilder]: For program point L536-2(lines 535 539) no Hoare annotation was computed. [2022-01-11 05:20:10,453 INFO L858 garLoopResultBuilder]: For program point L6-2(line 6) no Hoare annotation was computed. [2022-01-11 05:20:10,453 INFO L854 garLoopResultBuilder]: At program point L555(lines 545 556) the Hoare annotation is: (and (<= 16 |ULTIMATE.start_ULTIMATE.start___getMemory_~size#1Int|) (<= (div |ULTIMATE.start_ULTIMATE.start___getMemory_~size#1Int| 2147483648) 0)) [2022-01-11 05:20:10,453 INFO L858 garLoopResultBuilder]: For program point L535(lines 535 539) no Hoare annotation was computed. [2022-01-11 05:20:10,454 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2022-01-11 05:20:10,454 INFO L858 garLoopResultBuilder]: For program point L4-2(lines 4 7) no Hoare annotation was computed. [2022-01-11 05:20:10,454 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-11 05:20:10,454 INFO L858 garLoopResultBuilder]: For program point L536-3(line 536) no Hoare annotation was computed. [2022-01-11 05:20:10,454 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-11 05:20:10,454 INFO L858 garLoopResultBuilder]: For program point L536-5(lines 535 539) no Hoare annotation was computed. [2022-01-11 05:20:10,454 INFO L858 garLoopResultBuilder]: For program point L6-3(line 6) no Hoare annotation was computed. [2022-01-11 05:20:10,454 INFO L858 garLoopResultBuilder]: For program point L535-1(lines 535 539) no Hoare annotation was computed. [2022-01-11 05:20:10,454 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2022-01-11 05:20:10,454 INFO L858 garLoopResultBuilder]: For program point L4-3(lines 4 7) no Hoare annotation was computed. [2022-01-11 05:20:10,454 INFO L858 garLoopResultBuilder]: For program point L541(lines 541 542) no Hoare annotation was computed. [2022-01-11 05:20:10,454 INFO L858 garLoopResultBuilder]: For program point L540(lines 540 543) no Hoare annotation was computed. [2022-01-11 05:20:10,454 INFO L858 garLoopResultBuilder]: For program point L536-6(line 536) no Hoare annotation was computed. [2022-01-11 05:20:10,454 INFO L858 garLoopResultBuilder]: For program point L536-8(lines 535 539) no Hoare annotation was computed. [2022-01-11 05:20:10,454 INFO L858 garLoopResultBuilder]: For program point L6-4(line 6) no Hoare annotation was computed. [2022-01-11 05:20:10,454 INFO L858 garLoopResultBuilder]: For program point L535-2(lines 535 539) no Hoare annotation was computed. [2022-01-11 05:20:10,454 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2022-01-11 05:20:10,454 INFO L858 garLoopResultBuilder]: For program point L4-4(lines 4 7) no Hoare annotation was computed. [2022-01-11 05:20:10,456 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:20:10,457 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 05:20:10,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 05:20:10 BasicIcfg [2022-01-11 05:20:10,496 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 05:20:10,496 INFO L158 Benchmark]: Toolchain (without parser) took 4992.52ms. Allocated memory was 203.4MB in the beginning and 264.2MB in the end (delta: 60.8MB). Free memory was 156.2MB in the beginning and 187.9MB in the end (delta: -31.8MB). Peak memory consumption was 29.1MB. Max. memory is 8.0GB. [2022-01-11 05:20:10,496 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 203.4MB. Free memory is still 173.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 05:20:10,496 INFO L158 Benchmark]: CACSL2BoogieTranslator took 446.37ms. Allocated memory is still 203.4MB. Free memory was 156.0MB in the beginning and 172.3MB in the end (delta: -16.3MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. [2022-01-11 05:20:10,497 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.30ms. Allocated memory is still 203.4MB. Free memory was 171.8MB in the beginning and 169.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-11 05:20:10,497 INFO L158 Benchmark]: Boogie Preprocessor took 36.41ms. Allocated memory is still 203.4MB. Free memory was 169.7MB in the beginning and 168.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-11 05:20:10,497 INFO L158 Benchmark]: RCFGBuilder took 588.21ms. Allocated memory is still 203.4MB. Free memory was 168.1MB in the beginning and 155.0MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-01-11 05:20:10,497 INFO L158 Benchmark]: IcfgTransformer took 169.41ms. Allocated memory is still 203.4MB. Free memory was 155.0MB in the beginning and 149.7MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-11 05:20:10,497 INFO L158 Benchmark]: TraceAbstraction took 3680.79ms. Allocated memory was 203.4MB in the beginning and 264.2MB in the end (delta: 60.8MB). Free memory was 149.2MB in the beginning and 187.9MB in the end (delta: -38.7MB). Peak memory consumption was 23.7MB. Max. memory is 8.0GB. [2022-01-11 05:20:10,498 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 203.4MB. Free memory is still 173.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 446.37ms. Allocated memory is still 203.4MB. Free memory was 156.0MB in the beginning and 172.3MB in the end (delta: -16.3MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.30ms. Allocated memory is still 203.4MB. Free memory was 171.8MB in the beginning and 169.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.41ms. Allocated memory is still 203.4MB. Free memory was 169.7MB in the beginning and 168.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 588.21ms. Allocated memory is still 203.4MB. Free memory was 168.1MB in the beginning and 155.0MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 169.41ms. Allocated memory is still 203.4MB. Free memory was 155.0MB in the beginning and 149.7MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * TraceAbstraction took 3680.79ms. Allocated memory was 203.4MB in the beginning and 264.2MB in the end (delta: 60.8MB). Free memory was 149.2MB in the beginning and 187.9MB in the end (delta: -38.7MB). Peak memory consumption was 23.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: 6]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 6]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 6]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 6]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 6]: 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, 43 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 582 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 582 mSDsluCounter, 598 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 414 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 712 IncrementalHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 184 mSDtfsCounter, 712 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 27 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 16 NumberOfFragments, 465 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 80 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 1280 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 545]: Loop Invariant Derived loop invariant: ~bvule32(16bv32, size) && ~bvule1(size[31:31], 0bv1) - InvariantResult [Line: 520]: Loop Invariant Derived loop invariant: (((((0bv64 == elem && ~bvule64(\result, 0bv64)) && 0bv64 == guard_malloc_counter) && 0bv64 == \result) && ~bvule32(16bv32, size)) && ~bvule1(size[31:31], 0bv1)) || ((((((0bv64 == elem && ~bvule64(\result, 0bv64)) && (~bvule64(guard_malloc_counter, \result) || ~bvule1(~bvadd32(~zero_extendFrom64To65(guard_malloc_counter), 1bv65)[64:64], 0bv1))) && 0bv64 == guard_malloc_counter) && (!~bvule1(~bvadd32(~zero_extendFrom64To65(guard_malloc_counter), 1bv65)[64:64], 0bv1) || ~bvule64(\result, guard_malloc_counter))) && ~bvule32(16bv32, size)) && ~bvule1(size[31:31], 0bv1)) - InvariantResult [Line: 520]: Loop Invariant Derived loop invariant: ((((~bvule32(16bv32, size) && \result == 0bv64) && ~bvule64(\result, 0bv64)) && ~bvule1(size[31:31], 0bv1)) || ((((((((0bv64 == elem && ~bvule64(\result, 0bv64)) && ~bvult64(0bv65, ~bvadd32(~zero_extendFrom64To65(dev1), 1bv65))) && 0bv64 == guard_malloc_counter) && ~bvule32(16bv32, size)) && ~bvule64(dev1, 0bv64)) && ~bvule64(dev1, 0bv64)) && ~bvult64(0bv65, ~bvadd32(~zero_extendFrom64To65(dev1), 1bv65))) && ~bvule1(size[31:31], 0bv1))) || (((((((((((0bv64 == elem && ~bvule64(\result, 0bv64)) && ~bvult64(0bv65, ~bvadd32(~zero_extendFrom64To65(dev1), 1bv65))) && (~bvule64(guard_malloc_counter, \result) || ~bvule1(~bvadd32(~zero_extendFrom64To65(guard_malloc_counter), 1bv65)[64:64], 0bv1))) && 0bv64 == guard_malloc_counter) && (~bvule65(~bvadd32(~zero_extendFrom64To65(dev1), 1bv65), ~zero_extendFrom64To65(\result)) || ~bvule65(~bvadd32(18446744073709551615bv65, ~zero_extendFrom64To65(\result)), ~zero_extendFrom64To65(dev1)))) && (!~bvule1(~bvadd32(~zero_extendFrom64To65(guard_malloc_counter), 1bv65)[64:64], 0bv1) || ~bvule64(\result, guard_malloc_counter))) && ~bvule32(16bv32, size)) && (~bvule65(~bvadd32(~zero_extendFrom64To65(guard_malloc_counter), 18446744073709551615bv65), ~zero_extendFrom64To65(dev1)) || ~bvule65(~bvadd32(~zero_extendFrom64To65(dev1), 1bv65), ~zero_extendFrom64To65(guard_malloc_counter)))) && ~bvule64(dev1, 0bv64)) && ~bvult64(0bv65, ~bvadd32(~zero_extendFrom64To65(dev1), 1bv65))) && ~bvule1(size[31:31], 0bv1)) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((((~bvule64(\result, 0bv64) && ~bvule32(16bv32, size)) && \result == 0bv64) && ~bvule64(\result, 0bv64)) && ~bvule1(size[31:31], 0bv1)) && ~bvule64(\result, 0bv64)) || (((((((((((((((0bv64 == elem && ~bvule64(\result, 0bv64)) && (!~bvule1(~bvadd32(~zero_extendFrom64To65(guard_malloc_counter), 1bv65)[64:64], 0bv1) || ~bvule64(\result, guard_malloc_counter))) && ~bvult64(0bv65, ~bvadd32(~zero_extendFrom64To65(dev1), 1bv65))) && (~bvule64(guard_malloc_counter, \result) || ~bvule1(~bvadd32(~zero_extendFrom64To65(guard_malloc_counter), 1bv65)[64:64], 0bv1))) && 0bv64 == guard_malloc_counter) && (~bvule65(~bvadd32(~zero_extendFrom64To65(\result), 18446744073709551615bv65), ~zero_extendFrom64To65(dev1)) || ~bvule65(~bvadd32(~zero_extendFrom64To65(dev1), 1bv65), ~zero_extendFrom64To65(\result)))) && (~bvule65(~bvadd32(~zero_extendFrom64To65(dev1), 1bv65), ~zero_extendFrom64To65(\result)) || ~bvule65(~bvadd32(18446744073709551615bv65, ~zero_extendFrom64To65(\result)), ~zero_extendFrom64To65(dev1)))) && (!~bvule1(~bvadd32(~zero_extendFrom64To65(guard_malloc_counter), 1bv65)[64:64], 0bv1) || ~bvule64(\result, guard_malloc_counter))) && ~bvule32(16bv32, size)) && (~bvule65(~bvadd32(~zero_extendFrom64To65(guard_malloc_counter), 18446744073709551615bv65), ~zero_extendFrom64To65(dev1)) || ~bvule65(~bvadd32(~zero_extendFrom64To65(dev1), 1bv65), ~zero_extendFrom64To65(guard_malloc_counter)))) && ~bvule64(dev1, 0bv64)) && ~bvult64(0bv65, ~bvadd32(~zero_extendFrom64To65(dev1), 1bv65))) && (~bvule64(guard_malloc_counter, \result) || ~bvule1(~bvadd32(~zero_extendFrom64To65(guard_malloc_counter), 1bv65)[64:64], 0bv1))) && ~bvule1(size[31:31], 0bv1)) && ~bvule64(\result, 0bv64))) || (((((((((0bv64 == elem && ~bvule64(\result, 0bv64)) && ~bvult64(0bv65, ~bvadd32(~zero_extendFrom64To65(dev1), 1bv65))) && 0bv64 == guard_malloc_counter) && ~bvule32(16bv32, size)) && ~bvule64(dev1, 0bv64)) && ~bvule64(dev1, 0bv64)) && ~bvult64(0bv65, ~bvadd32(~zero_extendFrom64To65(dev1), 1bv65))) && ~bvule1(size[31:31], 0bv1)) && ~bvule64(\result, 0bv64)) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: (((((((0bv64 == elem && ~bvule64(\result, 0bv64)) && 0bv64 == \result) && 0bv64 == guard_malloc_counter) && 0bv64 == \result) && ~bvule32(16bv32, size)) && ~bvule1(size[31:31], 0bv1)) && ~bvule64(\result, 0bv64)) || (((((((((0bv64 == elem && ~bvule64(\result, 0bv64)) && (!~bvule1(~bvadd32(~zero_extendFrom64To65(guard_malloc_counter), 1bv65)[64:64], 0bv1) || ~bvule64(\result, guard_malloc_counter))) && (~bvule64(guard_malloc_counter, \result) || ~bvule1(~bvadd32(~zero_extendFrom64To65(guard_malloc_counter), 1bv65)[64:64], 0bv1))) && 0bv64 == guard_malloc_counter) && (!~bvule1(~bvadd32(~zero_extendFrom64To65(guard_malloc_counter), 1bv65)[64:64], 0bv1) || ~bvule64(\result, guard_malloc_counter))) && ~bvule32(16bv32, size)) && (~bvule64(guard_malloc_counter, \result) || ~bvule1(~bvadd32(~zero_extendFrom64To65(guard_malloc_counter), 1bv65)[64:64], 0bv1))) && ~bvule1(size[31:31], 0bv1)) && ~bvule64(\result, 0bv64)) RESULT: Ultimate proved your program to be correct! [2022-01-11 05:20:10,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...