/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/list-simple/sll2n_update_all_reverse.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 06:09:52,872 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 06:09:52,874 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 06:09:52,935 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 06:09:52,935 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 06:09:52,936 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 06:09:52,937 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 06:09:52,939 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 06:09:52,940 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 06:09:52,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 06:09:52,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 06:09:52,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 06:09:52,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 06:09:52,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 06:09:52,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 06:09:52,946 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 06:09:52,946 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 06:09:52,951 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 06:09:52,957 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 06:09:52,961 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 06:09:52,962 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 06:09:52,965 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 06:09:52,966 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 06:09:52,967 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 06:09:52,968 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 06:09:52,969 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 06:09:52,969 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 06:09:52,969 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 06:09:52,970 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 06:09:52,970 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 06:09:52,971 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 06:09:52,971 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 06:09:52,972 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 06:09:52,972 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 06:09:52,973 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 06:09:52,973 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 06:09:52,974 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 06:09:52,974 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 06:09:52,974 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 06:09:52,991 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 06:09:52,992 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 06:09:52,993 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 06:09:53,019 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 06:09:53,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 06:09:53,020 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 06:09:53,020 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 06:09:53,020 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 06:09:53,021 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 06:09:53,021 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 06:09:53,021 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 06:09:53,021 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 06:09:53,021 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 06:09:53,021 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 06:09:53,021 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 06:09:53,022 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 06:09:53,022 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 06:09:53,022 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 06:09:53,022 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 06:09:53,022 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 06:09:53,022 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 06:09:53,022 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 06:09:53,022 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 06:09:53,022 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 06:09:53,022 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 06:09:53,022 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 06:09:53,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:09:53,023 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 06:09:53,023 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 06:09:53,023 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 06:09:53,023 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 06:09:53,023 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 06:09:53,023 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 06:09:53,023 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 06:09:53,023 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 06:09:53,023 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 06:09:53,024 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 06:09:53,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 06:09:53,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 06:09:53,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 06:09:53,285 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 06:09:53,285 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 06:09:53,287 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_update_all_reverse.i [2022-01-10 06:09:53,359 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e33f5b520/04841af09dcf4b878ae3916fc66b5bcb/FLAG74f35d8fd [2022-01-10 06:09:53,772 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 06:09:53,772 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_update_all_reverse.i [2022-01-10 06:09:53,783 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e33f5b520/04841af09dcf4b878ae3916fc66b5bcb/FLAG74f35d8fd [2022-01-10 06:09:53,792 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e33f5b520/04841af09dcf4b878ae3916fc66b5bcb [2022-01-10 06:09:53,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 06:09:53,795 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 06:09:53,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 06:09:53,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 06:09:53,803 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 06:09:53,804 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:09:53" (1/1) ... [2022-01-10 06:09:53,805 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56882081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:53, skipping insertion in model container [2022-01-10 06:09:53,805 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:09:53" (1/1) ... [2022-01-10 06:09:53,811 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 06:09:53,840 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 06:09:54,113 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_reverse.i[24236,24249] [2022-01-10 06:09:54,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:09:54,123 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 06:09:54,158 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_reverse.i[24236,24249] [2022-01-10 06:09:54,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:09:54,183 INFO L208 MainTranslator]: Completed translation [2022-01-10 06:09:54,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:54 WrapperNode [2022-01-10 06:09:54,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 06:09:54,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 06:09:54,185 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 06:09:54,185 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 06:09:54,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:54" (1/1) ... [2022-01-10 06:09:54,210 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:54" (1/1) ... [2022-01-10 06:09:54,240 INFO L137 Inliner]: procedures = 129, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2022-01-10 06:09:54,240 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 06:09:54,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 06:09:54,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 06:09:54,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 06:09:54,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:54" (1/1) ... [2022-01-10 06:09:54,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:54" (1/1) ... [2022-01-10 06:09:54,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:54" (1/1) ... [2022-01-10 06:09:54,253 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:54" (1/1) ... [2022-01-10 06:09:54,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:54" (1/1) ... [2022-01-10 06:09:54,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:54" (1/1) ... [2022-01-10 06:09:54,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:54" (1/1) ... [2022-01-10 06:09:54,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 06:09:54,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 06:09:54,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 06:09:54,282 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 06:09:54,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:54" (1/1) ... [2022-01-10 06:09:54,288 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:09:54,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 06:09:54,306 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 06:09:54,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 06:09:54,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 06:09:54,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 06:09:54,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 06:09:54,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 06:09:54,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 06:09:54,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 06:09:54,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 06:09:54,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 06:09:54,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 06:09:54,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 06:09:54,519 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 06:09:54,520 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 06:09:54,750 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 06:09:54,754 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 06:09:54,755 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-10 06:09:54,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:09:54 BoogieIcfgContainer [2022-01-10 06:09:54,756 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 06:09:54,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 06:09:54,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 06:09:54,762 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 06:09:54,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:09:53" (1/3) ... [2022-01-10 06:09:54,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@764c3b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:09:54, skipping insertion in model container [2022-01-10 06:09:54,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:54" (2/3) ... [2022-01-10 06:09:54,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@764c3b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:09:54, skipping insertion in model container [2022-01-10 06:09:54,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:09:54" (3/3) ... [2022-01-10 06:09:54,763 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2022-01-10 06:09:54,767 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 06:09:54,767 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 06:09:54,817 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 06:09:54,822 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 06:09:54,822 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 06:09:54,833 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 29 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:09:54,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 06:09:54,837 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:54,837 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:09:54,837 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:54,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:54,841 INFO L85 PathProgramCache]: Analyzing trace with hash -204150994, now seen corresponding path program 1 times [2022-01-10 06:09:54,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:54,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967658660] [2022-01-10 06:09:54,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:54,849 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:54,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:54,851 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:09:54,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 06:09:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:54,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 06:09:54,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:55,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:09:55,000 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:09:55,001 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:55,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967658660] [2022-01-10 06:09:55,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967658660] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:09:55,002 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:09:55,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 06:09:55,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504235119] [2022-01-10 06:09:55,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:09:55,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 06:09:55,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:55,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 06:09:55,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 06:09:55,038 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 29 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:09:55,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:55,054 INFO L93 Difference]: Finished difference Result 52 states and 75 transitions. [2022-01-10 06:09:55,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 06:09:55,056 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-10 06:09:55,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:55,066 INFO L225 Difference]: With dead ends: 52 [2022-01-10 06:09:55,066 INFO L226 Difference]: Without dead ends: 23 [2022-01-10 06:09:55,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 06:09:55,072 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:55,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:09:55,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-10 06:09:55,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-01-10 06:09:55,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:09:55,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-01-10 06:09:55,094 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2022-01-10 06:09:55,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:55,094 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-01-10 06:09:55,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:09:55,094 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-01-10 06:09:55,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 06:09:55,095 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:55,095 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:09:55,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 06:09:55,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:09:55,302 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:55,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:55,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1517700322, now seen corresponding path program 1 times [2022-01-10 06:09:55,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:55,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754281847] [2022-01-10 06:09:55,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:55,304 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:55,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:55,305 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:09:55,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 06:09:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:55,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:09:55,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:55,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:09:55,419 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:09:55,419 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:55,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754281847] [2022-01-10 06:09:55,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1754281847] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:09:55,420 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:09:55,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:09:55,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462085335] [2022-01-10 06:09:55,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:09:55,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:09:55,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:55,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:09:55,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:09:55,422 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:09:55,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:55,433 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-01-10 06:09:55,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:09:55,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-10 06:09:55,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:55,435 INFO L225 Difference]: With dead ends: 44 [2022-01-10 06:09:55,435 INFO L226 Difference]: Without dead ends: 28 [2022-01-10 06:09:55,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:09:55,436 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:55,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 48 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:09:55,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-10 06:09:55,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-01-10 06:09:55,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:09:55,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-01-10 06:09:55,440 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 13 [2022-01-10 06:09:55,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:55,440 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-01-10 06:09:55,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:09:55,441 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-01-10 06:09:55,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 06:09:55,441 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:55,441 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:09:55,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-01-10 06:09:55,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:09:55,648 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:55,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:55,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1110902602, now seen corresponding path program 1 times [2022-01-10 06:09:55,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:55,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23211141] [2022-01-10 06:09:55,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:55,650 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:55,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:55,663 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:09:55,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 06:09:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:55,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 06:09:55,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:55,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:09:55,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:55,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:09:55,914 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:55,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23211141] [2022-01-10 06:09:55,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23211141] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:09:55,914 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:09:55,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-01-10 06:09:55,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936798622] [2022-01-10 06:09:55,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:09:55,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 06:09:55,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:55,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 06:09:55,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:09:55,916 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:09:55,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:55,948 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-01-10 06:09:55,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:09:55,949 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-10 06:09:55,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:55,950 INFO L225 Difference]: With dead ends: 49 [2022-01-10 06:09:55,950 INFO L226 Difference]: Without dead ends: 33 [2022-01-10 06:09:55,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:09:55,951 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 15 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:55,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 97 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:09:55,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-10 06:09:55,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2022-01-10 06:09:55,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:09:55,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-01-10 06:09:55,956 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 18 [2022-01-10 06:09:55,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:55,956 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-01-10 06:09:55,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:09:55,957 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-01-10 06:09:55,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 06:09:55,957 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:55,957 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:09:55,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 06:09:56,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:09:56,159 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:56,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:56,160 INFO L85 PathProgramCache]: Analyzing trace with hash 266893854, now seen corresponding path program 2 times [2022-01-10 06:09:56,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:56,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240523127] [2022-01-10 06:09:56,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:09:56,161 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:56,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:56,162 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:09:56,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 06:09:56,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 06:09:56,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:09:56,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 06:09:56,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:56,297 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 06:09:56,297 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:09:56,297 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:56,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240523127] [2022-01-10 06:09:56,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1240523127] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:09:56,297 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:09:56,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:09:56,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874249383] [2022-01-10 06:09:56,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:09:56,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:09:56,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:56,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:09:56,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:09:56,299 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:09:56,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:56,328 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-01-10 06:09:56,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 06:09:56,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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 23 [2022-01-10 06:09:56,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:56,329 INFO L225 Difference]: With dead ends: 51 [2022-01-10 06:09:56,329 INFO L226 Difference]: Without dead ends: 42 [2022-01-10 06:09:56,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:09:56,330 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 44 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:56,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 41 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:09:56,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-10 06:09:56,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2022-01-10 06:09:56,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:09:56,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-01-10 06:09:56,336 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 23 [2022-01-10 06:09:56,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:56,337 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-01-10 06:09:56,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:09:56,337 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-01-10 06:09:56,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 06:09:56,337 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:56,338 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] [2022-01-10 06:09:56,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-01-10 06:09:56,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:09:56,548 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:56,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:56,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1444962716, now seen corresponding path program 1 times [2022-01-10 06:09:56,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:56,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [792306914] [2022-01-10 06:09:56,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:56,549 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:56,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:56,552 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:09:56,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 06:09:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:56,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 06:09:56,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:56,759 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 06:09:56,759 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:09:56,759 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:56,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [792306914] [2022-01-10 06:09:56,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [792306914] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:09:56,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:09:56,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 06:09:56,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910346269] [2022-01-10 06:09:56,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:09:56,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:09:56,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:56,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:09:56,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:09:56,765 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:09:56,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:56,834 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-01-10 06:09:56,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:09:56,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-01-10 06:09:56,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:56,837 INFO L225 Difference]: With dead ends: 57 [2022-01-10 06:09:56,837 INFO L226 Difference]: Without dead ends: 43 [2022-01-10 06:09:56,839 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 06:09:56,842 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 44 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:56,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 59 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:09:56,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-10 06:09:56,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2022-01-10 06:09:56,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:09:56,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-01-10 06:09:56,858 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 28 [2022-01-10 06:09:56,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:56,859 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-01-10 06:09:56,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:09:56,859 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-01-10 06:09:56,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 06:09:56,860 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:56,860 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:09:56,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 06:09:57,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:09:57,072 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:57,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:57,073 INFO L85 PathProgramCache]: Analyzing trace with hash 46899759, now seen corresponding path program 1 times [2022-01-10 06:09:57,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:57,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [557889758] [2022-01-10 06:09:57,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:57,074 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:57,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:57,075 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:09:57,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 06:09:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:57,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:09:57,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:57,305 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 06:09:57,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:57,403 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 06:09:57,403 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:57,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [557889758] [2022-01-10 06:09:57,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [557889758] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:09:57,403 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:09:57,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-01-10 06:09:57,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633990418] [2022-01-10 06:09:57,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:09:57,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 06:09:57,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:57,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 06:09:57,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-10 06:09:57,405 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:09:57,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:57,495 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2022-01-10 06:09:57,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:09:57,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-01-10 06:09:57,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:57,496 INFO L225 Difference]: With dead ends: 65 [2022-01-10 06:09:57,496 INFO L226 Difference]: Without dead ends: 56 [2022-01-10 06:09:57,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-01-10 06:09:57,497 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 92 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:57,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 91 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:09:57,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-01-10 06:09:57,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 36. [2022-01-10 06:09:57,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:09:57,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-01-10 06:09:57,504 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 29 [2022-01-10 06:09:57,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:57,504 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-01-10 06:09:57,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:09:57,505 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-01-10 06:09:57,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 06:09:57,505 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:57,505 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:09:57,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-01-10 06:09:57,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:09:57,720 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:57,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:57,721 INFO L85 PathProgramCache]: Analyzing trace with hash 402168875, now seen corresponding path program 2 times [2022-01-10 06:09:57,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:57,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [406055754] [2022-01-10 06:09:57,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:09:57,721 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:57,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:57,722 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:09:57,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 06:09:57,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 06:09:57,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:09:57,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 06:09:57,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:57,868 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 06:09:57,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:09:57,869 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:57,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [406055754] [2022-01-10 06:09:57,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [406055754] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:09:57,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:09:57,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 06:09:57,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298640658] [2022-01-10 06:09:57,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:09:57,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:09:57,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:57,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:09:57,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:09:57,871 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:09:57,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:57,921 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-01-10 06:09:57,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:09:57,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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 34 [2022-01-10 06:09:57,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:57,922 INFO L225 Difference]: With dead ends: 53 [2022-01-10 06:09:57,922 INFO L226 Difference]: Without dead ends: 45 [2022-01-10 06:09:57,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 06:09:57,923 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 31 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:57,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 59 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:09:57,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-10 06:09:57,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2022-01-10 06:09:57,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:09:57,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-01-10 06:09:57,929 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 34 [2022-01-10 06:09:57,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:57,929 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-01-10 06:09:57,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:09:57,930 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-01-10 06:09:57,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 06:09:57,930 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:57,930 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, 1] [2022-01-10 06:09:57,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 06:09:58,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:09:58,144 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:58,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:58,145 INFO L85 PathProgramCache]: Analyzing trace with hash -366012659, now seen corresponding path program 1 times [2022-01-10 06:09:58,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:58,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156780257] [2022-01-10 06:09:58,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:58,146 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:58,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:58,160 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:09:58,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 06:09:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:58,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 62 conjunts are in the unsatisfiable core [2022-01-10 06:09:58,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:58,462 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 06:09:58,523 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 06:09:58,524 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 12 treesize of output 12 [2022-01-10 06:09:58,590 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 06:09:58,596 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 13 treesize of output 9 [2022-01-10 06:09:58,953 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 06:09:58,953 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 68 treesize of output 65 [2022-01-10 06:09:58,960 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 33 treesize of output 23 [2022-01-10 06:09:58,965 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 45 treesize of output 45 [2022-01-10 06:09:59,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:59,220 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 45 treesize of output 38 [2022-01-10 06:09:59,228 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 30 treesize of output 32 [2022-01-10 06:09:59,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:59,234 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 44 treesize of output 37 [2022-01-10 06:09:59,632 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 38 treesize of output 26 [2022-01-10 06:09:59,642 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 33 treesize of output 21 [2022-01-10 06:09:59,814 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 14 [2022-01-10 06:10:00,139 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 06:10:00,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:10:00,923 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_246 (_ BitVec 64)) (v_ArrVal_245 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_244 (_ BitVec 64))) (= (bvadd (_ bv4294967295 32) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 64)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_245) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_246)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_244)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) is different from false [2022-01-10 06:10:00,996 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_246 (_ BitVec 64)) (v_ArrVal_245 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_244 (_ BitVec 64))) (= (bvadd (_ bv4294967295 32) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 64)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_245) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_246) .cse0)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_244) .cse0))))) is different from false [2022-01-10 06:10:01,036 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:10:01,036 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 46 treesize of output 47 [2022-01-10 06:10:01,056 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:10:01,056 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 98 treesize of output 101 [2022-01-10 06:10:01,068 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 37 treesize of output 23 [2022-01-10 06:10:01,187 WARN L838 $PredicateComparison]: unable to prove that (and (= (bvadd (_ bv4294967295 32) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) |c_ULTIMATE.start_sll_update_at_~data#1|) (forall ((v_ArrVal_246 (_ BitVec 64)) (v_ArrVal_242 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_242) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_246) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 64))) |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (forall ((v_ArrVal_244 (_ BitVec 64)) (v_ArrVal_240 (Array (_ BitVec 64) (_ BitVec 64)))) (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_240) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_244) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 64))))) (forall ((v_ArrVal_246 (_ BitVec 64)) (v_ArrVal_242 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_242) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_246) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 64))))))) is different from false [2022-01-10 06:10:01,254 WARN L838 $PredicateComparison]: unable to prove that (and (= (bvadd (_ bv4294967295 32) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) |c_ULTIMATE.start_sll_update_at_~data#1|) (forall ((v_ArrVal_246 (_ BitVec 64)) (v_ArrVal_242 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (bvadd |c_ULTIMATE.start_sll_update_at_~head#1.offset| (_ bv4 64))))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_242) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_246) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 64)))))) (forall ((v_ArrVal_244 (_ BitVec 64)) (v_ArrVal_240 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_sll_update_at_~head#1.offset| (_ bv4 64)))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse1) v_ArrVal_240) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_244) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 64))) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse1)))) (forall ((v_ArrVal_246 (_ BitVec 64)) (v_ArrVal_242 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (bvadd |c_ULTIMATE.start_sll_update_at_~head#1.offset| (_ bv4 64))) v_ArrVal_242) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_246) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 64))) |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2022-01-10 06:10:01,291 WARN L838 $PredicateComparison]: unable to prove that (and (= (bvadd (_ bv4294967295 32) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (bvadd |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (forall ((v_ArrVal_246 (_ BitVec 64)) (v_ArrVal_242 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 64)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_242) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_246) .cse1))))) (forall ((v_ArrVal_246 (_ BitVec 64)) (v_ArrVal_242 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 64)))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_242) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_246) .cse2)) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_244 (_ BitVec 64)) (v_ArrVal_240 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 64)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) v_ArrVal_240) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_244) .cse3))))) is different from false [2022-01-10 06:10:01,347 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_246 (_ BitVec 64)) (v_ArrVal_242 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (let ((.cse0 (bvadd (_ bv4 64) |c_ULTIMATE.start_sll_create_#res#1.offset|))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse0) v_ArrVal_242) |c_ULTIMATE.start_sll_create_#res#1.base|) |c_ULTIMATE.start_sll_create_#res#1.offset| v_ArrVal_246) .cse0))))) (forall ((v_ArrVal_246 (_ BitVec 64)) (v_ArrVal_242 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (bvadd (_ bv4 64) |c_ULTIMATE.start_sll_create_#res#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2))) (= .cse1 (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_242) |c_ULTIMATE.start_sll_create_#res#1.base|) |c_ULTIMATE.start_sll_create_#res#1.offset| v_ArrVal_246) .cse2))))) (forall ((v_ArrVal_244 (_ BitVec 64)) (v_ArrVal_240 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (bvadd (_ bv4 64) |c_ULTIMATE.start_sll_create_#res#1.offset|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3) v_ArrVal_240) |c_ULTIMATE.start_sll_create_#res#1.base|) |c_ULTIMATE.start_sll_create_#res#1.offset| v_ArrVal_244) .cse3))))) is different from false [2022-01-10 06:10:01,381 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_246 (_ BitVec 64)) (v_ArrVal_242 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (let ((.cse0 (bvadd |c_ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 64)))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) v_ArrVal_242) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_246) .cse0)) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (forall ((v_ArrVal_246 (_ BitVec 64)) (v_ArrVal_242 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (bvadd |c_ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 64)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))) (= .cse1 (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_242) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_246) .cse2))))) (forall ((v_ArrVal_244 (_ BitVec 64)) (v_ArrVal_240 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 64)))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3) v_ArrVal_240) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_244) .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))))) is different from false [2022-01-10 06:10:01,449 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:10:01,450 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 25 treesize of output 26 [2022-01-10 06:10:01,452 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 42 treesize of output 38 [2022-01-10 06:10:01,456 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 06:10:01,459 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 11 treesize of output 7 [2022-01-10 06:10:01,463 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 38 treesize of output 30 [2022-01-10 06:10:01,480 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-01-10 06:10:01,480 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2022-01-10 06:10:01,488 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-01-10 06:10:01,488 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2022-01-10 06:10:01,782 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-01-10 06:10:01,782 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:10:01,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1156780257] [2022-01-10 06:10:01,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1156780257] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:10:01,782 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:10:01,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2022-01-10 06:10:01,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752335038] [2022-01-10 06:10:01,783 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:10:01,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-10 06:10:01,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:10:01,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-10 06:10:01,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=804, Unknown=7, NotChecked=434, Total=1332 [2022-01-10 06:10:01,784 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 37 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 37 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:10:04,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:10:04,885 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2022-01-10 06:10:04,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-10 06:10:04,885 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 37 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 35 [2022-01-10 06:10:04,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:10:04,889 INFO L225 Difference]: With dead ends: 62 [2022-01-10 06:10:04,889 INFO L226 Difference]: Without dead ends: 60 [2022-01-10 06:10:04,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=217, Invalid=1526, Unknown=7, NotChecked=602, Total=2352 [2022-01-10 06:10:04,891 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 42 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 229 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:10:04,891 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 342 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 415 Invalid, 0 Unknown, 229 Unchecked, 1.2s Time] [2022-01-10 06:10:04,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-10 06:10:04,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2022-01-10 06:10:04,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:10:04,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2022-01-10 06:10:04,921 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 35 [2022-01-10 06:10:04,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:10:04,921 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2022-01-10 06:10:04,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 37 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:10:04,921 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2022-01-10 06:10:04,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 06:10:04,922 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:10:04,922 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, 1] [2022-01-10 06:10:04,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-01-10 06:10:05,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:10:05,135 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:10:05,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:10:05,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1590163563, now seen corresponding path program 2 times [2022-01-10 06:10:05,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:10:05,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347894382] [2022-01-10 06:10:05,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:10:05,136 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:10:05,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:10:05,137 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:10:05,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 06:10:05,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:10:05,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:10:05,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:10:05,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:10:05,331 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 06:10:05,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:10:05,482 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 06:10:05,483 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:10:05,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347894382] [2022-01-10 06:10:05,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347894382] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:10:05,483 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:10:05,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-01-10 06:10:05,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50598725] [2022-01-10 06:10:05,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:10:05,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 06:10:05,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:10:05,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 06:10:05,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-01-10 06:10:05,484 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:10:05,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:10:05,670 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2022-01-10 06:10:05,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 06:10:05,671 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 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 36 [2022-01-10 06:10:05,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:10:05,672 INFO L225 Difference]: With dead ends: 95 [2022-01-10 06:10:05,672 INFO L226 Difference]: Without dead ends: 87 [2022-01-10 06:10:05,672 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2022-01-10 06:10:05,673 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 86 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:10:05,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 126 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:10:05,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-01-10 06:10:05,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 63. [2022-01-10 06:10:05,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 62 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:10:05,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2022-01-10 06:10:05,681 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 36 [2022-01-10 06:10:05,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:10:05,682 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2022-01-10 06:10:05,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:10:05,682 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-01-10 06:10:05,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 06:10:05,682 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:10:05,682 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, 1] [2022-01-10 06:10:05,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-01-10 06:10:05,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:10:05,891 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:10:05,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:10:05,892 INFO L85 PathProgramCache]: Analyzing trace with hash 108045400, now seen corresponding path program 3 times [2022-01-10 06:10:05,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:10:05,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661069261] [2022-01-10 06:10:05,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 06:10:05,893 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:10:05,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:10:05,904 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:10:05,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-01-10 06:10:06,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-10 06:10:06,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:10:06,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:10:06,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:10:06,225 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 06:10:06,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:10:06,325 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 06:10:06,325 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:10:06,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [661069261] [2022-01-10 06:10:06,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [661069261] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:10:06,325 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:10:06,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-01-10 06:10:06,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793770347] [2022-01-10 06:10:06,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:10:06,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 06:10:06,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:10:06,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 06:10:06,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-01-10 06:10:06,326 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:10:06,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:10:06,451 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2022-01-10 06:10:06,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 06:10:06,451 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 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 36 [2022-01-10 06:10:06,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:10:06,452 INFO L225 Difference]: With dead ends: 89 [2022-01-10 06:10:06,452 INFO L226 Difference]: Without dead ends: 65 [2022-01-10 06:10:06,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2022-01-10 06:10:06,453 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 121 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:10:06,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 78 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:10:06,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-10 06:10:06,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2022-01-10 06:10:06,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 62 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:10:06,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2022-01-10 06:10:06,460 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 36 [2022-01-10 06:10:06,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:10:06,460 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2022-01-10 06:10:06,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:10:06,460 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2022-01-10 06:10:06,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 06:10:06,461 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:10:06,461 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, 1] [2022-01-10 06:10:06,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-01-10 06:10:06,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:10:06,669 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:10:06,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:10:06,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1465345254, now seen corresponding path program 4 times [2022-01-10 06:10:06,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:10:06,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690879524] [2022-01-10 06:10:06,669 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 06:10:06,670 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:10:06,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:10:06,670 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:10:06,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-01-10 06:10:06,778 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 06:10:06,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:10:06,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:10:06,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:10:06,848 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 06:10:06,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:10:06,975 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 06:10:06,976 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:10:06,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690879524] [2022-01-10 06:10:06,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690879524] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:10:06,976 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:10:06,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-01-10 06:10:06,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8661216] [2022-01-10 06:10:06,976 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:10:06,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 06:10:06,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:10:06,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 06:10:06,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-01-10 06:10:06,977 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:10:07,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:10:07,227 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2022-01-10 06:10:07,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 06:10:07,228 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 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 36 [2022-01-10 06:10:07,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:10:07,228 INFO L225 Difference]: With dead ends: 111 [2022-01-10 06:10:07,229 INFO L226 Difference]: Without dead ends: 82 [2022-01-10 06:10:07,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2022-01-10 06:10:07,230 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 267 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:10:07,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 96 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:10:07,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-01-10 06:10:07,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 46. [2022-01-10 06:10:07,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:10:07,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-01-10 06:10:07,242 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 36 [2022-01-10 06:10:07,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:10:07,242 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-01-10 06:10:07,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:10:07,242 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-01-10 06:10:07,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-10 06:10:07,243 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:10:07,243 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:10:07,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-01-10 06:10:07,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:10:07,456 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:10:07,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:10:07,456 INFO L85 PathProgramCache]: Analyzing trace with hash -5958248, now seen corresponding path program 1 times [2022-01-10 06:10:07,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:10:07,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1574096355] [2022-01-10 06:10:07,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:10:07,457 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:10:07,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:10:07,458 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:10:07,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-01-10 06:10:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:10:07,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-10 06:10:07,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:10:07,706 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 06:10:07,919 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 14 [2022-01-10 06:10:08,019 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 06:10:08,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:10:08,240 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 36 treesize of output 32 [2022-01-10 06:10:08,414 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 06:10:08,415 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:10:08,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1574096355] [2022-01-10 06:10:08,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1574096355] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:10:08,415 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:10:08,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2022-01-10 06:10:08,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676045201] [2022-01-10 06:10:08,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:10:08,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-10 06:10:08,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:10:08,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-10 06:10:08,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2022-01-10 06:10:08,416 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:10:08,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:10:08,920 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2022-01-10 06:10:08,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 06:10:08,921 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-01-10 06:10:08,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:10:08,921 INFO L225 Difference]: With dead ends: 69 [2022-01-10 06:10:08,921 INFO L226 Difference]: Without dead ends: 67 [2022-01-10 06:10:08,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2022-01-10 06:10:08,922 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 98 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 06:10:08,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 271 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 167 Invalid, 0 Unknown, 43 Unchecked, 0.3s Time] [2022-01-10 06:10:08,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-10 06:10:08,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2022-01-10 06:10:08,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:10:08,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-01-10 06:10:08,933 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 41 [2022-01-10 06:10:08,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:10:08,933 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-01-10 06:10:08,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:10:08,933 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-01-10 06:10:08,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 06:10:08,934 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:10:08,934 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:10:08,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-01-10 06:10:09,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:10:09,144 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:10:09,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:10:09,144 INFO L85 PathProgramCache]: Analyzing trace with hash -133051584, now seen corresponding path program 2 times [2022-01-10 06:10:09,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:10:09,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597307144] [2022-01-10 06:10:09,144 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:10:09,144 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:10:09,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:10:09,145 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:10:09,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-01-10 06:10:09,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:10:09,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:10:09,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 06:10:09,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:10:09,372 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-10 06:10:09,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:10:09,505 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-10 06:10:09,506 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:10:09,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597307144] [2022-01-10 06:10:09,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597307144] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:10:09,506 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:10:09,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-01-10 06:10:09,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714724537] [2022-01-10 06:10:09,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:10:09,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 06:10:09,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:10:09,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 06:10:09,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-01-10 06:10:09,507 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:10:09,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:10:09,620 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-01-10 06:10:09,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 06:10:09,621 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-01-10 06:10:09,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:10:09,621 INFO L225 Difference]: With dead ends: 72 [2022-01-10 06:10:09,621 INFO L226 Difference]: Without dead ends: 63 [2022-01-10 06:10:09,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-01-10 06:10:09,622 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 43 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:10:09,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 113 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:10:09,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-10 06:10:09,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2022-01-10 06:10:09,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:10:09,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-01-10 06:10:09,630 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 42 [2022-01-10 06:10:09,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:10:09,630 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-01-10 06:10:09,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:10:09,630 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-01-10 06:10:09,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-10 06:10:09,630 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:10:09,630 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:10:09,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-01-10 06:10:09,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:10:09,831 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:10:09,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:10:09,831 INFO L85 PathProgramCache]: Analyzing trace with hash -316738156, now seen corresponding path program 3 times [2022-01-10 06:10:09,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:10:09,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741558731] [2022-01-10 06:10:09,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 06:10:09,832 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:10:09,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:10:09,833 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:10:09,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-01-10 06:10:09,995 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-10 06:10:09,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:10:10,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 29 conjunts are in the unsatisfiable core [2022-01-10 06:10:10,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:10:10,167 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 06:10:10,523 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 34 treesize of output 22 [2022-01-10 06:10:10,653 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-10 06:10:10,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:10:11,154 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 36 treesize of output 32 [2022-01-10 06:10:11,192 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 36 treesize of output 32 [2022-01-10 06:10:11,606 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-10 06:10:11,606 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:10:11,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741558731] [2022-01-10 06:10:11,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741558731] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:10:11,606 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:10:11,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2022-01-10 06:10:11,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630278779] [2022-01-10 06:10:11,607 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:10:11,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-10 06:10:11,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:10:11,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-10 06:10:11,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2022-01-10 06:10:11,607 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:10:13,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:10:13,097 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2022-01-10 06:10:13,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-10 06:10:13,098 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 0 states have call successors, (0), 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 46 [2022-01-10 06:10:13,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:10:13,098 INFO L225 Difference]: With dead ends: 66 [2022-01-10 06:10:13,098 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 06:10:13,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=217, Invalid=905, Unknown=0, NotChecked=0, Total=1122 [2022-01-10 06:10:13,099 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 53 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 06:10:13,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 102 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 144 Invalid, 0 Unknown, 3 Unchecked, 0.3s Time] [2022-01-10 06:10:13,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 06:10:13,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 06:10:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:10:13,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 06:10:13,100 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2022-01-10 06:10:13,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:10:13,100 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 06:10:13,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:10:13,100 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 06:10:13,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 06:10:13,102 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 06:10:13,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-01-10 06:10:13,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:10:13,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 06:10:17,936 INFO L861 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2022-01-10 06:10:17,936 INFO L858 garLoopResultBuilder]: For program point L622-2(lines 622 627) no Hoare annotation was computed. [2022-01-10 06:10:17,936 INFO L854 garLoopResultBuilder]: At program point L622-3(lines 622 627) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_sll_update_at_~index#1| (_ bv0 32))) (.cse2 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse5 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (or (let ((.cse3 (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv4 64)))) (let ((.cse4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) .cse3)) (.cse1 (bvmul (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))) (and .cse0 (= |ULTIMATE.start_main_~len~0#1| (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32))) (= (bvadd |ULTIMATE.start_sll_update_at_~data#1| (_ bv2 32)) .cse1) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_update_at_~head#1.base|) .cse2 (= (bvadd (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) .cse3)) .cse4)) .cse1) (= (_ bv0 64) .cse4) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|) (= .cse1 (bvadd .cse5 (_ bv2 32))) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 64))))) (let ((.cse6 (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|))) (and .cse0 (= (_ bv0 32) |ULTIMATE.start_sll_get_data_at_~index#1|) (not (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32))) (not (bvsge (bvadd .cse5 (_ bv4294967295 32) .cse6) (_ bv0 32))) .cse2 (not (bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (_ bv0 32))) (bvsge (bvadd .cse5 .cse6) (_ bv0 32)))))) [2022-01-10 06:10:17,936 INFO L858 garLoopResultBuilder]: For program point L622-4(lines 622 627) no Hoare annotation was computed. [2022-01-10 06:10:17,936 INFO L854 garLoopResultBuilder]: At program point L581(lines 574 582) the Hoare annotation is: (let ((.cse0 (= (_ bv0 64) |ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse1 (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_node_create_#res#1.base|)) (_ bv1 1)) (_ bv0 1))) (.cse2 (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|)) (_ bv1 1)))) (.cse3 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse4 (= (_ bv0 64) |ULTIMATE.start_node_create_#res#1.offset|))) (or (and (bvsgt |ULTIMATE.start_sll_create_~len#1| (_ bv0 32)) .cse0 (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|)) (_ bv1 1))) (not (= |ULTIMATE.start_node_create_#res#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) .cse1 .cse2 .cse3 (= (_ bv0 64) |ULTIMATE.start_sll_create_~head~0#1.offset|) .cse4) (and .cse0 (= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32)) .cse1 .cse2 .cse3 .cse4))) [2022-01-10 06:10:17,936 INFO L858 garLoopResultBuilder]: For program point L606(lines 606 612) no Hoare annotation was computed. [2022-01-10 06:10:17,937 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 06:10:17,937 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 06:10:17,937 INFO L861 garLoopResultBuilder]: At program point L631(lines 613 632) the Hoare annotation is: true [2022-01-10 06:10:17,937 INFO L854 garLoopResultBuilder]: At program point L590(lines 583 591) the Hoare annotation is: (let ((.cse1 (bvadd (_ bv4 64) |ULTIMATE.start_sll_create_#res#1.offset|)) (.cse0 (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 64)))) (and (= (_ bv0 64) |ULTIMATE.start_node_create_~temp~0#1.offset|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|)) (_ bv1 1))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) (_ bv0 64)) (not (= |ULTIMATE.start_sll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) .cse1)) (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_node_create_#res#1.base|)) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|)) (_ bv1 1))) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) .cse0))) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= (_ bv0 64) |ULTIMATE.start_sll_create_#res#1.offset|) (= (_ bv0 64) |ULTIMATE.start_sll_create_~head~0#1.offset|) (= (_ bv0 64) |ULTIMATE.start_node_create_#res#1.offset|))) [2022-01-10 06:10:17,937 INFO L854 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse12 (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv4 64)))) (let ((.cse6 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) .cse12)) (.cse5 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) .cse12))) (let ((.cse2 (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse3 (= |ULTIMATE.start_sll_update_at_~data#1| (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|))) (.cse9 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|)) (.cse0 (= |ULTIMATE.start_sll_update_at_~index#1| (_ bv0 32))) (.cse1 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse5))) (.cse7 (bvmul (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse11 (= |ULTIMATE.start_main_~len~0#1| (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)))) (.cse4 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse8 (= (_ bv0 64) .cse6)) (.cse10 (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 64)))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) .cse2 .cse3 .cse4 (= (bvadd (_ bv1 32) (select (select |#memory_int| .cse5) .cse6)) .cse7) .cse8 .cse9 .cse10) (and .cse1 .cse11 .cse2 .cse3 (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_sll_update_at_~index#1|) .cse4 .cse8 .cse9 .cse10) (and .cse0 .cse1 (= (bvadd |ULTIMATE.start_sll_update_at_~data#1| (_ bv1 32)) .cse7) (= .cse5 |ULTIMATE.start_sll_update_at_~head#1.base|) .cse11 (= |ULTIMATE.start_sll_update_at_~head#1.offset| .cse6) .cse4 .cse8 .cse10))))) [2022-01-10 06:10:17,937 INFO L858 garLoopResultBuilder]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2022-01-10 06:10:17,937 INFO L858 garLoopResultBuilder]: For program point L624(lines 624 626) no Hoare annotation was computed. [2022-01-10 06:10:17,937 INFO L854 garLoopResultBuilder]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse10 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse19 (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|)) (.cse20 (bvmul |ULTIMATE.start_main_~expected~0#1| (_ bv4294967295 32))) (.cse18 (bvmul (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))) (let ((.cse2 (= (_ bv0 32) |ULTIMATE.start_sll_get_data_at_~index#1|)) (.cse0 (= |ULTIMATE.start_sll_update_at_~index#1| (_ bv0 32))) (.cse3 (= |ULTIMATE.start_main_~len~0#1| (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)))) (.cse4 (= (bvadd |ULTIMATE.start_sll_update_at_~data#1| (_ bv2 32)) .cse18)) (.cse12 (not (bvsge (bvadd (_ bv4294967295 32) .cse19 .cse20 |ULTIMATE.start_sll_get_data_at_~index#1|) (_ bv0 32)))) (.cse5 (= |ULTIMATE.start_sll_get_data_at_~head#1.offset| (_ bv0 64))) (.cse6 (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse13 (= |ULTIMATE.start_main_~expected~0#1| (bvadd (_ bv2 32) |ULTIMATE.start_sll_get_data_at_~index#1|))) (.cse7 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse8 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|)) (.cse14 (bvsge (bvadd .cse19 .cse20 |ULTIMATE.start_sll_get_data_at_~index#1|) (_ bv0 32))) (.cse9 (= .cse18 (bvadd .cse10 (_ bv2 32))))) (or (and .cse0 (exists ((|ULTIMATE.start_main_~i~0#1| (_ BitVec 32))) (let ((.cse1 (bvmul |ULTIMATE.start_main_~i~0#1| (_ bv2 32)))) (and (= |ULTIMATE.start_main_~expected~0#1| (bvadd .cse1 (_ bv1 32))) (= (bvmul |ULTIMATE.start_main_~expected~0#1| (_ bv2 32)) (bvadd .cse1 (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) (_ bv0 64)) (_ bv1 32)))))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse11 (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|))) (and .cse0 .cse2 (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (not (bvsge (bvadd .cse10 (_ bv4294967295 32) .cse11) (_ bv0 32))) .cse12 .cse13 .cse7 .cse14 (bvsge (bvadd .cse10 .cse11) (_ bv0 32)))) (let ((.cse16 (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv4 64)))) (let ((.cse17 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) .cse16))) (and .cse0 (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_get_data_at_~head#1.base|) (_ bv4 64))) (= (_ bv1 32) |ULTIMATE.start_sll_get_data_at_~index#1|) .cse3 .cse4 .cse12 .cse5 .cse6 .cse13 (exists ((|ULTIMATE.start_main_~i~0#1| (_ BitVec 32))) (let ((.cse15 (bvmul |ULTIMATE.start_main_~i~0#1| (_ bv2 32)))) (and (= |ULTIMATE.start_main_~expected~0#1| (bvadd .cse15 (_ bv1 32))) (= (bvmul |ULTIMATE.start_main_~expected~0#1| (_ bv2 32)) (bvadd .cse15 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|) (_ bv4 64))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_get_data_at_~head#1.base|) (_ bv4 64))) (_ bv1 32)))))) .cse7 (= (bvadd (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) .cse16)) .cse17)) .cse18) (= (_ bv0 64) .cse17) .cse8 .cse14 .cse9 (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 64)))))))) [2022-01-10 06:10:17,937 INFO L858 garLoopResultBuilder]: For program point L600-3(lines 600 603) no Hoare annotation was computed. [2022-01-10 06:10:17,937 INFO L854 garLoopResultBuilder]: At program point L625(lines 613 632) the Hoare annotation is: false [2022-01-10 06:10:17,937 INFO L858 garLoopResultBuilder]: For program point L592(lines 592 598) no Hoare annotation was computed. [2022-01-10 06:10:17,937 INFO L858 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2022-01-10 06:10:17,937 INFO L858 garLoopResultBuilder]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2022-01-10 06:10:17,937 INFO L861 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2022-01-10 06:10:17,937 INFO L858 garLoopResultBuilder]: For program point L618-2(lines 618 621) no Hoare annotation was computed. [2022-01-10 06:10:17,937 INFO L858 garLoopResultBuilder]: For program point L585-2(lines 585 589) no Hoare annotation was computed. [2022-01-10 06:10:17,938 INFO L854 garLoopResultBuilder]: At program point L618-3(lines 618 621) the Hoare annotation is: (let ((.cse12 (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv4 64)))) (let ((.cse4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) .cse12))) (let ((.cse0 (= |ULTIMATE.start_sll_update_at_~index#1| (_ bv0 32))) (.cse3 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) .cse12)) (.cse1 (bvmul (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse5 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse6 (= (_ bv0 64) .cse4)) (.cse7 (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 64)))) (or (and .cse0 (= (bvadd |ULTIMATE.start_sll_update_at_~data#1| (_ bv1 32)) .cse1) (forall ((v_ArrVal_246 (_ BitVec 64)) (v_ArrVal_245 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_244 (_ BitVec 64))) (= (bvmul (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (bvadd (let ((.cse2 (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv4 64)))) (select (select (store |#memory_int| |ULTIMATE.start_main_~s~0#1.base| v_ArrVal_245) (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_246) .cse2)) (select (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_244) .cse2))) (_ bv1 32)))) (= .cse3 |ULTIMATE.start_sll_update_at_~head#1.base|) (= |ULTIMATE.start_sll_update_at_~head#1.offset| .cse4) .cse5 (= |ULTIMATE.start_main_~len~0#1| (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32))) .cse6 .cse7) (let ((.cse8 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (and .cse0 (= (bvadd |ULTIMATE.start_sll_update_at_~data#1| (_ bv2 32)) .cse1) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_update_at_~head#1.base|) (= .cse8 (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1| (_ bv1 32))) .cse5 (= (bvadd (_ bv1 32) (select (select |#memory_int| .cse3) .cse4)) .cse1) .cse6 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|) (= .cse1 (bvadd .cse8 (_ bv2 32))) .cse7)) (let ((.cse10 (bvadd (_ bv4 64) |ULTIMATE.start_sll_create_#res#1.offset|)) (.cse9 (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 64)))) (and (= (_ bv0 64) |ULTIMATE.start_node_create_~temp~0#1.offset|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|)) (_ bv1 1))) (= |ULTIMATE.start_main_~len~0#1| (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) .cse9) (_ bv0 64)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |ULTIMATE.start_node_create_#res#1.base|))) (_ bv1 1))) (not (= |ULTIMATE.start_sll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) .cse10))) (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) .cse10)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|)) (_ bv1 1))) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) .cse9))) .cse5 (= (_ bv0 64) |ULTIMATE.start_sll_create_#res#1.offset|) .cse6 (= (_ bv0 64) |ULTIMATE.start_sll_create_~head~0#1.offset|) (= (_ bv0 64) |ULTIMATE.start_node_create_#res#1.offset|) (forall ((v_ArrVal_246 (_ BitVec 64)) (v_ArrVal_242 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (let ((.cse11 (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv4 64)))) (select (store (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) .cse11) v_ArrVal_242) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset| v_ArrVal_246) .cse11)) |ULTIMATE.start_main_~s~0#1.base|))) .cse7)))))) [2022-01-10 06:10:17,938 INFO L854 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse0 (= (_ bv0 64) |ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse4 (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse3 (select |#valid| |ULTIMATE.start_node_create_#res#1.base|)) (.cse1 (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|)) (.cse5 (= (_ bv0 64) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse6 (= (_ bv0 64) |ULTIMATE.start_node_create_#res#1.offset|)) (.cse2 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))) (or (and .cse0 (= .cse1 (_ bv1 1)) .cse2 (= (bvadd |ULTIMATE.start_sll_create_~len#1| (_ bv1 32)) (_ bv2 32)) (= .cse3 (_ bv1 1)) (= .cse4 (_ bv1 1)) .cse5 .cse6) (let ((.cse7 (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 64)))) (and .cse0 (= (_ bv0 1) (bvadd (bvneg .cse4) (_ bv1 1))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) .cse7) (_ bv0 64)) (= (bvadd (bvneg .cse3) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg .cse1) (_ bv1 1))) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) .cse7))) .cse2 .cse5 .cse6)) (and (= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32)) .cse2))) [2022-01-10 06:10:17,938 INFO L858 garLoopResultBuilder]: For program point L618-4(lines 618 621) no Hoare annotation was computed. [2022-01-10 06:10:17,938 INFO L858 garLoopResultBuilder]: For program point L585-4(lines 585 589) no Hoare annotation was computed. [2022-01-10 06:10:17,938 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 06:10:17,938 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2022-01-10 06:10:17,938 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 06:10:17,938 INFO L854 garLoopResultBuilder]: At program point L604(lines 599 605) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_sll_update_at_~index#1| (_ bv0 32))) (.cse1 (= (_ bv0 32) |ULTIMATE.start_sll_get_data_at_~index#1|)) (.cse4 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse2 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (or (let ((.cse3 (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|))) (and .cse0 .cse1 (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (not (bvsge (bvadd .cse2 (_ bv4294967295 32) .cse3) (_ bv0 32))) .cse4 (exists ((|ULTIMATE.start_sll_get_data_at_~index#1| (_ BitVec 32))) (let ((.cse5 (bvmul |ULTIMATE.start_main_~expected~0#1| (_ bv4294967295 32)))) (and (bvsge |ULTIMATE.start_sll_get_data_at_~index#1| (_ bv0 32)) (not (bvsgt |ULTIMATE.start_sll_get_data_at_~index#1| (_ bv0 32))) (= |ULTIMATE.start_main_~expected~0#1| (bvadd (_ bv2 32) |ULTIMATE.start_sll_get_data_at_~index#1|)) (bvsge (bvadd |ULTIMATE.start_sll_get_data_at_#res#1| .cse5 |ULTIMATE.start_sll_get_data_at_~index#1|) (_ bv0 32)) (not (bvsge (bvadd |ULTIMATE.start_sll_get_data_at_#res#1| (_ bv4294967295 32) .cse5 |ULTIMATE.start_sll_get_data_at_~index#1|) (_ bv0 32)))))) (bvsge (bvadd .cse2 .cse3) (_ bv0 32)))) (let ((.cse6 (bvmul (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) .cse1 (= (bvadd |ULTIMATE.start_sll_update_at_~data#1| (_ bv2 32)) .cse6) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_update_at_~head#1.base|) .cse4 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|) (= .cse6 (bvadd .cse2 (_ bv2 32))) (exists ((|ULTIMATE.start_main_~i~0#1| (_ BitVec 32))) (let ((.cse7 (bvmul |ULTIMATE.start_main_~i~0#1| (_ bv2 32)))) (and (= |ULTIMATE.start_main_~expected~0#1| (bvadd .cse7 (_ bv1 32))) (= (bvmul |ULTIMATE.start_main_~expected~0#1| (_ bv2 32)) (bvadd |ULTIMATE.start_sll_get_data_at_#res#1| .cse7 (_ bv1 32)))))))))) [2022-01-10 06:10:17,940 INFO L732 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1] [2022-01-10 06:10:17,941 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 06:10:17,949 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,950 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,950 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,965 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,965 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,965 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,965 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,966 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,966 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,966 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,966 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,968 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_get_data_at_~index#1,QUANTIFIED] [2022-01-10 06:10:17,968 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_get_data_at_~index#1,QUANTIFIED] [2022-01-10 06:10:17,968 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_get_data_at_~index#1,QUANTIFIED] [2022-01-10 06:10:17,968 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_get_data_at_~index#1,QUANTIFIED] [2022-01-10 06:10:17,968 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_get_data_at_~index#1,QUANTIFIED] [2022-01-10 06:10:17,968 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:10:17,968 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:10:17,969 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_get_data_at_~index#1,QUANTIFIED] [2022-01-10 06:10:17,969 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_get_data_at_~index#1,QUANTIFIED] [2022-01-10 06:10:17,969 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_get_data_at_~index#1,QUANTIFIED] [2022-01-10 06:10:17,969 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_get_data_at_~index#1,QUANTIFIED] [2022-01-10 06:10:17,969 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_get_data_at_~index#1,QUANTIFIED] [2022-01-10 06:10:17,969 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:10:17,969 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:10:17,970 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,970 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,970 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,971 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,972 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_245,QUANTIFIED] [2022-01-10 06:10:17,972 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,972 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_246,QUANTIFIED] [2022-01-10 06:10:17,972 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,972 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_244,QUANTIFIED] [2022-01-10 06:10:17,972 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,972 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,972 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,972 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,973 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,973 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,973 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,973 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,973 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,973 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,973 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,973 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,973 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_242,QUANTIFIED] [2022-01-10 06:10:17,973 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,974 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_246,QUANTIFIED] [2022-01-10 06:10:17,975 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_245,QUANTIFIED] [2022-01-10 06:10:17,975 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,975 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_246,QUANTIFIED] [2022-01-10 06:10:17,975 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,975 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_244,QUANTIFIED] [2022-01-10 06:10:17,975 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,975 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,975 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,975 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,975 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,975 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,976 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,976 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,976 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,976 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,976 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,976 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,976 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_242,QUANTIFIED] [2022-01-10 06:10:17,976 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,976 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_246,QUANTIFIED] [2022-01-10 06:10:17,979 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:10:17,979 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:10:17,987 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,987 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:10:17,987 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:10:17,988 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,988 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,988 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,988 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,988 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,992 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:10:17,992 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:10:17,992 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,992 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:10:17,992 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:10:17,993 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,993 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,993 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,993 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,993 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,994 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,994 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,994 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,994 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,994 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,994 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,994 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,994 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,994 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,995 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,995 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,995 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,995 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,995 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,995 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,995 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,996 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,996 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:17,996 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,996 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:17,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:10:17 BoogieIcfgContainer [2022-01-10 06:10:17,996 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 06:10:17,997 INFO L158 Benchmark]: Toolchain (without parser) took 24201.49ms. Allocated memory was 201.3MB in the beginning and 331.4MB in the end (delta: 130.0MB). Free memory was 146.5MB in the beginning and 143.7MB in the end (delta: 2.8MB). Peak memory consumption was 161.1MB. Max. memory is 8.0GB. [2022-01-10 06:10:17,997 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory was 164.6MB in the beginning and 164.4MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 06:10:17,997 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.80ms. Allocated memory is still 201.3MB. Free memory was 146.2MB in the beginning and 165.2MB in the end (delta: -19.0MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. [2022-01-10 06:10:17,997 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.40ms. Allocated memory is still 201.3MB. Free memory was 165.2MB in the beginning and 163.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 06:10:17,998 INFO L158 Benchmark]: Boogie Preprocessor took 40.99ms. Allocated memory is still 201.3MB. Free memory was 163.1MB in the beginning and 161.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 06:10:17,998 INFO L158 Benchmark]: RCFGBuilder took 473.95ms. Allocated memory is still 201.3MB. Free memory was 161.0MB in the beginning and 147.4MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-01-10 06:10:17,998 INFO L158 Benchmark]: TraceAbstraction took 23239.25ms. Allocated memory was 201.3MB in the beginning and 331.4MB in the end (delta: 130.0MB). Free memory was 146.9MB in the beginning and 143.7MB in the end (delta: 3.1MB). Peak memory consumption was 162.5MB. Max. memory is 8.0GB. [2022-01-10 06:10:17,999 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory was 164.6MB in the beginning and 164.4MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 383.80ms. Allocated memory is still 201.3MB. Free memory was 146.2MB in the beginning and 165.2MB in the end (delta: -19.0MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.40ms. Allocated memory is still 201.3MB. Free memory was 165.2MB in the beginning and 163.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.99ms. Allocated memory is still 201.3MB. Free memory was 163.1MB in the beginning and 161.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 473.95ms. Allocated memory is still 201.3MB. Free memory was 161.0MB in the beginning and 147.4MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 23239.25ms. Allocated memory was 201.3MB in the beginning and 331.4MB in the end (delta: 130.0MB). Free memory was 146.9MB in the beginning and 143.7MB in the end (delta: 3.1MB). Peak memory consumption was 162.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_get_data_at_~index#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_get_data_at_~index#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_get_data_at_~index#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_get_data_at_~index#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_get_data_at_~index#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_get_data_at_~index#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_get_data_at_~index#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_get_data_at_~index#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_get_data_at_~index#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_get_data_at_~index#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_245,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_246,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_244,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_242,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_246,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_245,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_246,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_244,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_242,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_246,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * 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: 23.1s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 940 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 940 mSDsluCounter, 1559 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 275 IncrementalHoareTripleChecker+Unchecked, 1228 mSDsCounter, 205 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1024 IncrementalHoareTripleChecker+Invalid, 1504 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 205 mSolverCounterUnsat, 331 mSDtfsCounter, 1024 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 803 GetRequests, 602 SyntacticMatches, 5 SemanticMatches, 196 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=12, InterpolantAutomatonStates: 129, 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, 14 MinimizatonAttempts, 136 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 34 NumberOfFragments, 1228 HoareAnnotationTreeSize, 12 FomulaSimplifications, 12030 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 12 FomulaSimplificationsInter, 5007 FormulaSimplificationTreeSizeReductionInter, 4.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 430 NumberOfCodeBlocks, 394 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 726 ConstructedInterpolants, 25 QuantifiedInterpolants, 5195 SizeOfPredicates, 120 NumberOfNonLiveVariables, 1853 ConjunctsInSsa, 166 ConjunctsInUnsatCore, 23 InterpolantComputations, 5 PerfectInterpolantSequences, 286/371 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 - InvariantResult [Line: 622]: Loop Invariant [2022-01-10 06:10:18,005 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,006 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,006 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,006 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,006 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,006 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((index == 0bv32 && len == ~bvadd16(i, 1bv32)) && ~bvadd16(data, 2bv32) == ~bvmul32(2bv32, len)) && s == head) && 2bv32 == len) && ~bvadd16(1bv32, unknown-#memory_int-unknown[#memory_$Pointer$[s][~bvadd16(s, 4bv64)]][#memory_$Pointer$[s][~bvadd16(s, 4bv64)]]) == ~bvmul32(2bv32, len)) && 0bv64 == #memory_$Pointer$[s][~bvadd16(s, 4bv64)]) && s == head) && ~bvmul32(2bv32, len) == ~bvadd16(unknown-#memory_int-unknown[s][s], 2bv32)) && s == 0bv64) || ((((((index == 0bv32 && 0bv32 == index) && !~bvsgt32(i, 0bv32)) && !~bvsge32(~bvadd16(unknown-#memory_int-unknown[s][s], 4294967295bv32, ~bvmul32(4294967295bv32, len)), 0bv32)) && 2bv32 == len) && !~bvsgt32(~bvadd16(4294967295bv32, i), 0bv32)) && ~bvsge32(~bvadd16(unknown-#memory_int-unknown[s][s], ~bvmul32(4294967295bv32, len)), 0bv32)) - InvariantResult [Line: 583]: Loop Invariant [2022-01-10 06:10:18,007 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,007 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,007 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,007 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,007 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,007 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,008 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,008 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((0bv64 == temp && 0bv1 == ~bvadd16(~bvneg64(\valid[head]), 1bv1)) && #memory_$Pointer$[head][~bvadd16(head, 4bv64)] == 0bv64) && !(\result == #memory_$Pointer$[\result][~bvadd16(4bv64, \result)])) && 0bv64 == #memory_$Pointer$[\result][~bvadd16(4bv64, \result)]) && ~bvadd16(~bvneg64(\valid[\result]), 1bv1) == 0bv1) && 0bv1 == ~bvadd16(~bvneg64(\valid[temp]), 1bv1)) && !(head == #memory_$Pointer$[head][~bvadd16(head, 4bv64)])) && 2bv32 == len) && 0bv64 == \result) && 0bv64 == head) && 0bv64 == \result - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 599]: Loop Invariant [2022-01-10 06:10:18,008 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_get_data_at_~index#1,QUANTIFIED] [2022-01-10 06:10:18,008 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_get_data_at_~index#1,QUANTIFIED] [2022-01-10 06:10:18,008 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_get_data_at_~index#1,QUANTIFIED] [2022-01-10 06:10:18,008 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_get_data_at_~index#1,QUANTIFIED] [2022-01-10 06:10:18,008 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_get_data_at_~index#1,QUANTIFIED] [2022-01-10 06:10:18,008 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:10:18,008 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:10:18,009 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_get_data_at_~index#1,QUANTIFIED] [2022-01-10 06:10:18,009 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_get_data_at_~index#1,QUANTIFIED] [2022-01-10 06:10:18,009 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_get_data_at_~index#1,QUANTIFIED] [2022-01-10 06:10:18,009 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_get_data_at_~index#1,QUANTIFIED] [2022-01-10 06:10:18,009 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_sll_get_data_at_~index#1,QUANTIFIED] [2022-01-10 06:10:18,009 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:10:18,009 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] Derived loop invariant: ((((((index == 0bv32 && 0bv32 == index) && i == 0bv32) && !~bvsge32(~bvadd16(unknown-#memory_int-unknown[s][s], 4294967295bv32, ~bvmul32(4294967295bv32, len)), 0bv32)) && 2bv32 == len) && (\exists ULTIMATE.start_sll_get_data_at_~index#1 : bv32 :: (((~bvsge32(ULTIMATE.start_sll_get_data_at_~index#1, 0bv32) && !~bvsgt32(ULTIMATE.start_sll_get_data_at_~index#1, 0bv32)) && expected == ~bvadd16(2bv32, ULTIMATE.start_sll_get_data_at_~index#1)) && ~bvsge32(~bvadd16(\result, ~bvmul32(expected, 4294967295bv32), ULTIMATE.start_sll_get_data_at_~index#1), 0bv32)) && !~bvsge32(~bvadd16(\result, 4294967295bv32, ~bvmul32(expected, 4294967295bv32), ULTIMATE.start_sll_get_data_at_~index#1), 0bv32))) && ~bvsge32(~bvadd16(unknown-#memory_int-unknown[s][s], ~bvmul32(4294967295bv32, len)), 0bv32)) || ((((((((index == 0bv32 && i == 1bv32) && 0bv32 == index) && ~bvadd16(data, 2bv32) == ~bvmul32(2bv32, len)) && s == head) && 2bv32 == len) && s == head) && ~bvmul32(2bv32, len) == ~bvadd16(unknown-#memory_int-unknown[s][s], 2bv32)) && (\exists ULTIMATE.start_main_~i~0#1 : bv32 :: expected == ~bvadd16(~bvmul32(ULTIMATE.start_main_~i~0#1, 2bv32), 1bv32) && ~bvmul32(expected, 2bv32) == ~bvadd16(\result, ~bvmul32(ULTIMATE.start_main_~i~0#1, 2bv32), 1bv32))) - InvariantResult [Line: 585]: Loop Invariant [2022-01-10 06:10:18,010 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,010 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,010 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,010 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((0bv64 == temp && \valid[temp] == 1bv1) && 2bv32 == len) && ~bvadd16(len, 1bv32) == 2bv32) && \valid[\result] == 1bv1) && \valid[head] == 1bv1) && 0bv64 == head) && 0bv64 == \result) || ((((((((0bv64 == temp && 0bv1 == ~bvadd16(~bvneg64(\valid[head]), 1bv1)) && #memory_$Pointer$[head][~bvadd16(head, 4bv64)] == 0bv64) && ~bvadd16(~bvneg64(\valid[\result]), 1bv1) == 0bv1) && 0bv1 == ~bvadd16(~bvneg64(\valid[temp]), 1bv1)) && !(head == #memory_$Pointer$[head][~bvadd16(head, 4bv64)])) && 2bv32 == len) && 0bv64 == head) && 0bv64 == \result)) || (len == 2bv32 && 2bv32 == len) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 618]: Loop Invariant [2022-01-10 06:10:18,011 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_245,QUANTIFIED] [2022-01-10 06:10:18,011 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,015 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_246,QUANTIFIED] [2022-01-10 06:10:18,015 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,016 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_244,QUANTIFIED] [2022-01-10 06:10:18,016 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,016 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,016 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,016 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,016 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,016 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,016 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,016 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,016 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,017 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,017 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,017 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,017 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_242,QUANTIFIED] [2022-01-10 06:10:18,017 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,017 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_246,QUANTIFIED] [2022-01-10 06:10:18,018 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_245,QUANTIFIED] [2022-01-10 06:10:18,019 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,019 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_246,QUANTIFIED] [2022-01-10 06:10:18,019 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,019 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_244,QUANTIFIED] [2022-01-10 06:10:18,020 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,020 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,020 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,021 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,021 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,022 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,022 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,022 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,022 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,022 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,022 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,023 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,023 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_242,QUANTIFIED] [2022-01-10 06:10:18,023 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,023 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_246,QUANTIFIED] Derived loop invariant: (((((((((index == 0bv32 && ~bvadd16(data, 1bv32) == ~bvmul32(2bv32, len)) && (forall v_ArrVal_246 : bv64, v_ArrVal_245 : [bv64]bv32, v_ArrVal_244 : bv64 :: ~bvmul32(2bv32, len) == ~bvadd16(unknown-#memory_int-unknown[s := v_ArrVal_245][#memory_$Pointer$[s][s := v_ArrVal_246][~bvadd16(s, 4bv64)]][#memory_$Pointer$[s][s := v_ArrVal_244][~bvadd16(s, 4bv64)]], 1bv32))) && #memory_$Pointer$[s][~bvadd16(s, 4bv64)] == head) && head == #memory_$Pointer$[s][~bvadd16(s, 4bv64)]) && 2bv32 == len) && len == ~bvadd16(i, 2bv32)) && 0bv64 == #memory_$Pointer$[s][~bvadd16(s, 4bv64)]) && s == 0bv64) || (((((((((index == 0bv32 && ~bvadd16(data, 2bv32) == ~bvmul32(2bv32, len)) && s == head) && unknown-#memory_int-unknown[s][s] == ~bvadd16(i, len, 1bv32)) && 2bv32 == len) && ~bvadd16(1bv32, unknown-#memory_int-unknown[#memory_$Pointer$[s][~bvadd16(s, 4bv64)]][#memory_$Pointer$[s][~bvadd16(s, 4bv64)]]) == ~bvmul32(2bv32, len)) && 0bv64 == #memory_$Pointer$[s][~bvadd16(s, 4bv64)]) && s == head) && ~bvmul32(2bv32, len) == ~bvadd16(unknown-#memory_int-unknown[s][s], 2bv32)) && s == 0bv64)) || (((((((((((((((0bv64 == temp && 0bv1 == ~bvadd16(~bvneg64(\valid[head]), 1bv1)) && len == ~bvadd16(i, 1bv32)) && #memory_$Pointer$[head][~bvadd16(head, 4bv64)] == 0bv64) && 0bv1 == ~bvadd16(~bvneg64(~bvneg64(\valid[\result])), 1bv1)) && !(\result == #memory_$Pointer$[\result][~bvadd16(4bv64, \result)])) && 0bv64 == #memory_$Pointer$[\result][~bvadd16(4bv64, \result)]) && 0bv1 == ~bvadd16(~bvneg64(\valid[temp]), 1bv1)) && !(head == #memory_$Pointer$[head][~bvadd16(head, 4bv64)])) && 2bv32 == len) && 0bv64 == \result) && 0bv64 == #memory_$Pointer$[s][~bvadd16(s, 4bv64)]) && 0bv64 == head) && 0bv64 == \result) && (forall v_ArrVal_246 : bv64, v_ArrVal_242 : [bv64]bv64 :: !(#memory_$Pointer$[#memory_$Pointer$[s][~bvadd16(s, 4bv64)] := v_ArrVal_242][s][s := v_ArrVal_246][~bvadd16(s, 4bv64)] == s))) && s == 0bv64) - InvariantResult [Line: 574]: Loop Invariant Derived loop invariant: (((((((((~bvsgt32(len, 0bv32) && 0bv64 == temp) && 0bv1 == ~bvadd16(~bvneg64(\valid[head]), 1bv1)) && !(\result == head)) && !(temp == head)) && ~bvadd16(~bvneg64(\valid[\result]), 1bv1) == 0bv1) && 0bv1 == ~bvadd16(~bvneg64(\valid[temp]), 1bv1)) && 2bv32 == len) && 0bv64 == head) && 0bv64 == \result) || (((((0bv64 == temp && len == 2bv32) && ~bvadd16(~bvneg64(\valid[\result]), 1bv1) == 0bv1) && 0bv1 == ~bvadd16(~bvneg64(\valid[temp]), 1bv1)) && 2bv32 == len) && 0bv64 == \result) - InvariantResult [Line: 600]: Loop Invariant [2022-01-10 06:10:18,025 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:10:18,025 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:10:18,026 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,027 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:10:18,027 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:10:18,027 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,027 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,027 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,028 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,028 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,029 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:10:18,029 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:10:18,029 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,029 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:10:18,029 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-01-10 06:10:18,029 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,029 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,030 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,030 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,030 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((index == 0bv32 && (\exists ULTIMATE.start_main_~i~0#1 : bv32 :: expected == ~bvadd16(~bvmul32(ULTIMATE.start_main_~i~0#1, 2bv32), 1bv32) && ~bvmul32(expected, 2bv32) == ~bvadd16(~bvmul32(ULTIMATE.start_main_~i~0#1, 2bv32), unknown-#memory_int-unknown[head][0bv64], 1bv32))) && 0bv32 == index) && len == ~bvadd16(i, 1bv32)) && ~bvadd16(data, 2bv32) == ~bvmul32(2bv32, len)) && head == 0bv64) && s == head) && 2bv32 == len) && s == head) && ~bvmul32(2bv32, len) == ~bvadd16(unknown-#memory_int-unknown[s][s], 2bv32)) || ((((((((index == 0bv32 && 0bv32 == index) && i == 0bv32) && !~bvsge32(~bvadd16(unknown-#memory_int-unknown[s][s], 4294967295bv32, ~bvmul32(4294967295bv32, len)), 0bv32)) && !~bvsge32(~bvadd16(4294967295bv32, unknown-#memory_int-unknown[head][head], ~bvmul32(expected, 4294967295bv32), index), 0bv32)) && expected == ~bvadd16(2bv32, index)) && 2bv32 == len) && ~bvsge32(~bvadd16(unknown-#memory_int-unknown[head][head], ~bvmul32(expected, 4294967295bv32), index), 0bv32)) && ~bvsge32(~bvadd16(unknown-#memory_int-unknown[s][s], ~bvmul32(4294967295bv32, len)), 0bv32))) || ((((((((((((((((index == 0bv32 && 0bv64 == #memory_$Pointer$[head][4bv64]) && 1bv32 == index) && len == ~bvadd16(i, 1bv32)) && ~bvadd16(data, 2bv32) == ~bvmul32(2bv32, len)) && !~bvsge32(~bvadd16(4294967295bv32, unknown-#memory_int-unknown[head][head], ~bvmul32(expected, 4294967295bv32), index), 0bv32)) && head == 0bv64) && s == head) && expected == ~bvadd16(2bv32, index)) && (\exists ULTIMATE.start_main_~i~0#1 : bv32 :: expected == ~bvadd16(~bvmul32(ULTIMATE.start_main_~i~0#1, 2bv32), 1bv32) && ~bvmul32(expected, 2bv32) == ~bvadd16(~bvmul32(ULTIMATE.start_main_~i~0#1, 2bv32), unknown-#memory_int-unknown[#memory_$Pointer$[head][4bv64]][#memory_$Pointer$[head][4bv64]], 1bv32))) && 2bv32 == len) && ~bvadd16(1bv32, unknown-#memory_int-unknown[#memory_$Pointer$[s][~bvadd16(s, 4bv64)]][#memory_$Pointer$[s][~bvadd16(s, 4bv64)]]) == ~bvmul32(2bv32, len)) && 0bv64 == #memory_$Pointer$[s][~bvadd16(s, 4bv64)]) && s == head) && ~bvsge32(~bvadd16(unknown-#memory_int-unknown[head][head], ~bvmul32(expected, 4294967295bv32), index), 0bv32)) && ~bvmul32(2bv32, len) == ~bvadd16(unknown-#memory_int-unknown[s][s], 2bv32)) && s == 0bv64) - InvariantResult [Line: 607]: Loop Invariant [2022-01-10 06:10:18,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,032 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,032 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,032 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,032 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,032 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,032 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,033 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,033 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 06:10:18,033 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 06:10:18,033 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((index == 0bv32 && !(s == #memory_$Pointer$[s][~bvadd16(s, 4bv64)])) && i == 0bv32) && s == head) && data == ~bvadd16(i, len)) && 2bv32 == len) && ~bvadd16(1bv32, unknown-#memory_int-unknown[#memory_$Pointer$[s][~bvadd16(s, 4bv64)]][#memory_$Pointer$[s][~bvadd16(s, 4bv64)]]) == ~bvmul32(2bv32, len)) && 0bv64 == #memory_$Pointer$[s][~bvadd16(s, 4bv64)]) && s == head) && s == 0bv64) || ((((((((!(s == #memory_$Pointer$[s][~bvadd16(s, 4bv64)]) && len == ~bvadd16(i, 1bv32)) && s == head) && data == ~bvadd16(i, len)) && i == index) && 2bv32 == len) && 0bv64 == #memory_$Pointer$[s][~bvadd16(s, 4bv64)]) && s == head) && s == 0bv64)) || ((((((((index == 0bv32 && !(s == #memory_$Pointer$[s][~bvadd16(s, 4bv64)])) && ~bvadd16(data, 1bv32) == ~bvmul32(2bv32, len)) && #memory_$Pointer$[s][~bvadd16(s, 4bv64)] == head) && len == ~bvadd16(i, 1bv32)) && head == #memory_$Pointer$[s][~bvadd16(s, 4bv64)]) && 2bv32 == len) && 0bv64 == #memory_$Pointer$[s][~bvadd16(s, 4bv64)]) && s == 0bv64) RESULT: Ultimate proved your program to be correct! [2022-01-10 06:10:18,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...