/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_LAZY.epf -i ../../../trunk/examples/svcomp/list-simple/sll2n_update_all.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 17:50:47,478 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 17:50:47,480 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 17:50:47,518 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 17:50:47,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 17:50:47,521 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 17:50:47,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 17:50:47,538 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 17:50:47,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 17:50:47,544 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 17:50:47,545 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 17:50:47,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 17:50:47,546 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 17:50:47,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 17:50:47,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 17:50:47,550 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 17:50:47,550 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 17:50:47,551 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 17:50:47,554 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 17:50:47,557 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 17:50:47,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 17:50:47,560 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 17:50:47,560 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 17:50:47,561 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 17:50:47,562 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 17:50:47,562 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 17:50:47,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 17:50:47,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 17:50:47,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 17:50:47,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 17:50:47,564 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 17:50:47,564 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 17:50:47,564 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 17:50:47,565 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 17:50:47,565 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 17:50:47,566 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 17:50:47,566 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 17:50:47,566 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 17:50:47,566 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 17:50:47,567 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 17:50:47,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 17:50:47,571 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 17:50:47,596 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 17:50:47,596 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 17:50:47,596 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 17:50:47,597 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 17:50:47,597 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 17:50:47,597 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 17:50:47,597 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 17:50:47,598 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 17:50:47,598 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 17:50:47,598 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 17:50:47,598 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 17:50:47,598 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 17:50:47,598 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 17:50:47,598 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 17:50:47,598 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 17:50:47,598 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 17:50:47,598 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 17:50:47,598 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 17:50:47,599 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 17:50:47,599 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 17:50:47,599 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 17:50:47,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 17:50:47,602 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 17:50:47,602 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 17:50:47,602 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 17:50:47,602 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 17:50:47,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 17:50:47,602 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 17:50:47,603 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 17:50:47,603 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 17:50:47,603 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 17:50:47,603 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 17:50:47,604 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 17:50:47,604 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 17:50:47,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 17:50:47,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 17:50:47,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 17:50:47,825 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 17:50:47,826 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 17:50:47,826 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_update_all.i [2022-01-10 17:50:47,871 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c9371d06/810fac0b4445467e8135e9f8b2d71bac/FLAG957a76eb0 [2022-01-10 17:50:48,320 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 17:50:48,320 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_update_all.i [2022-01-10 17:50:48,334 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c9371d06/810fac0b4445467e8135e9f8b2d71bac/FLAG957a76eb0 [2022-01-10 17:50:48,673 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c9371d06/810fac0b4445467e8135e9f8b2d71bac [2022-01-10 17:50:48,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 17:50:48,676 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 17:50:48,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 17:50:48,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 17:50:48,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 17:50:48,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:50:48" (1/1) ... [2022-01-10 17:50:48,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41017e60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:50:48, skipping insertion in model container [2022-01-10 17:50:48,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:50:48" (1/1) ... [2022-01-10 17:50:48,686 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 17:50:48,721 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 17:50:49,004 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_update_all.i[24218,24231] [2022-01-10 17:50:49,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 17:50:49,011 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 17:50:49,037 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_update_all.i[24218,24231] [2022-01-10 17:50:49,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 17:50:49,054 INFO L208 MainTranslator]: Completed translation [2022-01-10 17:50:49,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:50:49 WrapperNode [2022-01-10 17:50:49,055 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 17:50:49,055 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 17:50:49,056 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 17:50:49,056 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 17:50:49,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:50:49" (1/1) ... [2022-01-10 17:50:49,070 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:50:49" (1/1) ... [2022-01-10 17:50:49,087 INFO L137 Inliner]: procedures = 129, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2022-01-10 17:50:49,088 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 17:50:49,088 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 17:50:49,088 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 17:50:49,088 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 17:50:49,093 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:50:49" (1/1) ... [2022-01-10 17:50:49,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:50:49" (1/1) ... [2022-01-10 17:50:49,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:50:49" (1/1) ... [2022-01-10 17:50:49,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:50:49" (1/1) ... [2022-01-10 17:50:49,100 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:50:49" (1/1) ... [2022-01-10 17:50:49,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:50:49" (1/1) ... [2022-01-10 17:50:49,104 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:50:49" (1/1) ... [2022-01-10 17:50:49,106 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 17:50:49,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 17:50:49,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 17:50:49,106 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 17:50:49,107 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:50:49" (1/1) ... [2022-01-10 17:50:49,112 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 17:50:49,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:50:49,129 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 17:50:49,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 17:50:49,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 17:50:49,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 17:50:49,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 17:50:49,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 17:50:49,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 17:50:49,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 17:50:49,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 17:50:49,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 17:50:49,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 17:50:49,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 17:50:49,275 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 17:50:49,276 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 17:50:49,436 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 17:50:49,440 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 17:50:49,441 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-10 17:50:49,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:50:49 BoogieIcfgContainer [2022-01-10 17:50:49,443 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 17:50:49,443 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 17:50:49,443 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 17:50:49,444 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 17:50:49,446 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:50:49" (1/1) ... [2022-01-10 17:50:49,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 05:50:49 BasicIcfg [2022-01-10 17:50:49,545 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 17:50:49,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 17:50:49,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 17:50:49,550 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 17:50:49,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 05:50:48" (1/4) ... [2022-01-10 17:50:49,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8caee7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:50:49, skipping insertion in model container [2022-01-10 17:50:49,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:50:49" (2/4) ... [2022-01-10 17:50:49,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8caee7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:50:49, skipping insertion in model container [2022-01-10 17:50:49,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:50:49" (3/4) ... [2022-01-10 17:50:49,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8caee7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 05:50:49, skipping insertion in model container [2022-01-10 17:50:49,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 05:50:49" (4/4) ... [2022-01-10 17:50:49,553 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.iTransformedIcfg [2022-01-10 17:50:49,559 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 17:50:49,559 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 17:50:49,602 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 17:50:49,610 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 17:50:49,610 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 17:50:49,619 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 29 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:50:49,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 17:50:49,622 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:50:49,623 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:50:49,623 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:50:49,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:50:49,626 INFO L85 PathProgramCache]: Analyzing trace with hash 670470688, now seen corresponding path program 1 times [2022-01-10 17:50:49,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:50:49,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004479970] [2022-01-10 17:50:49,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:50:49,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:50:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:50:49,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:50:49,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:50:49,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004479970] [2022-01-10 17:50:49,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004479970] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:50:49,759 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:50:49,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 17:50:49,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485410598] [2022-01-10 17:50:49,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:50:49,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 17:50:49,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:50:49,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 17:50:49,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 17:50:49,788 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 29 states have internal predecessors, (43), 0 states have call successors, (0), 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 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:50:49,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:50:49,798 INFO L93 Difference]: Finished difference Result 52 states and 75 transitions. [2022-01-10 17:50:49,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 17:50:49,799 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-01-10 17:50:49,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:50:49,804 INFO L225 Difference]: With dead ends: 52 [2022-01-10 17:50:49,804 INFO L226 Difference]: Without dead ends: 23 [2022-01-10 17:50:49,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 17:50:49,808 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:50:49,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:50:49,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-10 17:50:49,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-01-10 17:50:49,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:50:49,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-01-10 17:50:49,829 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2022-01-10 17:50:49,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:50:49,829 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-01-10 17:50:49,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:50:49,830 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-01-10 17:50:49,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 17:50:49,830 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:50:49,830 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:50:49,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 17:50:49,831 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:50:49,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:50:49,831 INFO L85 PathProgramCache]: Analyzing trace with hash 617253185, now seen corresponding path program 1 times [2022-01-10 17:50:49,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:50:49,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917128676] [2022-01-10 17:50:49,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:50:49,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:50:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:50:49,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:50:49,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:50:49,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917128676] [2022-01-10 17:50:49,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917128676] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:50:49,921 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:50:49,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:50:49,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25253913] [2022-01-10 17:50:49,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:50:49,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:50:49,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:50:49,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:50:49,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:50:49,923 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:50:49,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:50:49,935 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-01-10 17:50:49,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:50:49,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-01-10 17:50:49,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:50:49,936 INFO L225 Difference]: With dead ends: 44 [2022-01-10 17:50:49,936 INFO L226 Difference]: Without dead ends: 28 [2022-01-10 17:50:49,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:50:49,937 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:50:49,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 48 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:50:49,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-10 17:50:49,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-01-10 17:50:49,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 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-10 17:50:49,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-01-10 17:50:49,942 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 13 [2022-01-10 17:50:49,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:50:49,942 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-01-10 17:50:49,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:50:49,942 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-01-10 17:50:49,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 17:50:49,943 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:50:49,943 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-10 17:50:49,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 17:50:49,943 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:50:49,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:50:49,944 INFO L85 PathProgramCache]: Analyzing trace with hash -539620311, now seen corresponding path program 1 times [2022-01-10 17:50:49,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:50:49,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230937787] [2022-01-10 17:50:49,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:50:49,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:50:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:50:50,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:50:50,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:50:50,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230937787] [2022-01-10 17:50:50,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230937787] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:50:50,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33693743] [2022-01-10 17:50:50,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:50:50,172 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:50:50,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:50:50,188 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:50:50,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 17:50:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:50:50,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 17:50:50,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:50:50,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:50:50,414 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 17:50:50,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33693743] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:50:50,415 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 17:50:50,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2022-01-10 17:50:50,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119188947] [2022-01-10 17:50:50,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:50:50,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 17:50:50,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:50:50,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 17:50:50,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-10 17:50:50,418 INFO L87 Difference]: Start difference. First operand 24 states and 28 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-10 17:50:50,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:50:50,454 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-01-10 17:50:50,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 17:50:50,455 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-10 17:50:50,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:50:50,455 INFO L225 Difference]: With dead ends: 47 [2022-01-10 17:50:50,456 INFO L226 Difference]: Without dead ends: 37 [2022-01-10 17:50:50,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-10 17:50:50,457 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:50:50,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 81 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:50:50,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-10 17:50:50,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2022-01-10 17:50:50,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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-10 17:50:50,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-01-10 17:50:50,460 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 18 [2022-01-10 17:50:50,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:50:50,461 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-01-10 17:50:50,461 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-10 17:50:50,461 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-01-10 17:50:50,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 17:50:50,461 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:50:50,461 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-10 17:50:50,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 17:50:50,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:50:50,682 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:50:50,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:50:50,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1842051929, now seen corresponding path program 1 times [2022-01-10 17:50:50,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:50:50,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751701398] [2022-01-10 17:50:50,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:50:50,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:50:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:50:50,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:50:50,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:50:50,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751701398] [2022-01-10 17:50:50,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751701398] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:50:50,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544309844] [2022-01-10 17:50:50,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:50:50,824 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:50:50,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:50:50,827 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:50:50,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 17:50:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:50:50,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 52 conjunts are in the unsatisfiable core [2022-01-10 17:50:50,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:50:51,188 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 17:50:51,403 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:50:51,407 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:50:51,410 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2022-01-10 17:50:51,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:50:51,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:50:51,543 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-01-10 17:50:51,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:50:51,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544309844] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:50:51,709 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:50:51,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 14, 13] total 27 [2022-01-10 17:50:51,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942053241] [2022-01-10 17:50:51,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:50:51,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-10 17:50:51,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:50:51,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-10 17:50:51,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2022-01-10 17:50:51,711 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 27 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 27 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:50:52,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:50:52,129 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2022-01-10 17:50:52,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-10 17:50:52,130 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 27 states have internal predecessors, (65), 0 states have call successors, (0), 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-10 17:50:52,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:50:52,132 INFO L225 Difference]: With dead ends: 69 [2022-01-10 17:50:52,132 INFO L226 Difference]: Without dead ends: 52 [2022-01-10 17:50:52,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=1252, Unknown=0, NotChecked=0, Total=1482 [2022-01-10 17:50:52,134 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 112 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:50:52,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 218 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 229 Invalid, 0 Unknown, 41 Unchecked, 0.1s Time] [2022-01-10 17:50:52,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-10 17:50:52,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2022-01-10 17:50:52,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:50:52,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2022-01-10 17:50:52,140 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 23 [2022-01-10 17:50:52,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:50:52,140 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2022-01-10 17:50:52,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 27 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:50:52,141 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-01-10 17:50:52,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 17:50:52,141 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:50:52,141 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:50:52,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 17:50:52,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-10 17:50:52,355 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:50:52,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:50:52,355 INFO L85 PathProgramCache]: Analyzing trace with hash -66063596, now seen corresponding path program 1 times [2022-01-10 17:50:52,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:50:52,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549632306] [2022-01-10 17:50:52,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:50:52,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:50:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:50:52,528 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 17:50:52,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:50:52,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549632306] [2022-01-10 17:50:52,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549632306] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:50:52,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276812428] [2022-01-10 17:50:52,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:50:52,529 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:50:52,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:50:52,544 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:50:52,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 17:50:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:50:52,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-10 17:50:52,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:50:52,711 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 17:50:52,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:50:52,759 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 17:50:52,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276812428] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 17:50:52,759 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-10 17:50:52,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 11 [2022-01-10 17:50:52,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088984570] [2022-01-10 17:50:52,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:50:52,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 17:50:52,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:50:52,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 17:50:52,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-01-10 17:50:52,761 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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-10 17:50:52,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:50:52,796 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-01-10 17:50:52,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 17:50:52,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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) Word has length 29 [2022-01-10 17:50:52,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:50:52,797 INFO L225 Difference]: With dead ends: 61 [2022-01-10 17:50:52,797 INFO L226 Difference]: Without dead ends: 53 [2022-01-10 17:50:52,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-01-10 17:50:52,798 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 24 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:50:52,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 58 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:50:52,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-10 17:50:52,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2022-01-10 17:50:52,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:50:52,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-01-10 17:50:52,803 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 29 [2022-01-10 17:50:52,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:50:52,803 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-01-10 17:50:52,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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-10 17:50:52,803 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-01-10 17:50:52,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 17:50:52,804 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:50:52,804 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:50:52,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 17:50:53,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:50:53,024 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:50:53,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:50:53,024 INFO L85 PathProgramCache]: Analyzing trace with hash -2052579183, now seen corresponding path program 1 times [2022-01-10 17:50:53,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:50:53,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186900655] [2022-01-10 17:50:53,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:50:53,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:50:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:50:53,166 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 17:50:53,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:50:53,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186900655] [2022-01-10 17:50:53,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186900655] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:50:53,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95706976] [2022-01-10 17:50:53,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:50:53,166 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:50:53,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:50:53,177 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:50:53,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 17:50:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:50:53,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-10 17:50:53,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:50:53,365 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 17:50:53,365 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 17:50:53,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95706976] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:50:53,365 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 17:50:53,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2022-01-10 17:50:53,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993799168] [2022-01-10 17:50:53,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:50:53,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 17:50:53,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:50:53,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 17:50:53,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 17:50:53,367 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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-10 17:50:53,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:50:53,406 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2022-01-10 17:50:53,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 17:50:53,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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) Word has length 29 [2022-01-10 17:50:53,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:50:53,407 INFO L225 Difference]: With dead ends: 74 [2022-01-10 17:50:53,407 INFO L226 Difference]: Without dead ends: 58 [2022-01-10 17:50:53,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-10 17:50:53,407 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 35 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:50:53,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 66 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:50:53,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-01-10 17:50:53,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2022-01-10 17:50:53,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:50:53,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-01-10 17:50:53,418 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 29 [2022-01-10 17:50:53,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:50:53,418 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-01-10 17:50:53,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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-10 17:50:53,418 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-01-10 17:50:53,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 17:50:53,419 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:50:53,419 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:50:53,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-10 17:50:53,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:50:53,636 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:50:53,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:50:53,637 INFO L85 PathProgramCache]: Analyzing trace with hash -113419711, now seen corresponding path program 2 times [2022-01-10 17:50:53,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:50:53,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066967999] [2022-01-10 17:50:53,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:50:53,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:50:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:50:53,732 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 17:50:53,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:50:53,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066967999] [2022-01-10 17:50:53,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066967999] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:50:53,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031778175] [2022-01-10 17:50:53,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 17:50:53,733 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:50:53,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:50:53,752 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:50:53,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 17:50:53,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 17:50:53,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 17:50:53,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 17:50:53,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:50:54,131 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 17:50:54,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:50:54,187 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 17:50:54,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031778175] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:50:54,188 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:50:54,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-01-10 17:50:54,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342248375] [2022-01-10 17:50:54,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:50:54,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 17:50:54,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:50:54,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 17:50:54,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-10 17:50:54,189 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:50:54,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:50:54,324 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2022-01-10 17:50:54,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 17:50:54,325 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 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 33 [2022-01-10 17:50:54,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:50:54,325 INFO L225 Difference]: With dead ends: 82 [2022-01-10 17:50:54,325 INFO L226 Difference]: Without dead ends: 66 [2022-01-10 17:50:54,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-01-10 17:50:54,326 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 79 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:50:54,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 148 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 17:50:54,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-01-10 17:50:54,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 44. [2022-01-10 17:50:54,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:50:54,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2022-01-10 17:50:54,333 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 33 [2022-01-10 17:50:54,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:50:54,333 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2022-01-10 17:50:54,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:50:54,333 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-01-10 17:50:54,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 17:50:54,333 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:50:54,334 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:50:54,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-01-10 17:50:54,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:50:54,552 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:50:54,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:50:54,552 INFO L85 PathProgramCache]: Analyzing trace with hash 200927628, now seen corresponding path program 1 times [2022-01-10 17:50:54,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:50:54,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231082939] [2022-01-10 17:50:54,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:50:54,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:50:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:50:54,629 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 17:50:54,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:50:54,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231082939] [2022-01-10 17:50:54,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231082939] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:50:54,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763785953] [2022-01-10 17:50:54,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:50:54,630 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:50:54,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:50:54,631 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:50:54,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-10 17:50:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:50:54,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 17:50:54,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:50:55,012 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 17:50:55,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:50:58,071 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 17:50:58,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763785953] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:50:58,072 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:50:58,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 8] total 14 [2022-01-10 17:50:58,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725368737] [2022-01-10 17:50:58,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:50:58,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 17:50:58,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:50:58,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 17:50:58,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=137, Unknown=1, NotChecked=0, Total=182 [2022-01-10 17:50:58,073 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:50:58,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:50:58,204 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2022-01-10 17:50:58,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 17:50:58,204 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 0 states have call successors, (0), 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 34 [2022-01-10 17:50:58,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:50:58,205 INFO L225 Difference]: With dead ends: 74 [2022-01-10 17:50:58,205 INFO L226 Difference]: Without dead ends: 58 [2022-01-10 17:50:58,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=48, Invalid=161, Unknown=1, NotChecked=0, Total=210 [2022-01-10 17:50:58,206 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 63 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:50:58,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 198 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2022-01-10 17:50:58,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-01-10 17:50:58,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 44. [2022-01-10 17:50:58,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:50:58,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2022-01-10 17:50:58,212 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 34 [2022-01-10 17:50:58,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:50:58,212 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2022-01-10 17:50:58,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:50:58,212 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-01-10 17:50:58,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 17:50:58,213 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:50:58,213 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:50:58,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-10 17:50:58,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:50:58,414 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:50:58,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:50:58,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1184562543, now seen corresponding path program 2 times [2022-01-10 17:50:58,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:50:58,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891852030] [2022-01-10 17:50:58,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:50:58,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:50:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:50:59,579 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:50:59,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:50:59,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891852030] [2022-01-10 17:50:59,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891852030] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:50:59,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489354631] [2022-01-10 17:50:59,579 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 17:50:59,580 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:50:59,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:50:59,581 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:50:59,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-10 17:50:59,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 17:50:59,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 17:50:59,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 88 conjunts are in the unsatisfiable core [2022-01-10 17:50:59,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:50:59,918 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 17:51:00,026 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 17:51:00,026 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-01-10 17:51:00,120 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 17:51:00,346 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-01-10 17:51:00,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:00,362 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-01-10 17:51:00,500 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:51:00,501 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 8 [2022-01-10 17:51:00,568 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 17:51:00,771 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:51:00,773 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:51:00,773 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2022-01-10 17:51:00,885 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:51:00,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:51:01,075 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_538 (Array Int Int))) (<= (mod |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt| v_ArrVal_538) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (forall ((v_ArrVal_538 (Array Int Int))) (<= (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt| v_ArrVal_538) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296)))) is different from false [2022-01-10 17:51:01,108 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_538 (Array Int Int))) (<= (mod |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296) (select (select (store |c_#memory_intInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| 4) 18446744073709551616)) v_ArrVal_538) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (forall ((v_ArrVal_538 (Array Int Int))) (<= (select (select (store |c_#memory_intInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| 4) 18446744073709551616)) v_ArrVal_538) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296)))) is different from false [2022-01-10 17:51:01,124 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_538 (Array Int Int))) (<= (select (select (store |c_#memory_intInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616)) v_ArrVal_538) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296))) (forall ((v_ArrVal_538 (Array Int Int))) (<= (mod |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296) (select (select (store |c_#memory_intInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616)) v_ArrVal_538) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)))) is different from false [2022-01-10 17:51:01,143 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:51:01,143 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-01-10 17:51:01,150 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:51:01,150 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 69 [2022-01-10 17:51:01,154 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2022-01-10 17:51:01,212 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:51:01,213 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-01-10 17:51:01,216 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2022-01-10 17:51:01,220 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2022-01-10 17:51:01,481 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-01-10 17:51:01,659 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-01-10 17:51:01,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489354631] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:51:01,659 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:51:01,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 19] total 50 [2022-01-10 17:51:01,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247216114] [2022-01-10 17:51:01,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:51:01,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-01-10 17:51:01,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:51:01,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-01-10 17:51:01,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2007, Unknown=3, NotChecked=276, Total=2450 [2022-01-10 17:51:01,661 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 50 states, 50 states have (on average 1.84) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:51:03,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:51:03,224 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2022-01-10 17:51:03,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-10 17:51:03,224 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.84) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 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 34 [2022-01-10 17:51:03,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:51:03,225 INFO L225 Difference]: With dead ends: 72 [2022-01-10 17:51:03,225 INFO L226 Difference]: Without dead ends: 70 [2022-01-10 17:51:03,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=464, Invalid=3451, Unknown=3, NotChecked=372, Total=4290 [2022-01-10 17:51:03,226 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 162 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 244 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 17:51:03,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 454 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 553 Invalid, 0 Unknown, 244 Unchecked, 0.4s Time] [2022-01-10 17:51:03,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-10 17:51:03,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 56. [2022-01-10 17:51:03,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 55 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:51:03,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-01-10 17:51:03,235 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 34 [2022-01-10 17:51:03,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:51:03,235 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-01-10 17:51:03,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.84) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:51:03,235 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-01-10 17:51:03,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 17:51:03,236 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:51:03,236 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:51:03,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-01-10 17:51:03,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:51:03,437 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:51:03,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:51:03,437 INFO L85 PathProgramCache]: Analyzing trace with hash -30251967, now seen corresponding path program 3 times [2022-01-10 17:51:03,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:51:03,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814728378] [2022-01-10 17:51:03,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:51:03,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:51:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:51:03,578 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 17:51:03,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:51:03,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814728378] [2022-01-10 17:51:03,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814728378] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:51:03,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887165176] [2022-01-10 17:51:03,579 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 17:51:03,579 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:51:03,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:51:03,580 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:51:03,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-10 17:51:04,867 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-10 17:51:04,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 17:51:04,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-10 17:51:04,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:51:04,997 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 17:51:04,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:51:05,202 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 17:51:05,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887165176] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:51:05,203 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:51:05,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 14 [2022-01-10 17:51:05,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316113491] [2022-01-10 17:51:05,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:51:05,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 17:51:05,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:51:05,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 17:51:05,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-01-10 17:51:05,204 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:51:05,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:51:05,432 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2022-01-10 17:51:05,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 17:51:05,433 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 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 35 [2022-01-10 17:51:05,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:51:05,433 INFO L225 Difference]: With dead ends: 106 [2022-01-10 17:51:05,433 INFO L226 Difference]: Without dead ends: 83 [2022-01-10 17:51:05,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-01-10 17:51:05,434 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 127 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 17:51:05,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 215 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 17:51:05,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-01-10 17:51:05,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2022-01-10 17:51:05,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:51:05,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2022-01-10 17:51:05,451 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 35 [2022-01-10 17:51:05,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:51:05,451 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2022-01-10 17:51:05,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:51:05,451 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-01-10 17:51:05,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 17:51:05,452 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:51:05,452 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:51:05,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-01-10 17:51:05,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-10 17:51:05,658 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:51:05,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:51:05,658 INFO L85 PathProgramCache]: Analyzing trace with hash -2011067167, now seen corresponding path program 4 times [2022-01-10 17:51:05,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:51:05,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054217611] [2022-01-10 17:51:05,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:51:05,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:51:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:51:05,798 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 17:51:05,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:51:05,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054217611] [2022-01-10 17:51:05,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054217611] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:51:05,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747228557] [2022-01-10 17:51:05,799 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 17:51:05,799 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:51:05,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:51:05,800 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:51:05,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-10 17:51:06,075 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 17:51:06,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 17:51:06,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 101 conjunts are in the unsatisfiable core [2022-01-10 17:51:06,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:51:06,105 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 17:51:06,160 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 17:51:06,161 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-01-10 17:51:06,223 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 17:51:06,382 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 17:51:06,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:06,389 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-01-10 17:51:06,581 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 17:51:06,582 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 42 [2022-01-10 17:51:06,584 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-01-10 17:51:06,636 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 8 [2022-01-10 17:51:06,682 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-10 17:51:06,808 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 17:51:06,847 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 17:51:06,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:51:06,948 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_752 (Array Int Int))) (= (mod |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt| v_ArrVal_752) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) is different from false [2022-01-10 17:51:06,955 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_752 (Array Int Int))) (= (mod |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296) (select (select (store |c_#memory_intInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| 4) 18446744073709551616)) v_ArrVal_752) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) is different from false [2022-01-10 17:51:06,960 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_752 (Array Int Int))) (= (select (select (store |c_#memory_intInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616)) v_ArrVal_752) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296))) is different from false [2022-01-10 17:51:06,973 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_751 (Array Int Int)) (v_ArrVal_750 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= (mod |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296) (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt| v_ArrVal_750) (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt| v_ArrVal_751) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616)) v_ArrVal_752) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) is different from false [2022-01-10 17:51:06,982 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_751 (Array Int Int)) (v_ArrVal_750 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| 4) 18446744073709551616)))) (store (store |c_#memory_intInt| .cse0 v_ArrVal_750) (select (select (store |c_#memory_$Pointer$.baseInt| .cse0 v_ArrVal_751) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616)) v_ArrVal_752)) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296))) is different from false [2022-01-10 17:51:06,989 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_751 (Array Int Int)) (v_ArrVal_750 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= (select (select (let ((.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse0 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse1))) (store (store |c_#memory_intInt| .cse0 v_ArrVal_750) (select (select (store |c_#memory_$Pointer$.baseInt| .cse0 v_ArrVal_751) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse1) v_ArrVal_752))) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296))) is different from false [2022-01-10 17:51:07,003 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:51:07,003 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 75 [2022-01-10 17:51:07,013 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:51:07,013 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 243 [2022-01-10 17:51:07,018 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 224 [2022-01-10 17:51:07,022 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 110 [2022-01-10 17:51:07,289 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-01-10 17:51:07,414 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 24 not checked. [2022-01-10 17:51:07,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747228557] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:51:07,415 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:51:07,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 21, 22] total 46 [2022-01-10 17:51:07,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148880509] [2022-01-10 17:51:07,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:51:07,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-01-10 17:51:07,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:51:07,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-01-10 17:51:07,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1427, Unknown=6, NotChecked=486, Total=2070 [2022-01-10 17:51:07,417 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 46 states, 46 states have (on average 2.347826086956522) internal successors, (108), 46 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:51:09,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:51:09,008 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-01-10 17:51:09,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-10 17:51:09,008 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.347826086956522) internal successors, (108), 46 states have internal predecessors, (108), 0 states have call successors, (0), 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 40 [2022-01-10 17:51:09,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:51:09,009 INFO L225 Difference]: With dead ends: 70 [2022-01-10 17:51:09,009 INFO L226 Difference]: Without dead ends: 45 [2022-01-10 17:51:09,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=578, Invalid=3100, Unknown=6, NotChecked=738, Total=4422 [2022-01-10 17:51:09,010 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 178 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 355 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 17:51:09,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 269 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 520 Invalid, 0 Unknown, 355 Unchecked, 0.4s Time] [2022-01-10 17:51:09,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-10 17:51:09,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-01-10 17:51:09,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.048780487804878) internal successors, (43), 41 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:51:09,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2022-01-10 17:51:09,021 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 40 [2022-01-10 17:51:09,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:51:09,021 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2022-01-10 17:51:09,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.347826086956522) internal successors, (108), 46 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:51:09,021 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2022-01-10 17:51:09,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-10 17:51:09,022 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:51:09,022 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:51:09,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-10 17:51:09,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:51:09,248 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:51:09,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:51:09,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2104946393, now seen corresponding path program 1 times [2022-01-10 17:51:09,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:51:09,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412052491] [2022-01-10 17:51:09,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:51:09,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:51:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:51:10,555 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:51:10,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:51:10,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412052491] [2022-01-10 17:51:10,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412052491] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:51:10,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486457578] [2022-01-10 17:51:10,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:51:10,556 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:51:10,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:51:10,557 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:51:10,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-10 17:51:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:51:10,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 109 conjunts are in the unsatisfiable core [2022-01-10 17:51:10,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:51:11,129 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 17:51:11,403 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 17:51:11,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:11,411 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-01-10 17:51:11,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:11,694 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 72 [2022-01-10 17:51:11,697 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2022-01-10 17:51:11,706 INFO L353 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2022-01-10 17:51:11,706 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 55 [2022-01-10 17:51:12,138 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2022-01-10 17:51:12,142 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 17 [2022-01-10 17:51:12,200 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 17:51:12,306 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:51:12,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:51:12,636 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 116 [2022-01-10 17:51:12,651 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 116 [2022-01-10 17:51:13,115 INFO L353 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-01-10 17:51:13,116 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 939 treesize of output 779 [2022-01-10 17:51:14,093 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-01-10 17:51:14,420 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:51:14,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486457578] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:51:14,420 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:51:14,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 59 [2022-01-10 17:51:14,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329939164] [2022-01-10 17:51:14,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:51:14,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-01-10 17:51:14,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:51:14,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-01-10 17:51:14,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=3206, Unknown=0, NotChecked=0, Total=3422 [2022-01-10 17:51:14,422 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand has 59 states, 59 states have (on average 1.9322033898305084) internal successors, (114), 59 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:51:19,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:51:19,257 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2022-01-10 17:51:19,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-10 17:51:19,258 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.9322033898305084) internal successors, (114), 59 states have internal predecessors, (114), 0 states have call successors, (0), 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 41 [2022-01-10 17:51:19,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:51:19,258 INFO L225 Difference]: With dead ends: 51 [2022-01-10 17:51:19,259 INFO L226 Difference]: Without dead ends: 46 [2022-01-10 17:51:19,260 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 43 SyntacticMatches, 8 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1162 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=936, Invalid=5870, Unknown=0, NotChecked=0, Total=6806 [2022-01-10 17:51:19,260 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 446 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 17:51:19,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [446 Valid, 293 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 543 Invalid, 0 Unknown, 120 Unchecked, 0.7s Time] [2022-01-10 17:51:19,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-10 17:51:19,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2022-01-10 17:51:19,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:51:19,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2022-01-10 17:51:19,271 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 41 [2022-01-10 17:51:19,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:51:19,272 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2022-01-10 17:51:19,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 1.9322033898305084) internal successors, (114), 59 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:51:19,272 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2022-01-10 17:51:19,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 17:51:19,272 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:51:19,272 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:51:19,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-10 17:51:19,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-10 17:51:19,487 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:51:19,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:51:19,487 INFO L85 PathProgramCache]: Analyzing trace with hash 851825532, now seen corresponding path program 2 times [2022-01-10 17:51:19,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:51:19,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236362799] [2022-01-10 17:51:19,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:51:19,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:51:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:51:19,582 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 17:51:19,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:51:19,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236362799] [2022-01-10 17:51:19,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236362799] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:51:19,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322919873] [2022-01-10 17:51:19,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 17:51:19,583 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:51:19,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:51:19,584 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:51:19,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-10 17:51:20,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 17:51:20,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 17:51:20,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-10 17:51:20,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:51:20,162 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 17:51:20,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:51:20,349 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 17:51:20,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322919873] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:51:20,350 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:51:20,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-01-10 17:51:20,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466635105] [2022-01-10 17:51:20,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:51:20,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 17:51:20,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:51:20,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 17:51:20,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-01-10 17:51:20,351 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:51:20,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:51:20,472 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2022-01-10 17:51:20,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 17:51:20,472 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 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 42 [2022-01-10 17:51:20,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:51:20,472 INFO L225 Difference]: With dead ends: 43 [2022-01-10 17:51:20,472 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 17:51:20,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-10 17:51:20,474 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 27 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:51:20,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 128 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 17:51:20,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 17:51:20,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 17:51:20,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:51:20,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 17:51:20,476 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2022-01-10 17:51:20,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:51:20,476 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 17:51:20,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:51:20,476 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 17:51:20,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 17:51:20,478 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 17:51:20,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-10 17:51:20,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-10 17:51:20,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 17:51:27,707 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 17:51:27,708 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 17:51:27,708 INFO L854 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse15 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)) (.cse17 (+ |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4))) (let ((.cse6 (select .cse15 (mod .cse17 18446744073709551616)))) (let ((.cse2 (<= |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| 0)) (.cse3 (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt|)) (.cse5 (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| (select |#validInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|))) (.cse7 (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|)) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 0)) (.cse9 (<= 0 .cse6)) (.cse10 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int|)) (.cse11 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int|)) (.cse0 (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 0)) (.cse12 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) (.cse13 (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| 1))) (or (let ((.cse4 (div (+ |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int| 1) 4294967296))) (and .cse0 .cse1 .cse2 .cse3 (<= (+ (* .cse4 4294967296) 1) |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int|) .cse5 (not (<= (+ .cse4 1) (div |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int| 2147483648))) (<= .cse6 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (let ((.cse16 (div |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 18446744073709551616))) (let ((.cse14 (* 18446744073709551616 .cse16))) (and .cse0 .cse2 .cse3 (<= .cse14 0) .cse5 (<= |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| .cse14) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= (select .cse15 (+ (* (- 18446744073709551616) .cse16) |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4)) 0) (not (= (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) (+ (* (div .cse17 18446744073709551616) (- 18446744073709551616)) |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4)) |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|))))) (and .cse0 .cse1 (<= 2 |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int|) .cse12 (<= |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int| 2) .cse13))))) [2022-01-10 17:51:27,708 INFO L858 garLoopResultBuilder]: For program point L585-4(lines 585 589) no Hoare annotation was computed. [2022-01-10 17:51:27,708 INFO L858 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2022-01-10 17:51:27,708 INFO L854 garLoopResultBuilder]: At program point L590(lines 583 591) the Hoare annotation is: (let ((.cse5 (div |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 18446744073709551616))) (let ((.cse0 (* 18446744073709551616 .cse5)) (.cse1 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.baseInt|)) (.cse3 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)) (.cse4 (+ |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4)) (.cse2 (+ |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt| 4))) (and (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|) (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt|) (<= |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt|) (<= .cse0 0) (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| (select |#validInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)) (<= |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| .cse0) (<= |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|) (<= (select .cse1 (+ |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt| (* (- 18446744073709551616) (div |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt| 18446744073709551616)) 4)) 0) (<= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 0) (<= 0 (select .cse1 (mod .cse2 18446744073709551616))) (<= 0 (select .cse3 (mod .cse4 18446744073709551616))) (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int|) (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int|) (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| 1) (<= (select .cse3 (+ (* (- 18446744073709551616) .cse5) |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4)) 0) (not (= (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) (+ (* (div .cse4 18446744073709551616) (- 18446744073709551616)) |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4)) |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)) (not (= |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.baseInt| (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.baseInt|) (+ |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt| (* (- 18446744073709551616) (div .cse2 18446744073709551616)) 4))))))) [2022-01-10 17:51:27,708 INFO L861 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2022-01-10 17:51:27,708 INFO L858 garLoopResultBuilder]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2022-01-10 17:51:27,709 INFO L854 garLoopResultBuilder]: At program point L618-3(lines 618 621) the Hoare annotation is: (let ((.cse29 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse35 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616)) (.cse36 (div |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 18446744073709551616))) (let ((.cse23 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)) (.cse32 (+ (* (- 18446744073709551616) .cse36) |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4)) (.cse33 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)) (.cse24 (+ |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4)) (.cse34 (* 18446744073709551616 .cse36)) (.cse13 (+ |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt| 4)) (.cse31 (select .cse29 .cse35)) (.cse30 (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse35))) (let ((.cse1 (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt|)) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt| 0)) (.cse11 (<= 0 .cse30)) (.cse21 (<= .cse30 0)) (.cse22 (not (= .cse31 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))) (.cse25 (not (= |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.baseInt| (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.baseInt|) (+ |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt| (* (- 18446744073709551616) (div .cse13 18446744073709551616)) 4))))) (.cse0 (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| 0)) (.cse3 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (.cse4 (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt|)) (.cse5 (<= .cse34 0)) (.cse6 (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| (select |#validInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|))) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| .cse34)) (.cse9 (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|)) (.cse12 (<= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 0)) (.cse14 (<= 0 (select .cse33 (mod .cse24 18446744073709551616)))) (.cse15 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int|)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 0)) (.cse17 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int|)) (.cse18 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) (.cse19 (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| 1)) (.cse20 (<= (select .cse33 .cse32) 0)) (.cse26 (not (= (select .cse23 .cse32) |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)))) (or (let ((.cse10 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.baseInt|))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (select .cse10 (+ |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt| (* (- 18446744073709551616) (div |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt| 18446744073709551616)) 4)) 0) .cse11 .cse12 (<= 0 (select .cse10 (mod .cse13 18446744073709551616))) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 0) .cse22 (not (= (select .cse23 (+ (* (div .cse24 18446744073709551616) (- 18446744073709551616)) |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4)) |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)) .cse25)) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 (exists ((|ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| Int)) (and (<= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt|) (= (mod |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296) (select (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt|)))) .cse12 .cse14 (= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) .cse15 .cse16 .cse17 .cse18 (= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int| 0) (= (mod |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296) |ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int|) .cse19 .cse20 .cse26 .cse21 (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt|) .cse22 (= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse25) (let ((.cse28 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296))) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (or (and (<= (let ((.cse27 (div (+ |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int| 1) 4294967296))) (+ (div (+ |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int| (* (- 4294967296) .cse27) 4294967295) 4294967296) .cse27)) 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int|)) (<= 4294967296 |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int|)) .cse7 .cse9 (= .cse28 |ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int|) .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt| (select .cse29 (+ (* (- 18446744073709551616) (div |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 18446744073709551616)) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4))) (= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| 0) .cse20 .cse26 (<= (+ (* 4294967296 (div |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648)) |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) (+ |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| (* (div |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 2147483648) 4294967296))) (= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| .cse30) (= 2 (select (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) 0)) (= .cse28 (select (select |#memory_intInt| .cse31) .cse30)))))))) [2022-01-10 17:51:27,709 INFO L854 garLoopResultBuilder]: At program point L581(lines 574 582) the Hoare annotation is: (let ((.cse0 (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 0)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| 0)) (.cse3 (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt|)) (.cse4 (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 0)) (.cse6 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int|)) (.cse7 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int|)) (.cse8 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) (.cse9 (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| 1))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 2 |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int|) .cse4 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int| 2) .cse9) (let ((.cse10 (div (+ |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int| 1) 4294967296)) (.cse11 (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) (mod (+ |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4) 18446744073709551616)))) (and .cse0 .cse1 .cse2 .cse3 (<= (+ (* .cse10 4294967296) 1) |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int|) (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| (select |#validInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)) (not (<= (+ .cse10 1) (div |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int| 2147483648))) (<= .cse11 0) (<= 1 |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) (= (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) (+ |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| (* (- 18446744073709551616) (div (+ |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 4) 18446744073709551616)) 4)) 0) .cse4 .cse5 (not (= |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt| |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|)) (<= 0 .cse11) .cse6 .cse7 .cse8 .cse9 (not (= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)) (< 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|))))) [2022-01-10 17:51:27,709 INFO L858 garLoopResultBuilder]: For program point L618-4(lines 618 621) no Hoare annotation was computed. [2022-01-10 17:51:27,709 INFO L854 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse38 (div |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 18446744073709551616)) (.cse34 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse31 (+ |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt| 4)) (.cse27 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse35 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)) (.cse33 (+ |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4)) (.cse29 (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse34)) (.cse37 (* 18446744073709551616 .cse38)) (.cse32 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)) (.cse36 (+ (* (- 18446744073709551616) .cse38) |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4))) (let ((.cse3 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (.cse10 (= (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296) |ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int|)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 0)) (.cse20 (not (= (select .cse32 .cse36) |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|))) (.cse24 (= 2 (select (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) 0))) (.cse0 (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|)) (.cse1 (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt|)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| 0)) (.cse4 (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt|)) (.cse5 (<= .cse37 0)) (.cse6 (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| (select |#validInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|))) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| .cse37)) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt| 0)) (.cse9 (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|)) (.cse11 (<= 0 .cse29)) (.cse12 (<= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 0)) (.cse13 (<= 0 (select .cse35 (mod .cse33 18446744073709551616)))) (.cse14 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int|)) (.cse16 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int|)) (.cse17 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) (.cse18 (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| 1)) (.cse28 (= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| 0)) (.cse19 (<= (select .cse35 .cse36) 0)) (.cse21 (<= .cse29 0)) (.cse22 (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt|)) (.cse23 (not (= (select .cse27 .cse34) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))) (.cse25 (= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse26 (not (= |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.baseInt| (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.baseInt|) (+ |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt| (* (- 18446744073709551616) (div .cse31 18446744073709551616)) 4)))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int| |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt| (select .cse27 (+ (* (- 18446744073709551616) (div |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 18446744073709551616)) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4))) (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int|) .cse28 (= (mod (+ |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int| 1) 4294967296) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) .cse19 .cse20 (<= (+ (* (div (+ 4294967294 |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) 4294967296) 4294967296) |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) (+ |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1)) (= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| .cse29) .cse23 .cse24 .cse26) (let ((.cse30 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.baseInt|))) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (select .cse30 (+ |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt| (* (- 18446744073709551616) (div |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt| 18446744073709551616)) 4)) 0) .cse11 .cse12 (<= 0 (select .cse30 (mod .cse31 18446744073709551616))) .cse13 .cse14 .cse16 .cse17 (= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int| 0) (= (mod |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296) |ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int|) .cse18 .cse28 .cse19 .cse21 .cse22 (= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 0) .cse23 (not (= (select .cse32 (+ (* (div .cse33 18446744073709551616) (- 18446744073709551616)) |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4)) |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)) .cse25 .cse26)))))) [2022-01-10 17:51:27,709 INFO L858 garLoopResultBuilder]: For program point L585-2(lines 585 589) no Hoare annotation was computed. [2022-01-10 17:51:27,709 INFO L854 garLoopResultBuilder]: At program point L622-3(lines 622 627) the Hoare annotation is: (let ((.cse41 (div |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 18446744073709551616)) (.cse39 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse42 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse4 (select .cse39 .cse42)) (.cse36 (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse42)) (.cse37 (+ (* (- 18446744073709551616) .cse41) |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4)) (.cse31 (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse2 (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|)) (.cse1 (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|)) (.cse38 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)) (.cse35 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296)) (.cse3 (select |#validInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)) (.cse40 (* 18446744073709551616 .cse41)) (.cse10 (* 4294967296 (div |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648)))) (let ((.cse7 (<= (+ .cse10 1) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|)) (.cse9 (not (< |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int| (* (mod |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int| 2147483648) 2)))) (.cse11 (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|)) (.cse12 (<= |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| 0)) (.cse0 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (.cse13 (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt|)) (.cse14 (<= .cse40 0)) (.cse15 (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| .cse3)) (.cse17 (<= |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| .cse40)) (.cse18 (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|)) (.cse19 (= .cse35 |ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int|)) (.cse20 (<= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 0)) (.cse21 (<= 0 (select .cse38 (mod (+ |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4) 18446744073709551616)))) (.cse34 (= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1)) (.cse22 (= .cse1 |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int|)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 0)) (.cse23 (= .cse2 |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int|)) (.cse6 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) (.cse24 (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| 1)) (.cse25 (= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt| (select .cse39 (+ (* (- 18446744073709551616) (div |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 18446744073709551616)) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4)))) (.cse8 (= (select .cse31 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) (mod |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296))) (.cse26 (= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| 0)) (.cse27 (<= (select .cse38 .cse37) 0)) (.cse28 (not (= (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) .cse37) |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|))) (.cse29 (= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| .cse36)) (.cse32 (= .cse35 (select (select |#memory_intInt| .cse4) .cse36))) (.cse33 (mod |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 2147483648)) (.cse30 (= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 0))) (or (and .cse0 (= .cse1 1) (= .cse2 1) (= 1 .cse3) (= .cse4 |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt|) .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ .cse10 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) (+ |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| (* (div |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 2147483648) 4294967296))) (not (= .cse4 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))) (and .cse11 .cse12 .cse0 .cse13 .cse14 .cse15 (or (and (<= (let ((.cse16 (div (+ |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int| 1) 4294967296))) (+ (div (+ |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int| (* (- 4294967296) .cse16) 4294967295) 4294967296) .cse16)) 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int|)) (<= 4294967296 |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int|)) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse5 .cse23 .cse6 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 (= 2 (select .cse31 0)) .cse32) (and (< 0 (+ (div (+ |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (* (- 2) .cse33) 1) 4294967296) 1)) .cse34 .cse7 .cse9) (and .cse11 .cse12 .cse0 .cse13 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|) .cse14 .cse15 (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~head#1.offsetInt|) .cse17 .cse18 (<= |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int| 0) .cse19 .cse20 .cse21 .cse34 .cse22 .cse5 .cse23 .cse6 (= 2 |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_#res#1Int|) .cse24 .cse25 .cse8 .cse26 (= 2 (select (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~head#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~head#1.offsetInt|)) .cse27 .cse28 (<= |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~head#1.offsetInt| 0) .cse29 (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int|) .cse32) (and (not (< |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (* 2 .cse33))) .cse30))))) [2022-01-10 17:51:27,709 INFO L858 garLoopResultBuilder]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2022-01-10 17:51:27,709 INFO L858 garLoopResultBuilder]: For program point L622-4(lines 622 627) no Hoare annotation was computed. [2022-01-10 17:51:27,709 INFO L854 garLoopResultBuilder]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse43 (div |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 18446744073709551616)) (.cse38 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse39 (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse38)) (.cse40 (+ (* (- 18446744073709551616) .cse43) |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4)) (.cse37 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse41 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)) (.cse36 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296)) (.cse42 (* 18446744073709551616 .cse43)) (.cse34 (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))) (let ((.cse3 (= 3 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|)) (.cse20 (= (select .cse34 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) (mod |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296))) (.cse27 (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int|)) (.cse0 (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| 0)) (.cse2 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (.cse4 (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt|)) (.cse5 (<= .cse42 0)) (.cse6 (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| (select |#validInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|))) (.cse7 (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~head#1.offsetInt|)) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| .cse42)) (.cse9 (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|)) (.cse10 (<= |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int| 0)) (.cse11 (= .cse36 |ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int|)) (.cse12 (<= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 0)) (.cse13 (<= 0 (select .cse41 (mod (+ |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4) 18446744073709551616)))) (.cse14 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int|)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 0)) (.cse16 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int|)) (.cse17 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) (.cse18 (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| 1)) (.cse19 (= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt| (select .cse37 (+ (* (- 18446744073709551616) (div |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 18446744073709551616)) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4)))) (.cse21 (= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| 0)) (.cse22 (select (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~head#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~head#1.offsetInt|)) (.cse23 (<= (select .cse41 .cse40) 0)) (.cse24 (not (= (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) .cse40) |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|))) (.cse26 (= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| .cse39)) (.cse28 (= .cse36 (select (select |#memory_intInt| (select .cse37 .cse38)) .cse39))) (.cse31 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|)) (.cse25 (<= |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~head#1.offsetInt| 0)) (.cse33 (= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 0)) (.cse35 (<= (* (mod |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int| 2147483648) 2) |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= (+ (* 4294967296 (div |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648)) 1) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) .cse18 .cse19 .cse20 .cse21 (= 3 .cse22) .cse23 .cse24 .cse25 (<= (+ (* (div (+ 4294967294 |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) 4294967296) 4294967296) |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) (+ |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1)) .cse26 .cse27 .cse28) (let ((.cse30 (mod (+ |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~head#1.offsetInt| 4) 18446744073709551616))) (let ((.cse29 (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~head#1.baseInt|) .cse30))) (and .cse0 .cse1 .cse2 (<= (div (+ (- 1) |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int|) (- 4294967296)) (div (+ (* (- 1) |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int|) 1) 4294967296)) .cse3 .cse4 .cse5 .cse6 (<= 0 .cse29) (< |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int| 4294967296) .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 (= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) (= (select (select |#memory_intInt| (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~head#1.baseInt|) .cse30)) .cse29) 3) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 (<= .cse29 0) .cse25 .cse26 .cse27 .cse28))) (and .cse0 .cse1 .cse2 .cse4 .cse31 .cse5 .cse6 (or (and (<= (let ((.cse32 (div (+ |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int| 1) 4294967296))) (+ (div (+ |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int| (* (- 4294967296) .cse32) 4294967295) 4294967296) .cse32)) 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int|)) (<= 4294967296 |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int|)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 (= 2 .cse22) .cse23 .cse24 .cse25 .cse26 .cse33 (= 2 (select .cse34 0)) .cse28 .cse35) (and (< 0 (+ (div (+ |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (* (- 2) (mod |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 2147483648)) 1) 4294967296) 1)) .cse31 (exists ((|ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| Int)) (and (<= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~head#1.offsetInt|) (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt|) (= (select (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~head#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt|) 2))) (= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int| 0) .cse25 .cse33 .cse35))))) [2022-01-10 17:51:27,710 INFO L858 garLoopResultBuilder]: For program point L606(lines 606 612) no Hoare annotation was computed. [2022-01-10 17:51:27,710 INFO L861 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2022-01-10 17:51:27,710 INFO L858 garLoopResultBuilder]: For program point L600-3(lines 600 603) no Hoare annotation was computed. [2022-01-10 17:51:27,710 INFO L858 garLoopResultBuilder]: For program point L618-2(lines 618 621) no Hoare annotation was computed. [2022-01-10 17:51:27,710 INFO L858 garLoopResultBuilder]: For program point L592(lines 592 598) no Hoare annotation was computed. [2022-01-10 17:51:27,710 INFO L854 garLoopResultBuilder]: At program point L604(lines 599 605) the Hoare annotation is: (let ((.cse38 (div |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 18446744073709551616)) (.cse33 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse34 (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse33)) (.cse35 (+ (* (- 18446744073709551616) .cse38) |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4)) (.cse32 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse36 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)) (.cse31 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296)) (.cse37 (* 18446744073709551616 .cse38))) (let ((.cse3 (<= (* (mod |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int| 2147483648) 2) |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int|)) (.cse4 (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| 0)) (.cse6 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (.cse7 (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt|)) (.cse0 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|)) (.cse8 (<= .cse37 0)) (.cse9 (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| (select |#validInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|))) (.cse10 (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~head#1.offsetInt|)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| .cse37)) (.cse12 (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|)) (.cse13 (= .cse31 |ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int|)) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 0)) (.cse15 (<= 0 (select .cse36 (mod (+ |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4) 18446744073709551616)))) (.cse16 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int|)) (.cse17 (<= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 0)) (.cse18 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int|)) (.cse19 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) (.cse1 (= 2 |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_#res#1Int|)) (.cse20 (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| 1)) (.cse21 (= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt| (select .cse32 (+ (* (- 18446744073709551616) (div |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 18446744073709551616)) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4)))) (.cse23 (= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| 0)) (.cse24 (select (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~head#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~head#1.offsetInt|)) (.cse25 (<= (select .cse36 .cse35) 0)) (.cse26 (not (= (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) .cse35) |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|))) (.cse27 (<= |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~head#1.offsetInt| 0)) (.cse28 (= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| .cse34)) (.cse2 (= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 0)) (.cse22 (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse29 (= .cse31 (select (select |#memory_intInt| (select .cse32 .cse33)) .cse34)))) (or (and (< 0 (+ (div (+ |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (* (- 2) (mod |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 2147483648)) 1) 4294967296) 1)) .cse0 .cse1 (= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int| 0) .cse2 .cse3) (and .cse4 .cse5 .cse6 (= 3 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= 3 |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_#res#1Int|) (<= (+ (* 4294967296 (div |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648)) 1) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) .cse20 .cse21 (= (select .cse22 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) (mod |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296)) .cse23 (= 3 .cse24) .cse25 .cse26 .cse27 (<= (+ (* (div (+ 4294967294 |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) 4294967296) 4294967296) |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) (+ |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1)) .cse28 .cse29 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse0 .cse8 .cse9 (or (and (<= (let ((.cse30 (div (+ |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int| 1) 4294967296))) (+ (div (+ |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int| (* (- 4294967296) .cse30) 4294967295) 4294967296) .cse30)) 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int|)) (<= 4294967296 |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int|)) .cse10 .cse11 .cse12 (<= |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int| 0) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse1 .cse20 .cse21 .cse23 (= 2 .cse24) .cse25 .cse26 .cse27 .cse28 .cse2 (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int|) (= 2 (select .cse22 0)) .cse29))))) [2022-01-10 17:51:27,710 INFO L861 garLoopResultBuilder]: At program point L631(lines 613 632) the Hoare annotation is: true [2022-01-10 17:51:27,710 INFO L858 garLoopResultBuilder]: For program point L624(lines 624 626) no Hoare annotation was computed. [2022-01-10 17:51:27,710 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 17:51:27,710 INFO L854 garLoopResultBuilder]: At program point L625(lines 613 632) the Hoare annotation is: false [2022-01-10 17:51:27,710 INFO L858 garLoopResultBuilder]: For program point L622-2(lines 622 627) no Hoare annotation was computed. [2022-01-10 17:51:27,710 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 17:51:27,710 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2022-01-10 17:51:27,712 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1] [2022-01-10 17:51:27,713 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 17:51:27,725 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Cannot access array with 64bit indices via 131bit term. at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.bvinttranslation.IntToBvBackTranslation.convertApplicationTerm(IntToBvBackTranslation.java:780) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:339) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation.IcfgTransformationObserver.lambda$0(IcfgTransformationObserver.java:355) at de.uni_freiburg.informatik.ultimate.icfgtransformer.IcfgTransformationBacktranslator.translateExpression(IcfgTransformationBacktranslator.java:113) at de.uni_freiburg.informatik.ultimate.icfgtransformer.IcfgTransformationBacktranslator.translateExpression(IcfgTransformationBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-01-10 17:51:27,733 INFO L158 Benchmark]: Toolchain (without parser) took 39057.28ms. Allocated memory was 217.1MB in the beginning and 444.6MB in the end (delta: 227.5MB). Free memory was 191.2MB in the beginning and 201.9MB in the end (delta: -10.8MB). Peak memory consumption was 270.5MB. Max. memory is 8.0GB. [2022-01-10 17:51:27,733 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 217.1MB. Free memory is still 179.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 17:51:27,733 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.47ms. Allocated memory is still 217.1MB. Free memory was 191.0MB in the beginning and 181.8MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-10 17:51:27,733 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.29ms. Allocated memory is still 217.1MB. Free memory was 181.8MB in the beginning and 179.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 17:51:27,734 INFO L158 Benchmark]: Boogie Preprocessor took 17.75ms. Allocated memory is still 217.1MB. Free memory was 179.7MB in the beginning and 178.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 17:51:27,734 INFO L158 Benchmark]: RCFGBuilder took 336.33ms. Allocated memory is still 217.1MB. Free memory was 177.9MB in the beginning and 164.0MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-01-10 17:51:27,734 INFO L158 Benchmark]: IcfgTransformer took 102.02ms. Allocated memory is still 217.1MB. Free memory was 164.0MB in the beginning and 158.7MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-10 17:51:27,734 INFO L158 Benchmark]: TraceAbstraction took 38186.65ms. Allocated memory was 217.1MB in the beginning and 444.6MB in the end (delta: 227.5MB). Free memory was 158.2MB in the beginning and 201.9MB in the end (delta: -43.8MB). Peak memory consumption was 238.6MB. Max. memory is 8.0GB. [2022-01-10 17:51:27,735 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.10ms. Allocated memory is still 217.1MB. Free memory is still 179.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 378.47ms. Allocated memory is still 217.1MB. Free memory was 191.0MB in the beginning and 181.8MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.29ms. Allocated memory is still 217.1MB. Free memory was 181.8MB in the beginning and 179.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.75ms. Allocated memory is still 217.1MB. Free memory was 179.7MB in the beginning and 178.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 336.33ms. Allocated memory is still 217.1MB. Free memory was 177.9MB in the beginning and 164.0MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * IcfgTransformer took 102.02ms. Allocated memory is still 217.1MB. Free memory was 164.0MB in the beginning and 158.7MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * TraceAbstraction took 38186.65ms. Allocated memory was 217.1MB in the beginning and 444.6MB in the end (delta: 227.5MB). Free memory was 158.2MB in the beginning and 201.9MB in the end (delta: -43.8MB). Peak memory consumption was 238.6MB. 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: 630]: 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, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.1s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1271 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1271 mSDsluCounter, 2212 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 785 IncrementalHoareTripleChecker+Unchecked, 1911 mSDsCounter, 387 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2196 IncrementalHoareTripleChecker+Invalid, 3368 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 387 mSolverCounterUnsat, 301 mSDtfsCounter, 2196 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 845 GetRequests, 498 SyntacticMatches, 26 SemanticMatches, 321 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 2856 ImplicationChecksByTransitivity, 14.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=9, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 135 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 37 NumberOfFragments, 3387 HoareAnnotationTreeSize, 12 FomulaSimplifications, 8510 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 12 FomulaSimplificationsInter, 6496 FormulaSimplificationTreeSizeReductionInter, 6.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 742 NumberOfCodeBlocks, 742 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1020 ConstructedInterpolants, 54 QuantifiedInterpolants, 13150 SizeOfPredicates, 171 NumberOfNonLiveVariables, 6077 ConjunctsInSsa, 439 ConjunctsInUnsatCore, 33 InterpolantComputations, 5 PerfectInterpolantSequences, 263/482 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - ExceptionOrErrorResult: AssertionError: Cannot access array with 64bit indices via 131bit term. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Cannot access array with 64bit indices via 131bit term.: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.bvinttranslation.IntToBvBackTranslation.convertApplicationTerm(IntToBvBackTranslation.java:780) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-01-10 17:51:27,767 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...