/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf -i ../../../trunk/examples/svcomp/list-simple/sll2n_update_all.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 05:28:16,871 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 05:28:16,873 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 05:28:16,928 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 05:28:16,928 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 05:28:16,929 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 05:28:16,930 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 05:28:16,932 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 05:28:16,933 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 05:28:16,934 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 05:28:16,935 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 05:28:16,935 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 05:28:16,936 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 05:28:16,937 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 05:28:16,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 05:28:16,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 05:28:16,949 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 05:28:16,953 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 05:28:16,960 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 05:28:16,962 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 05:28:16,963 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 05:28:16,966 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 05:28:16,966 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 05:28:16,967 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 05:28:16,969 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 05:28:16,969 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 05:28:16,970 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 05:28:16,970 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 05:28:16,971 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 05:28:16,971 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 05:28:16,972 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 05:28:16,972 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 05:28:16,973 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 05:28:16,973 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 05:28:16,974 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 05:28:16,974 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 05:28:16,983 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 05:28:16,984 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 05:28:16,984 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 05:28:16,985 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 05:28:16,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 05:28:16,988 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 05:28:17,017 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 05:28:17,017 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 05:28:17,017 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 05:28:17,017 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 05:28:17,018 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 05:28:17,018 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 05:28:17,018 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 05:28:17,019 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 05:28:17,019 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 05:28:17,019 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 05:28:17,019 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 05:28:17,019 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 05:28:17,019 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 05:28:17,019 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 05:28:17,020 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 05:28:17,020 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 05:28:17,020 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 05:28:17,020 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 05:28:17,020 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 05:28:17,020 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 05:28:17,020 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 05:28:17,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:28:17,021 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 05:28:17,021 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 05:28:17,021 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 05:28:17,021 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 05:28:17,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 05:28:17,021 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 05:28:17,021 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 05:28:17,022 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 05:28:17,022 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 05:28:17,022 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 05:28:17,023 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 05:28:17,023 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 05:28:17,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 05:28:17,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 05:28:17,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 05:28:17,247 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 05:28:17,247 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 05:28:17,248 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-11 05:28:17,301 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b25d9d60/50562b125e524aed8aee20d7f2d3123f/FLAG9f8030e71 [2022-01-11 05:28:17,690 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 05:28:17,690 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_update_all.i [2022-01-11 05:28:17,703 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b25d9d60/50562b125e524aed8aee20d7f2d3123f/FLAG9f8030e71 [2022-01-11 05:28:17,716 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b25d9d60/50562b125e524aed8aee20d7f2d3123f [2022-01-11 05:28:17,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 05:28:17,719 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 05:28:17,725 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 05:28:17,725 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 05:28:17,729 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 05:28:17,730 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:28:17" (1/1) ... [2022-01-11 05:28:17,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a55d220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:28:17, skipping insertion in model container [2022-01-11 05:28:17,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:28:17" (1/1) ... [2022-01-11 05:28:17,737 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 05:28:17,778 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 05:28:18,050 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-11 05:28:18,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:28:18,060 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 05:28:18,105 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-11 05:28:18,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:28:18,130 INFO L208 MainTranslator]: Completed translation [2022-01-11 05:28:18,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:28:18 WrapperNode [2022-01-11 05:28:18,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 05:28:18,132 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 05:28:18,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 05:28:18,133 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 05:28:18,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:28:18" (1/1) ... [2022-01-11 05:28:18,153 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:28:18" (1/1) ... [2022-01-11 05:28:18,171 INFO L137 Inliner]: procedures = 129, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2022-01-11 05:28:18,172 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 05:28:18,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 05:28:18,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 05:28:18,172 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 05:28:18,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:28:18" (1/1) ... [2022-01-11 05:28:18,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:28:18" (1/1) ... [2022-01-11 05:28:18,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:28:18" (1/1) ... [2022-01-11 05:28:18,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:28:18" (1/1) ... [2022-01-11 05:28:18,202 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:28:18" (1/1) ... [2022-01-11 05:28:18,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:28:18" (1/1) ... [2022-01-11 05:28:18,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:28:18" (1/1) ... [2022-01-11 05:28:18,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 05:28:18,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 05:28:18,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 05:28:18,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 05:28:18,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:28:18" (1/1) ... [2022-01-11 05:28:18,226 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:28:18,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:28:18,246 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 05:28:18,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 05:28:18,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-11 05:28:18,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-11 05:28:18,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 05:28:18,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-11 05:28:18,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-11 05:28:18,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-11 05:28:18,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-11 05:28:18,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 05:28:18,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 05:28:18,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 05:28:18,381 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 05:28:18,382 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 05:28:18,648 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 05:28:18,654 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 05:28:18,654 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-11 05:28:18,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:28:18 BoogieIcfgContainer [2022-01-11 05:28:18,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 05:28:18,656 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 05:28:18,656 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 05:28:18,658 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 05:28:18,660 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:28:18" (1/1) ... [2022-01-11 05:28:18,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:28:18 BasicIcfg [2022-01-11 05:28:18,754 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 05:28:18,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 05:28:18,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 05:28:18,758 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 05:28:18,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 05:28:17" (1/4) ... [2022-01-11 05:28:18,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fabfc7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:28:18, skipping insertion in model container [2022-01-11 05:28:18,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:28:18" (2/4) ... [2022-01-11 05:28:18,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fabfc7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:28:18, skipping insertion in model container [2022-01-11 05:28:18,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:28:18" (3/4) ... [2022-01-11 05:28:18,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fabfc7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 05:28:18, skipping insertion in model container [2022-01-11 05:28:18,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:28:18" (4/4) ... [2022-01-11 05:28:18,767 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.iTransformedIcfg [2022-01-11 05:28:18,770 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 05:28:18,771 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 05:28:18,805 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 05:28:18,811 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 05:28:18,811 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 05:28:18,823 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-11 05:28:18,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-11 05:28:18,828 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:28:18,828 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:28:18,829 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:28:18,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:28:18,838 INFO L85 PathProgramCache]: Analyzing trace with hash 670470688, now seen corresponding path program 1 times [2022-01-11 05:28:18,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:28:18,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244167405] [2022-01-11 05:28:18,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:28:18,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:28:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:28:19,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:28:19,027 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:28:19,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244167405] [2022-01-11 05:28:19,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244167405] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:28:19,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:28:19,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 05:28:19,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864691717] [2022-01-11 05:28:19,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:28:19,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-11 05:28:19,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:28:19,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-11 05:28:19,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-11 05:28:19,066 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-11 05:28:19,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:28:19,081 INFO L93 Difference]: Finished difference Result 52 states and 75 transitions. [2022-01-11 05:28:19,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-11 05:28:19,084 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-11 05:28:19,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:28:19,089 INFO L225 Difference]: With dead ends: 52 [2022-01-11 05:28:19,090 INFO L226 Difference]: Without dead ends: 23 [2022-01-11 05:28:19,092 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-11 05:28:19,097 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-11 05:28:19,098 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-11 05:28:19,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-11 05:28:19,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-01-11 05:28:19,128 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-11 05:28:19,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-01-11 05:28:19,130 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2022-01-11 05:28:19,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:28:19,131 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-01-11 05:28:19,131 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-11 05:28:19,133 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-01-11 05:28:19,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-11 05:28:19,133 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:28:19,133 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:28:19,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 05:28:19,134 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:28:19,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:28:19,134 INFO L85 PathProgramCache]: Analyzing trace with hash 617253185, now seen corresponding path program 1 times [2022-01-11 05:28:19,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:28:19,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524051218] [2022-01-11 05:28:19,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:28:19,135 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:28:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:28:19,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:28:19,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:28:19,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524051218] [2022-01-11 05:28:19,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524051218] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:28:19,286 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:28:19,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:28:19,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638564569] [2022-01-11 05:28:19,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:28:19,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 05:28:19,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:28:19,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 05:28:19,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:28:19,289 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-11 05:28:19,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:28:19,306 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-01-11 05:28:19,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 05:28:19,307 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-11 05:28:19,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:28:19,308 INFO L225 Difference]: With dead ends: 44 [2022-01-11 05:28:19,308 INFO L226 Difference]: Without dead ends: 28 [2022-01-11 05:28:19,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:28:19,315 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-11 05:28:19,316 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-11 05:28:19,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-11 05:28:19,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-01-11 05:28:19,324 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-11 05:28:19,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-01-11 05:28:19,327 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 13 [2022-01-11 05:28:19,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:28:19,330 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-01-11 05:28:19,331 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-11 05:28:19,331 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-01-11 05:28:19,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-11 05:28:19,332 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:28:19,332 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:28:19,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 05:28:19,332 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:28:19,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:28:19,333 INFO L85 PathProgramCache]: Analyzing trace with hash -539620311, now seen corresponding path program 1 times [2022-01-11 05:28:19,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:28:19,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587725318] [2022-01-11 05:28:19,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:28:19,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:28:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:28:19,601 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-11 05:28:19,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:28:19,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587725318] [2022-01-11 05:28:19,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587725318] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:28:19,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318812728] [2022-01-11 05:28:19,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:28:19,603 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:28:19,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:28:19,605 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:28:19,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-11 05:28:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:28:19,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-11 05:28:19,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:28:19,853 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-11 05:28:19,853 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-11 05:28:19,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318812728] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:28:19,859 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-11 05:28:19,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2022-01-11 05:28:19,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598232294] [2022-01-11 05:28:19,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:28:19,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 05:28:19,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:28:19,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 05:28:19,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-11 05:28:19,864 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-11 05:28:19,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:28:19,912 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-01-11 05:28:19,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 05:28:19,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-11 05:28:19,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:28:19,915 INFO L225 Difference]: With dead ends: 47 [2022-01-11 05:28:19,915 INFO L226 Difference]: Without dead ends: 37 [2022-01-11 05:28:19,916 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-11 05:28:19,919 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-11 05:28:19,920 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-11 05:28:19,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-11 05:28:19,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2022-01-11 05:28:19,930 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-11 05:28:19,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-01-11 05:28:19,932 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 18 [2022-01-11 05:28:19,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:28:19,933 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-01-11 05:28:19,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:28:19,933 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-01-11 05:28:19,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-11 05:28:19,934 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:28:19,934 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:28:19,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-11 05:28:20,147 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-11 05:28:20,148 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:28:20,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:28:20,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1842051929, now seen corresponding path program 1 times [2022-01-11 05:28:20,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:28:20,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133108947] [2022-01-11 05:28:20,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:28:20,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:28:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:28:20,336 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-11 05:28:20,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:28:20,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133108947] [2022-01-11 05:28:20,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133108947] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:28:20,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19143668] [2022-01-11 05:28:20,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:28:20,337 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:28:20,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:28:20,338 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-11 05:28:20,339 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-11 05:28:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:28:20,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 52 conjunts are in the unsatisfiable core [2022-01-11 05:28:20,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:28:20,725 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-11 05:28:20,962 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:28:20,965 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:28:20,966 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-11 05:28:21,012 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-11 05:28:21,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:28:21,120 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-11 05:28:21,304 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-11 05:28:21,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19143668] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:28:21,305 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:28:21,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 14, 13] total 27 [2022-01-11 05:28:21,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901682475] [2022-01-11 05:28:21,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:28:21,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-11 05:28:21,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:28:21,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-11 05:28:21,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2022-01-11 05:28:21,308 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-11 05:28:21,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:28:21,869 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2022-01-11 05:28:21,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-11 05:28:21,870 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-11 05:28:21,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:28:21,872 INFO L225 Difference]: With dead ends: 69 [2022-01-11 05:28:21,872 INFO L226 Difference]: Without dead ends: 52 [2022-01-11 05:28:21,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=230, Invalid=1252, Unknown=0, NotChecked=0, Total=1482 [2022-01-11 05:28:21,873 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 112 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-01-11 05:28:21,874 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.2s Time] [2022-01-11 05:28:21,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-11 05:28:21,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2022-01-11 05:28:21,880 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-11 05:28:21,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2022-01-11 05:28:21,881 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 23 [2022-01-11 05:28:21,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:28:21,882 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2022-01-11 05:28:21,882 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-11 05:28:21,882 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-01-11 05:28:21,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-11 05:28:21,883 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:28:21,883 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-11 05:28:21,910 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-11 05:28:22,107 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-11 05:28:22,108 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:28:22,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:28:22,108 INFO L85 PathProgramCache]: Analyzing trace with hash -66063596, now seen corresponding path program 1 times [2022-01-11 05:28:22,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:28:22,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330484106] [2022-01-11 05:28:22,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:28:22,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:28:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:28:22,260 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-11 05:28:22,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:28:22,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330484106] [2022-01-11 05:28:22,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330484106] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:28:22,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513960467] [2022-01-11 05:28:22,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:28:22,261 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:28:22,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:28:22,263 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-11 05:28:22,290 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-11 05:28:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:28:22,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-11 05:28:22,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:28:22,482 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-11 05:28:22,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:28:22,548 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-11 05:28:22,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513960467] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-11 05:28:22,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-11 05:28:22,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 11 [2022-01-11 05:28:22,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874326208] [2022-01-11 05:28:22,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:28:22,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 05:28:22,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:28:22,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 05:28:22,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-01-11 05:28:22,550 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-11 05:28:22,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:28:22,601 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-01-11 05:28:22,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 05:28:22,602 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-11 05:28:22,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:28:22,603 INFO L225 Difference]: With dead ends: 61 [2022-01-11 05:28:22,603 INFO L226 Difference]: Without dead ends: 53 [2022-01-11 05:28:22,604 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-11 05:28:22,604 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-11 05:28:22,605 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-11 05:28:22,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-11 05:28:22,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2022-01-11 05:28:22,617 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-11 05:28:22,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-01-11 05:28:22,619 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 29 [2022-01-11 05:28:22,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:28:22,619 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-01-11 05:28:22,620 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-11 05:28:22,620 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-01-11 05:28:22,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-11 05:28:22,620 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:28:22,620 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-11 05:28:22,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-11 05:28:22,821 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-11 05:28:22,821 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:28:22,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:28:22,822 INFO L85 PathProgramCache]: Analyzing trace with hash -2052579183, now seen corresponding path program 1 times [2022-01-11 05:28:22,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:28:22,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030595335] [2022-01-11 05:28:22,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:28:22,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:28:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:28:22,993 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-11 05:28:22,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:28:22,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030595335] [2022-01-11 05:28:22,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030595335] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:28:22,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109618914] [2022-01-11 05:28:22,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:28:22,994 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:28:22,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:28:22,995 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-11 05:28:22,997 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-11 05:28:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:28:23,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-11 05:28:23,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:28:23,192 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-11 05:28:23,192 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-11 05:28:23,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109618914] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:28:23,192 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-11 05:28:23,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2022-01-11 05:28:23,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981534339] [2022-01-11 05:28:23,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:28:23,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 05:28:23,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:28:23,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 05:28:23,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-11 05:28:23,194 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-11 05:28:23,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:28:23,233 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2022-01-11 05:28:23,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 05:28:23,233 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-11 05:28:23,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:28:23,236 INFO L225 Difference]: With dead ends: 74 [2022-01-11 05:28:23,236 INFO L226 Difference]: Without dead ends: 58 [2022-01-11 05:28:23,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-11 05:28:23,239 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-11 05:28:23,239 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-11 05:28:23,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-01-11 05:28:23,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2022-01-11 05:28:23,251 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-11 05:28:23,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-01-11 05:28:23,253 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 29 [2022-01-11 05:28:23,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:28:23,254 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-01-11 05:28:23,255 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-11 05:28:23,255 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-01-11 05:28:23,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-11 05:28:23,256 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:28:23,256 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-11 05:28:23,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-11 05:28:23,471 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-11 05:28:23,471 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:28:23,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:28:23,472 INFO L85 PathProgramCache]: Analyzing trace with hash -113419711, now seen corresponding path program 2 times [2022-01-11 05:28:23,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:28:23,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707079416] [2022-01-11 05:28:23,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:28:23,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:28:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:28:23,611 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-11 05:28:23,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:28:23,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707079416] [2022-01-11 05:28:23,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707079416] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:28:23,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200466790] [2022-01-11 05:28:23,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-11 05:28:23,613 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:28:23,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:28:23,620 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-11 05:28:23,621 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-11 05:28:23,898 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-11 05:28:23,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:28:23,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-11 05:28:23,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:28:24,054 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-11 05:28:24,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:28:24,134 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-11 05:28:24,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200466790] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:28:24,134 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:28:24,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-01-11 05:28:24,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792500187] [2022-01-11 05:28:24,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:28:24,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-11 05:28:24,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:28:24,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-11 05:28:24,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-11 05:28:24,136 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-11 05:28:24,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:28:24,312 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2022-01-11 05:28:24,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 05:28:24,313 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-11 05:28:24,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:28:24,314 INFO L225 Difference]: With dead ends: 82 [2022-01-11 05:28:24,314 INFO L226 Difference]: Without dead ends: 66 [2022-01-11 05:28:24,314 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-11 05:28:24,315 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-11 05:28:24,315 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-11 05:28:24,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-01-11 05:28:24,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 44. [2022-01-11 05:28:24,322 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-11 05:28:24,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2022-01-11 05:28:24,323 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 33 [2022-01-11 05:28:24,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:28:24,323 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2022-01-11 05:28:24,323 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-11 05:28:24,324 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-01-11 05:28:24,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-11 05:28:24,324 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:28:24,324 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-11 05:28:24,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-11 05:28:24,539 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-11 05:28:24,540 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:28:24,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:28:24,540 INFO L85 PathProgramCache]: Analyzing trace with hash 200927628, now seen corresponding path program 1 times [2022-01-11 05:28:24,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:28:24,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971104475] [2022-01-11 05:28:24,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:28:24,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:28:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:28:24,643 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-11 05:28:24,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:28:24,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971104475] [2022-01-11 05:28:24,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971104475] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:28:24,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946497845] [2022-01-11 05:28:24,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:28:24,644 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:28:24,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:28:24,645 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-11 05:28:24,647 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-11 05:28:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:28:24,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-11 05:28:24,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:28:25,095 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-11 05:28:25,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:28:28,321 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-11 05:28:28,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946497845] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:28:28,322 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:28:28,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 8] total 14 [2022-01-11 05:28:28,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475229837] [2022-01-11 05:28:28,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:28:28,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-11 05:28:28,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:28:28,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-11 05:28:28,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=137, Unknown=1, NotChecked=0, Total=182 [2022-01-11 05:28:28,323 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-11 05:28:28,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:28:28,469 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2022-01-11 05:28:28,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-11 05:28:28,469 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-11 05:28:28,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:28:28,470 INFO L225 Difference]: With dead ends: 74 [2022-01-11 05:28:28,470 INFO L226 Difference]: Without dead ends: 58 [2022-01-11 05:28:28,470 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-11 05:28:28,471 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-11 05:28:28,471 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-11 05:28:28,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-01-11 05:28:28,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 44. [2022-01-11 05:28:28,479 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-11 05:28:28,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2022-01-11 05:28:28,479 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 34 [2022-01-11 05:28:28,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:28:28,479 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2022-01-11 05:28:28,479 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-11 05:28:28,480 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-01-11 05:28:28,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-11 05:28:28,480 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:28:28,480 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-11 05:28:28,509 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-11 05:28:28,703 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-11 05:28:28,704 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:28:28,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:28:28,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1184562543, now seen corresponding path program 2 times [2022-01-11 05:28:28,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:28:28,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187733819] [2022-01-11 05:28:28,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:28:28,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:28:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:28:30,025 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-11 05:28:30,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:28:30,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187733819] [2022-01-11 05:28:30,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187733819] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:28:30,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887015685] [2022-01-11 05:28:30,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-11 05:28:30,026 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:28:30,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:28:30,028 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-11 05:28:30,033 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-11 05:28:30,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-11 05:28:30,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:28:30,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 88 conjunts are in the unsatisfiable core [2022-01-11 05:28:30,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:28:30,448 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-11 05:28:30,572 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:28:30,573 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-11 05:28:30,684 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-11 05:28:30,951 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-11 05:28:30,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:28:30,976 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-11 05:28:31,142 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:28:31,143 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-11 05:28:31,231 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-11 05:28:31,472 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:28:31,474 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:28:31,474 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-11 05:28:31,604 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-11 05:28:31,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:28:31,811 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-11 05:28:31,836 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-11 05:28:31,854 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-11 05:28:31,891 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:28:31,891 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-11 05:28:31,901 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:28:31,902 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-11 05:28:31,906 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-11 05:28:31,956 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:28:31,957 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-11 05:28:31,961 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-11 05:28:31,967 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-11 05:28:32,311 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-11 05:28:32,506 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-11 05:28:32,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887015685] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:28:32,506 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:28:32,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 19] total 50 [2022-01-11 05:28:32,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334860929] [2022-01-11 05:28:32,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:28:32,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-01-11 05:28:32,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:28:32,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-01-11 05:28:32,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2007, Unknown=3, NotChecked=276, Total=2450 [2022-01-11 05:28:32,509 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-11 05:28:34,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:28:34,322 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2022-01-11 05:28:34,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-11 05:28:34,323 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-11 05:28:34,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:28:34,323 INFO L225 Difference]: With dead ends: 72 [2022-01-11 05:28:34,323 INFO L226 Difference]: Without dead ends: 70 [2022-01-11 05:28:34,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=464, Invalid=3451, Unknown=3, NotChecked=372, Total=4290 [2022-01-11 05:28:34,325 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 162 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-01-11 05:28:34,326 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.5s Time] [2022-01-11 05:28:34,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-11 05:28:34,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 56. [2022-01-11 05:28:34,337 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-11 05:28:34,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-01-11 05:28:34,337 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 34 [2022-01-11 05:28:34,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:28:34,337 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-01-11 05:28:34,338 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-11 05:28:34,338 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-01-11 05:28:34,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-11 05:28:34,338 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:28:34,338 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-11 05:28:34,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-11 05:28:34,562 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-11 05:28:34,563 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:28:34,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:28:34,563 INFO L85 PathProgramCache]: Analyzing trace with hash -30251967, now seen corresponding path program 3 times [2022-01-11 05:28:34,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:28:34,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111597572] [2022-01-11 05:28:34,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:28:34,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:28:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:28:34,714 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-11 05:28:34,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:28:34,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111597572] [2022-01-11 05:28:34,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111597572] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:28:34,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847242767] [2022-01-11 05:28:34,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-11 05:28:34,715 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:28:34,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:28:34,716 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-11 05:28:34,717 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-11 05:28:36,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-11 05:28:36,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:28:36,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-11 05:28:36,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:28:36,262 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-11 05:28:36,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:28:36,491 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-11 05:28:36,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847242767] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:28:36,491 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:28:36,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 14 [2022-01-11 05:28:36,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103800633] [2022-01-11 05:28:36,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:28:36,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-11 05:28:36,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:28:36,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-11 05:28:36,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-01-11 05:28:36,492 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-11 05:28:36,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:28:36,754 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2022-01-11 05:28:36,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-11 05:28:36,755 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-11 05:28:36,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:28:36,755 INFO L225 Difference]: With dead ends: 106 [2022-01-11 05:28:36,755 INFO L226 Difference]: Without dead ends: 83 [2022-01-11 05:28:36,755 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-11 05:28:36,756 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 127 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-11 05:28:36,756 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-11 05:28:36,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-01-11 05:28:36,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2022-01-11 05:28:36,769 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-11 05:28:36,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2022-01-11 05:28:36,769 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 35 [2022-01-11 05:28:36,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:28:36,770 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2022-01-11 05:28:36,770 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-11 05:28:36,770 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-01-11 05:28:36,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-11 05:28:36,771 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:28:36,771 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-11 05:28:36,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-11 05:28:36,975 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-11 05:28:36,976 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:28:36,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:28:36,976 INFO L85 PathProgramCache]: Analyzing trace with hash -2011067167, now seen corresponding path program 4 times [2022-01-11 05:28:36,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:28:36,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786006345] [2022-01-11 05:28:36,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:28:36,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:28:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:28:37,139 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-11 05:28:37,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:28:37,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786006345] [2022-01-11 05:28:37,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786006345] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:28:37,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274587564] [2022-01-11 05:28:37,140 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-11 05:28:37,140 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:28:37,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:28:37,144 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-11 05:28:37,145 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-11 05:28:37,442 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-11 05:28:37,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:28:37,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 101 conjunts are in the unsatisfiable core [2022-01-11 05:28:37,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:28:37,465 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-11 05:28:37,534 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:28:37,535 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-11 05:28:37,617 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-11 05:28:37,832 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-11 05:28:37,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:28:37,842 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-11 05:28:38,031 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-11 05:28:38,031 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-11 05:28:38,036 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-11 05:28:38,109 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-11 05:28:38,162 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-11 05:28:38,299 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-11 05:28:38,344 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-11 05:28:38,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:28:38,459 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-11 05:28:38,472 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-11 05:28:38,482 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-11 05:28:38,501 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-11 05:28:38,515 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-11 05:28:38,524 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-11 05:28:38,546 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:28:38,546 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-11 05:28:38,560 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:28:38,560 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-11 05:28:38,566 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-11 05:28:38,571 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-11 05:28:38,880 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-11 05:28:39,015 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-11 05:28:39,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274587564] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:28:39,016 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:28:39,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 21, 22] total 46 [2022-01-11 05:28:39,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087865842] [2022-01-11 05:28:39,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:28:39,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-01-11 05:28:39,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:28:39,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-01-11 05:28:39,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1427, Unknown=6, NotChecked=486, Total=2070 [2022-01-11 05:28:39,018 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-11 05:28:40,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:28:40,590 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-01-11 05:28:40,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-11 05:28:40,590 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-11 05:28:40,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:28:40,591 INFO L225 Difference]: With dead ends: 70 [2022-01-11 05:28:40,591 INFO L226 Difference]: Without dead ends: 45 [2022-01-11 05:28:40,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=578, Invalid=3100, Unknown=6, NotChecked=738, Total=4422 [2022-01-11 05:28:40,593 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 178 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-11 05:28:40,593 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-11 05:28:40,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-11 05:28:40,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-01-11 05:28:40,604 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-11 05:28:40,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2022-01-11 05:28:40,605 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 40 [2022-01-11 05:28:40,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:28:40,605 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2022-01-11 05:28:40,605 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-11 05:28:40,605 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2022-01-11 05:28:40,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-11 05:28:40,606 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:28:40,606 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-11 05:28:40,632 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-11 05:28:40,824 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-11 05:28:40,824 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:28:40,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:28:40,824 INFO L85 PathProgramCache]: Analyzing trace with hash 2104946393, now seen corresponding path program 1 times [2022-01-11 05:28:40,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:28:40,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714976078] [2022-01-11 05:28:40,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:28:40,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:28:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:28:42,224 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-11 05:28:42,224 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:28:42,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714976078] [2022-01-11 05:28:42,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714976078] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:28:42,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553749204] [2022-01-11 05:28:42,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:28:42,225 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:28:42,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:28:42,226 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-11 05:28:42,227 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-11 05:28:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:28:42,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 109 conjunts are in the unsatisfiable core [2022-01-11 05:28:42,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:28:42,805 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-11 05:28:43,123 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-11 05:28:43,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:28:43,130 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-11 05:28:43,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:28:43,422 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-11 05:28:43,426 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-11 05:28:43,443 INFO L353 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2022-01-11 05:28:43,443 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-11 05:28:43,944 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-11 05:28:43,950 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-11 05:28:44,009 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-11 05:28:44,101 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-11 05:28:44,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:28:44,488 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-11 05:28:44,510 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-11 05:28:45,063 INFO L353 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-01-11 05:28:45,064 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-11 05:28:46,130 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-11 05:28:46,512 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-11 05:28:46,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553749204] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:28:46,513 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:28:46,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 59 [2022-01-11 05:28:46,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482130530] [2022-01-11 05:28:46,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:28:46,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-01-11 05:28:46,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:28:46,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-01-11 05:28:46,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=3206, Unknown=0, NotChecked=0, Total=3422 [2022-01-11 05:28:46,515 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-11 05:28:51,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:28:51,560 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2022-01-11 05:28:51,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-11 05:28:51,561 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-11 05:28:51,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:28:51,561 INFO L225 Difference]: With dead ends: 51 [2022-01-11 05:28:51,561 INFO L226 Difference]: Without dead ends: 46 [2022-01-11 05:28:51,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 43 SyntacticMatches, 8 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1162 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=936, Invalid=5870, Unknown=0, NotChecked=0, Total=6806 [2022-01-11 05:28:51,563 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-11 05:28:51,563 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-11 05:28:51,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-11 05:28:51,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2022-01-11 05:28:51,576 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-11 05:28:51,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2022-01-11 05:28:51,576 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 41 [2022-01-11 05:28:51,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:28:51,576 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2022-01-11 05:28:51,577 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-11 05:28:51,577 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2022-01-11 05:28:51,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-11 05:28:51,577 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:28:51,577 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-11 05:28:51,596 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-11 05:28:51,781 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-11 05:28:51,782 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:28:51,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:28:51,782 INFO L85 PathProgramCache]: Analyzing trace with hash 851825532, now seen corresponding path program 2 times [2022-01-11 05:28:51,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:28:51,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672649016] [2022-01-11 05:28:51,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:28:51,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:28:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:28:51,889 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-11 05:28:51,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:28:51,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672649016] [2022-01-11 05:28:51,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672649016] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:28:51,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876132266] [2022-01-11 05:28:51,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-11 05:28:51,890 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:28:51,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:28:51,892 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-11 05:28:51,902 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-11 05:28:52,388 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-11 05:28:52,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:28:52,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-11 05:28:52,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:28:52,522 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-11 05:28:52,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:28:52,666 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-11 05:28:52,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876132266] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:28:52,667 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:28:52,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-01-11 05:28:52,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862078086] [2022-01-11 05:28:52,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:28:52,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-11 05:28:52,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:28:52,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-11 05:28:52,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-01-11 05:28:52,668 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-11 05:28:52,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:28:52,773 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2022-01-11 05:28:52,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 05:28:52,774 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-11 05:28:52,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:28:52,774 INFO L225 Difference]: With dead ends: 43 [2022-01-11 05:28:52,774 INFO L226 Difference]: Without dead ends: 0 [2022-01-11 05:28:52,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-11 05:28:52,775 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-11 05:28:52,775 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-11 05:28:52,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-11 05:28:52,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-11 05:28:52,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:28:52,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-11 05:28:52,776 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2022-01-11 05:28:52,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:28:52,776 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-11 05:28:52,776 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-11 05:28:52,777 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-11 05:28:52,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-11 05:28:52,779 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-11 05:28:52,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-01-11 05:28:52,987 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-11 05:28:52,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-11 05:28:59,751 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-11 05:28:59,751 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-11 05:28:59,751 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-11 05:28:59,751 INFO L858 garLoopResultBuilder]: For program point L585-4(lines 585 589) no Hoare annotation was computed. [2022-01-11 05:28:59,752 INFO L858 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2022-01-11 05:28:59,752 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-11 05:28:59,752 INFO L861 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2022-01-11 05:28:59,752 INFO L858 garLoopResultBuilder]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2022-01-11 05:28:59,752 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-11 05:28:59,752 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-11 05:28:59,752 INFO L858 garLoopResultBuilder]: For program point L618-4(lines 618 621) no Hoare annotation was computed. [2022-01-11 05:28:59,753 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-11 05:28:59,753 INFO L858 garLoopResultBuilder]: For program point L585-2(lines 585 589) no Hoare annotation was computed. [2022-01-11 05:28:59,753 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-11 05:28:59,753 INFO L858 garLoopResultBuilder]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2022-01-11 05:28:59,753 INFO L858 garLoopResultBuilder]: For program point L622-4(lines 622 627) no Hoare annotation was computed. [2022-01-11 05:28:59,754 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-11 05:28:59,754 INFO L858 garLoopResultBuilder]: For program point L606(lines 606 612) no Hoare annotation was computed. [2022-01-11 05:28:59,754 INFO L861 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2022-01-11 05:28:59,754 INFO L858 garLoopResultBuilder]: For program point L600-3(lines 600 603) no Hoare annotation was computed. [2022-01-11 05:28:59,754 INFO L858 garLoopResultBuilder]: For program point L618-2(lines 618 621) no Hoare annotation was computed. [2022-01-11 05:28:59,754 INFO L858 garLoopResultBuilder]: For program point L592(lines 592 598) no Hoare annotation was computed. [2022-01-11 05:28:59,754 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-11 05:28:59,754 INFO L861 garLoopResultBuilder]: At program point L631(lines 613 632) the Hoare annotation is: true [2022-01-11 05:28:59,754 INFO L858 garLoopResultBuilder]: For program point L624(lines 624 626) no Hoare annotation was computed. [2022-01-11 05:28:59,754 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-11 05:28:59,754 INFO L854 garLoopResultBuilder]: At program point L625(lines 613 632) the Hoare annotation is: false [2022-01-11 05:28:59,754 INFO L858 garLoopResultBuilder]: For program point L622-2(lines 622 627) no Hoare annotation was computed. [2022-01-11 05:28:59,755 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-11 05:28:59,755 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2022-01-11 05:28:59,757 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1] [2022-01-11 05:28:59,758 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 05:28:59,770 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-11 05:28:59,777 INFO L158 Benchmark]: Toolchain (without parser) took 42058.07ms. Allocated memory was 212.9MB in the beginning and 429.9MB in the end (delta: 217.1MB). Free memory was 157.0MB in the beginning and 154.1MB in the end (delta: 2.9MB). Peak memory consumption was 226.6MB. Max. memory is 8.0GB. [2022-01-11 05:28:59,777 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 212.9MB. Free memory was 174.7MB in the beginning and 174.6MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 05:28:59,778 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.53ms. Allocated memory is still 212.9MB. Free memory was 156.8MB in the beginning and 175.3MB in the end (delta: -18.5MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. [2022-01-11 05:28:59,778 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.41ms. Allocated memory is still 212.9MB. Free memory was 175.3MB in the beginning and 173.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-11 05:28:59,778 INFO L158 Benchmark]: Boogie Preprocessor took 38.34ms. Allocated memory is still 212.9MB. Free memory was 173.3MB in the beginning and 171.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-11 05:28:59,778 INFO L158 Benchmark]: RCFGBuilder took 444.68ms. Allocated memory is still 212.9MB. Free memory was 171.2MB in the beginning and 157.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-01-11 05:28:59,778 INFO L158 Benchmark]: IcfgTransformer took 97.67ms. Allocated memory is still 212.9MB. Free memory was 157.5MB in the beginning and 151.8MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-11 05:28:59,779 INFO L158 Benchmark]: TraceAbstraction took 41021.46ms. Allocated memory was 212.9MB in the beginning and 429.9MB in the end (delta: 217.1MB). Free memory was 151.2MB in the beginning and 154.1MB in the end (delta: -2.8MB). Peak memory consumption was 221.0MB. Max. memory is 8.0GB. [2022-01-11 05:28:59,780 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.13ms. Allocated memory is still 212.9MB. Free memory was 174.7MB in the beginning and 174.6MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 406.53ms. Allocated memory is still 212.9MB. Free memory was 156.8MB in the beginning and 175.3MB in the end (delta: -18.5MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.41ms. Allocated memory is still 212.9MB. Free memory was 175.3MB in the beginning and 173.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.34ms. Allocated memory is still 212.9MB. Free memory was 173.3MB in the beginning and 171.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 444.68ms. Allocated memory is still 212.9MB. Free memory was 171.2MB in the beginning and 157.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 97.67ms. Allocated memory is still 212.9MB. Free memory was 157.5MB in the beginning and 151.8MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * TraceAbstraction took 41021.46ms. Allocated memory was 212.9MB in the beginning and 429.9MB in the end (delta: 217.1MB). Free memory was 151.2MB in the beginning and 154.1MB in the end (delta: -2.8MB). Peak memory consumption was 221.0MB. 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: 41.0s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1271 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1271 mSDsluCounter, 2212 SdHoareTripleChecker+Invalid, 2.0s 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, 16.1s 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.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 16.6s 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-11 05:28:59,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...