./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_update_all.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:35:29,695 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:35:29,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:35:29,751 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:35:29,751 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:35:29,753 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:35:29,755 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:35:29,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:35:29,761 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:35:29,765 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:35:29,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:35:29,769 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:35:29,769 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:35:29,771 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:35:29,773 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:35:29,776 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:35:29,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:35:29,779 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:35:29,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:35:29,783 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:35:29,785 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:35:29,786 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:35:29,787 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:35:29,788 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:35:29,790 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:35:29,798 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:35:29,799 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:35:29,799 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:35:29,800 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:35:29,801 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:35:29,802 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:35:29,802 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:35:29,804 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:35:29,805 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:35:29,806 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:35:29,806 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:35:29,807 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:35:29,807 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:35:29,808 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:35:29,809 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:35:29,810 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:35:29,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:35:29,813 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:35:29,842 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:35:29,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:35:29,843 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:35:29,843 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:35:29,844 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:35:29,844 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:35:29,844 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:35:29,845 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:35:29,845 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:35:29,846 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:35:29,846 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:35:29,846 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:35:29,847 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:35:29,847 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:35:29,847 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:35:29,847 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:35:29,847 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:35:29,848 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:35:29,848 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:35:29,848 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:35:29,848 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:35:29,848 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:35:29,849 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:35:29,849 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:35:29,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:35:29,849 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:35:29,850 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:35:29,850 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:35:29,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:35:29,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:35:29,851 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:35:29,851 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:35:29,851 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:35:29,851 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 [2022-07-12 03:35:30,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:35:30,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:35:30,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:35:30,184 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:35:30,185 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:35:30,187 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_update_all.i [2022-07-12 03:35:30,266 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4d7c14ff/eb37da8a804c4f138f3d0bc9c24b5091/FLAG421a5be66 [2022-07-12 03:35:30,731 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:35:30,732 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i [2022-07-12 03:35:30,756 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4d7c14ff/eb37da8a804c4f138f3d0bc9c24b5091/FLAG421a5be66 [2022-07-12 03:35:31,065 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4d7c14ff/eb37da8a804c4f138f3d0bc9c24b5091 [2022-07-12 03:35:31,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:35:31,068 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:35:31,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:35:31,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:35:31,073 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:35:31,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:35:31" (1/1) ... [2022-07-12 03:35:31,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dee9ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:35:31, skipping insertion in model container [2022-07-12 03:35:31,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:35:31" (1/1) ... [2022-07-12 03:35:31,080 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:35:31,118 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:35:31,398 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i[24418,24431] [2022-07-12 03:35:31,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:35:31,409 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:35:31,437 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i[24418,24431] [2022-07-12 03:35:31,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:35:31,456 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:35:31,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:35:31 WrapperNode [2022-07-12 03:35:31,457 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:35:31,458 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:35:31,458 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:35:31,458 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:35:31,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:35:31" (1/1) ... [2022-07-12 03:35:31,475 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:35:31" (1/1) ... [2022-07-12 03:35:31,491 INFO L137 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 127 [2022-07-12 03:35:31,491 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:35:31,492 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:35:31,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:35:31,492 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:35:31,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:35:31" (1/1) ... [2022-07-12 03:35:31,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:35:31" (1/1) ... [2022-07-12 03:35:31,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:35:31" (1/1) ... [2022-07-12 03:35:31,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:35:31" (1/1) ... [2022-07-12 03:35:31,515 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:35:31" (1/1) ... [2022-07-12 03:35:31,518 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:35:31" (1/1) ... [2022-07-12 03:35:31,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:35:31" (1/1) ... [2022-07-12 03:35:31,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:35:31,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:35:31,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:35:31,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:35:31,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:35:31" (1/1) ... [2022-07-12 03:35:31,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:35:31,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:35:31,583 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-07-12 03:35:31,589 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-07-12 03:35:31,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 03:35:31,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 03:35:31,612 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-12 03:35:31,612 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-12 03:35:31,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 03:35:31,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:35:31,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 03:35:31,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 03:35:31,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:35:31,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:35:31,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:35:31,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:35:31,722 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:35:31,724 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:35:31,925 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:35:31,930 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:35:31,934 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-12 03:35:31,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:35:31 BoogieIcfgContainer [2022-07-12 03:35:31,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:35:31,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:35:31,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:35:31,941 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:35:31,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:35:31" (1/3) ... [2022-07-12 03:35:31,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e1914b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:35:31, skipping insertion in model container [2022-07-12 03:35:31,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:35:31" (2/3) ... [2022-07-12 03:35:31,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e1914b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:35:31, skipping insertion in model container [2022-07-12 03:35:31,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:35:31" (3/3) ... [2022-07-12 03:35:31,944 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2022-07-12 03:35:31,955 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:35:31,955 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:35:32,002 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:35:32,008 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@228640dd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1145d32f [2022-07-12 03:35:32,009 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:35:32,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 03:35:32,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 03:35:32,027 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:35:32,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:35:32,028 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:35:32,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:35:32,034 INFO L85 PathProgramCache]: Analyzing trace with hash 663980757, now seen corresponding path program 1 times [2022-07-12 03:35:32,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:35:32,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774774131] [2022-07-12 03:35:32,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:35:32,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:35:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:32,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 03:35:32,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:32,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:35:32,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:35:32,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774774131] [2022-07-12 03:35:32,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774774131] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:35:32,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:35:32,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:35:32,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972689045] [2022-07-12 03:35:32,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:35:32,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:35:32,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:35:32,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:35:32,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:35:32,274 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:35:32,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:35:32,323 INFO L93 Difference]: Finished difference Result 61 states and 87 transitions. [2022-07-12 03:35:32,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:35:32,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-07-12 03:35:32,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:35:32,330 INFO L225 Difference]: With dead ends: 61 [2022-07-12 03:35:32,331 INFO L226 Difference]: Without dead ends: 28 [2022-07-12 03:35:32,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-07-12 03:35:32,338 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:35:32,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:35:32,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-12 03:35:32,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-12 03:35:32,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 03:35:32,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-07-12 03:35:32,363 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 20 [2022-07-12 03:35:32,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:35:32,365 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-07-12 03:35:32,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:35:32,365 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-07-12 03:35:32,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 03:35:32,366 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:35:32,366 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:35:32,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:35:32,366 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:35:32,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:35:32,367 INFO L85 PathProgramCache]: Analyzing trace with hash 616475652, now seen corresponding path program 1 times [2022-07-12 03:35:32,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:35:32,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925781985] [2022-07-12 03:35:32,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:35:32,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:35:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:32,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 03:35:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:32,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:35:32,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:35:32,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925781985] [2022-07-12 03:35:32,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925781985] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:35:32,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:35:32,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:35:32,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442739573] [2022-07-12 03:35:32,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:35:32,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:35:32,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:35:32,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:35:32,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:35:32,435 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:35:32,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:35:32,469 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-07-12 03:35:32,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:35:32,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-07-12 03:35:32,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:35:32,471 INFO L225 Difference]: With dead ends: 47 [2022-07-12 03:35:32,471 INFO L226 Difference]: Without dead ends: 31 [2022-07-12 03:35:32,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:35:32,476 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:35:32,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 79 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:35:32,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-12 03:35:32,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-07-12 03:35:32,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 03:35:32,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-07-12 03:35:32,490 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 20 [2022-07-12 03:35:32,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:35:32,491 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-07-12 03:35:32,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:35:32,492 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-07-12 03:35:32,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 03:35:32,495 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:35:32,495 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:35:32,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:35:32,496 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:35:32,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:35:32,497 INFO L85 PathProgramCache]: Analyzing trace with hash -600691076, now seen corresponding path program 1 times [2022-07-12 03:35:32,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:35:32,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627556768] [2022-07-12 03:35:32,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:35:32,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:35:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:32,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 03:35:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:32,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:35:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:32,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 03:35:32,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:35:32,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627556768] [2022-07-12 03:35:32,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627556768] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:35:32,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663021912] [2022-07-12 03:35:32,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:35:32,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:35:32,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:35:32,689 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:35:32,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 03:35:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:32,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:35:32,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:35:32,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 03:35:32,875 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:35:32,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663021912] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:35:32,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 03:35:32,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-07-12 03:35:32,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191749662] [2022-07-12 03:35:32,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:35:32,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:35:32,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:35:32,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:35:32,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:35:32,876 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 03:35:32,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:35:32,897 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2022-07-12 03:35:32,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:35:32,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-07-12 03:35:32,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:35:32,898 INFO L225 Difference]: With dead ends: 51 [2022-07-12 03:35:32,898 INFO L226 Difference]: Without dead ends: 42 [2022-07-12 03:35:32,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:35:32,899 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 44 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:35:32,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 51 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:35:32,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-12 03:35:32,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2022-07-12 03:35:32,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 03:35:32,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-07-12 03:35:32,904 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 28 [2022-07-12 03:35:32,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:35:32,904 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-07-12 03:35:32,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 03:35:32,905 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-07-12 03:35:32,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 03:35:32,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:35:32,906 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:35:32,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 03:35:33,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:35:33,112 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:35:33,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:35:33,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1948852891, now seen corresponding path program 1 times [2022-07-12 03:35:33,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:35:33,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658927718] [2022-07-12 03:35:33,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:35:33,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:35:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:33,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 03:35:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:33,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:35:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:33,222 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 03:35:33,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:35:33,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658927718] [2022-07-12 03:35:33,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658927718] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:35:33,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928933452] [2022-07-12 03:35:33,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:35:33,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:35:33,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:35:33,244 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:35:33,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 03:35:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:33,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 03:35:33,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:35:33,439 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 03:35:33,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:35:33,515 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 03:35:33,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928933452] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:35:33,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:35:33,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2022-07-12 03:35:33,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907599484] [2022-07-12 03:35:33,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:35:33,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 03:35:33,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:35:33,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 03:35:33,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 03:35:33,517 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 03:35:33,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:35:33,607 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-07-12 03:35:33,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 03:35:33,607 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2022-07-12 03:35:33,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:35:33,608 INFO L225 Difference]: With dead ends: 66 [2022-07-12 03:35:33,608 INFO L226 Difference]: Without dead ends: 57 [2022-07-12 03:35:33,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-07-12 03:35:33,609 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 69 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:35:33,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 152 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:35:33,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-12 03:35:33,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 35. [2022-07-12 03:35:33,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 03:35:33,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-07-12 03:35:33,615 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 33 [2022-07-12 03:35:33,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:35:33,615 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-07-12 03:35:33,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 03:35:33,616 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-07-12 03:35:33,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 03:35:33,616 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:35:33,617 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:35:33,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 03:35:33,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-12 03:35:33,825 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:35:33,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:35:33,826 INFO L85 PathProgramCache]: Analyzing trace with hash 2072516636, now seen corresponding path program 2 times [2022-07-12 03:35:33,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:35:33,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856709661] [2022-07-12 03:35:33,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:35:33,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:35:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:33,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 03:35:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:33,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:35:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:33,921 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 03:35:33,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:35:33,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856709661] [2022-07-12 03:35:33,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856709661] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:35:33,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657108147] [2022-07-12 03:35:33,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:35:33,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:35:33,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:35:33,923 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:35:33,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 03:35:34,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:35:34,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:35:34,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 03:35:34,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:35:34,055 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 03:35:34,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:35:34,076 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 03:35:34,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657108147] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:35:34,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:35:34,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 11 [2022-07-12 03:35:34,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608445709] [2022-07-12 03:35:34,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:35:34,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 03:35:34,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:35:34,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 03:35:34,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-12 03:35:34,078 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 03:35:34,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:35:34,249 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-07-12 03:35:34,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 03:35:34,251 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2022-07-12 03:35:34,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:35:34,251 INFO L225 Difference]: With dead ends: 65 [2022-07-12 03:35:34,251 INFO L226 Difference]: Without dead ends: 51 [2022-07-12 03:35:34,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2022-07-12 03:35:34,253 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 85 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:35:34,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 206 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:35:34,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-12 03:35:34,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2022-07-12 03:35:34,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 03:35:34,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-07-12 03:35:34,258 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 38 [2022-07-12 03:35:34,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:35:34,259 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-07-12 03:35:34,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 03:35:34,259 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-07-12 03:35:34,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 03:35:34,260 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:35:34,260 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:35:34,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 03:35:34,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:35:34,476 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:35:34,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:35:34,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1973765418, now seen corresponding path program 1 times [2022-07-12 03:35:34,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:35:34,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390139637] [2022-07-12 03:35:34,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:35:34,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:35:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:34,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 03:35:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:34,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:35:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:34,987 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:35:34,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:35:34,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390139637] [2022-07-12 03:35:34,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390139637] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:35:34,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919528599] [2022-07-12 03:35:34,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:35:34,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:35:34,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:35:34,989 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:35:34,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 03:35:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:35,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 100 conjunts are in the unsatisfiable core [2022-07-12 03:35:35,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:35:35,128 INFO L390 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-07-12 03:35:35,268 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:35:35,268 INFO L390 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 11 treesize of output 11 [2022-07-12 03:35:35,306 INFO L390 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 11 treesize of output 7 [2022-07-12 03:35:35,356 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:35:35,357 INFO L390 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 19 treesize of output 22 [2022-07-12 03:35:35,508 INFO L390 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-07-12 03:35:35,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:35:35,518 INFO L390 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 22 treesize of output 21 [2022-07-12 03:35:35,617 INFO L390 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 16 treesize of output 8 [2022-07-12 03:35:35,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 03:35:35,848 INFO L390 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 19 treesize of output 7 [2022-07-12 03:35:35,909 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:35:35,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:35:36,068 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_514 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_514) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_514 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_514) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2022-07-12 03:35:36,107 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_514 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_514) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_514 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_514) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2022-07-12 03:35:36,115 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_514 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_514) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_514 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_514) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) is different from false [2022-07-12 03:35:36,147 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:35:36,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-07-12 03:35:36,155 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:35:36,156 INFO L390 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 64 treesize of output 67 [2022-07-12 03:35:36,160 INFO L390 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 25 treesize of output 21 [2022-07-12 03:35:36,190 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:35:36,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-07-12 03:35:36,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:35:36,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2022-07-12 03:35:36,213 INFO L390 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 25 treesize of output 21 [2022-07-12 03:35:36,358 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_508 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_508) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2022-07-12 03:35:36,365 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:35:36,366 INFO L390 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 19 treesize of output 20 [2022-07-12 03:35:36,368 INFO L390 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 33 treesize of output 25 [2022-07-12 03:35:36,371 INFO L390 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 6 treesize of output 4 [2022-07-12 03:35:36,713 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-12 03:35:36,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919528599] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:35:36,714 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:35:36,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 57 [2022-07-12 03:35:36,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642934834] [2022-07-12 03:35:36,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:35:36,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-12 03:35:36,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:35:36,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-12 03:35:36,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2577, Unknown=4, NotChecked=420, Total=3192 [2022-07-12 03:35:36,716 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 57 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 48 states have internal predecessors, (90), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-12 03:35:37,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:35:37,744 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2022-07-12 03:35:37,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 03:35:37,745 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 48 states have internal predecessors, (90), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 39 [2022-07-12 03:35:37,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:35:37,747 INFO L225 Difference]: With dead ends: 84 [2022-07-12 03:35:37,747 INFO L226 Difference]: Without dead ends: 82 [2022-07-12 03:35:37,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 43 SyntacticMatches, 9 SemanticMatches, 68 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=373, Invalid=3929, Unknown=4, NotChecked=524, Total=4830 [2022-07-12 03:35:37,749 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 126 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 277 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 03:35:37,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 597 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 750 Invalid, 0 Unknown, 277 Unchecked, 0.4s Time] [2022-07-12 03:35:37,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-12 03:35:37,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 59. [2022-07-12 03:35:37,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 54 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 03:35:37,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2022-07-12 03:35:37,758 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 39 [2022-07-12 03:35:37,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:35:37,759 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2022-07-12 03:35:37,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 48 states have internal predecessors, (90), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-12 03:35:37,759 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2022-07-12 03:35:37,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 03:35:37,760 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:35:37,760 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:35:37,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 03:35:37,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:35:37,976 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:35:37,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:35:37,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1005531927, now seen corresponding path program 1 times [2022-07-12 03:35:37,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:35:37,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299871726] [2022-07-12 03:35:37,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:35:37,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:35:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:38,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 03:35:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:38,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:35:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:38,035 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 03:35:38,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:35:38,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299871726] [2022-07-12 03:35:38,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299871726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:35:38,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:35:38,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:35:38,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629719478] [2022-07-12 03:35:38,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:35:38,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:35:38,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:35:38,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:35:38,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:35:38,037 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 03:35:38,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:35:38,066 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2022-07-12 03:35:38,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:35:38,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2022-07-12 03:35:38,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:35:38,068 INFO L225 Difference]: With dead ends: 76 [2022-07-12 03:35:38,068 INFO L226 Difference]: Without dead ends: 68 [2022-07-12 03:35:38,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:35:38,069 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:35:38,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 97 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:35:38,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-12 03:35:38,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2022-07-12 03:35:38,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 56 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 03:35:38,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2022-07-12 03:35:38,077 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 40 [2022-07-12 03:35:38,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:35:38,077 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2022-07-12 03:35:38,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 03:35:38,077 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2022-07-12 03:35:38,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 03:35:38,078 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:35:38,078 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1] [2022-07-12 03:35:38,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 03:35:38,078 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:35:38,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:35:38,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1440509788, now seen corresponding path program 2 times [2022-07-12 03:35:38,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:35:38,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364720694] [2022-07-12 03:35:38,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:35:38,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:35:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:38,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 03:35:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:38,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:35:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:38,146 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 03:35:38,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:35:38,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364720694] [2022-07-12 03:35:38,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364720694] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:35:38,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603846387] [2022-07-12 03:35:38,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:35:38,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:35:38,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:35:38,148 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:35:38,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 03:35:38,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:35:38,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:35:38,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 03:35:38,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:35:38,275 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 03:35:38,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:35:38,290 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 03:35:38,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603846387] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:35:38,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:35:38,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-07-12 03:35:38,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097514098] [2022-07-12 03:35:38,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:35:38,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 03:35:38,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:35:38,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 03:35:38,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 03:35:38,292 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 03:35:38,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:35:38,352 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2022-07-12 03:35:38,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 03:35:38,353 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2022-07-12 03:35:38,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:35:38,354 INFO L225 Difference]: With dead ends: 102 [2022-07-12 03:35:38,354 INFO L226 Difference]: Without dead ends: 80 [2022-07-12 03:35:38,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-12 03:35:38,355 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 70 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:35:38,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 121 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:35:38,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-12 03:35:38,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 63. [2022-07-12 03:35:38,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 58 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 03:35:38,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2022-07-12 03:35:38,363 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 40 [2022-07-12 03:35:38,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:35:38,363 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2022-07-12 03:35:38,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 03:35:38,363 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2022-07-12 03:35:38,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 03:35:38,364 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:35:38,364 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:35:38,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 03:35:38,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:35:38,581 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:35:38,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:35:38,582 INFO L85 PathProgramCache]: Analyzing trace with hash 896238913, now seen corresponding path program 1 times [2022-07-12 03:35:38,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:35:38,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475884033] [2022-07-12 03:35:38,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:35:38,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:35:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:38,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 03:35:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:38,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:35:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:38,632 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 03:35:38,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:35:38,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475884033] [2022-07-12 03:35:38,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475884033] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:35:38,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594556298] [2022-07-12 03:35:38,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:35:38,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:35:38,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:35:38,635 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:35:38,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 03:35:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:38,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 03:35:38,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:35:38,768 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 03:35:38,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:35:38,786 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 03:35:38,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594556298] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:35:38,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:35:38,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-07-12 03:35:38,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876574771] [2022-07-12 03:35:38,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:35:38,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:35:38,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:35:38,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:35:38,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:35:38,789 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 03:35:38,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:35:38,832 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2022-07-12 03:35:38,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:35:38,836 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-07-12 03:35:38,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:35:38,836 INFO L225 Difference]: With dead ends: 78 [2022-07-12 03:35:38,836 INFO L226 Difference]: Without dead ends: 70 [2022-07-12 03:35:38,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-12 03:35:38,837 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:35:38,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 150 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:35:38,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-12 03:35:38,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2022-07-12 03:35:38,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.11864406779661) internal successors, (66), 59 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 03:35:38,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2022-07-12 03:35:38,860 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 45 [2022-07-12 03:35:38,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:35:38,860 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2022-07-12 03:35:38,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 03:35:38,860 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-07-12 03:35:38,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 03:35:38,861 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:35:38,861 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:35:38,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 03:35:39,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:35:39,079 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:35:39,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:35:39,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1969553287, now seen corresponding path program 3 times [2022-07-12 03:35:39,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:35:39,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44106805] [2022-07-12 03:35:39,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:35:39,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:35:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:39,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 03:35:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:39,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:35:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:39,143 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 03:35:39,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:35:39,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44106805] [2022-07-12 03:35:39,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44106805] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:35:39,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514982575] [2022-07-12 03:35:39,144 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 03:35:39,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:35:39,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:35:39,146 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:35:39,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 03:35:39,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-12 03:35:39,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:35:39,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 03:35:39,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:35:39,507 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 03:35:39,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:35:39,540 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 03:35:39,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514982575] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:35:39,541 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:35:39,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-07-12 03:35:39,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466203889] [2022-07-12 03:35:39,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:35:39,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 03:35:39,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:35:39,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 03:35:39,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-12 03:35:39,542 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 03:35:39,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:35:39,650 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2022-07-12 03:35:39,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 03:35:39,651 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-07-12 03:35:39,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:35:39,651 INFO L225 Difference]: With dead ends: 87 [2022-07-12 03:35:39,651 INFO L226 Difference]: Without dead ends: 67 [2022-07-12 03:35:39,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-07-12 03:35:39,652 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 49 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:35:39,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 246 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:35:39,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-12 03:35:39,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-07-12 03:35:39,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 03:35:39,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-07-12 03:35:39,660 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 45 [2022-07-12 03:35:39,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:35:39,661 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-07-12 03:35:39,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 03:35:39,661 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-07-12 03:35:39,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 03:35:39,662 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:35:39,662 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:35:39,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 03:35:39,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:35:39,881 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:35:39,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:35:39,881 INFO L85 PathProgramCache]: Analyzing trace with hash 2065256414, now seen corresponding path program 1 times [2022-07-12 03:35:39,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:35:39,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787484549] [2022-07-12 03:35:39,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:35:39,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:35:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:40,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 03:35:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:40,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:35:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:40,539 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:35:40,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:35:40,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787484549] [2022-07-12 03:35:40,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787484549] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:35:40,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476691287] [2022-07-12 03:35:40,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:35:40,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:35:40,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:35:40,555 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:35:40,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 03:35:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:40,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 105 conjunts are in the unsatisfiable core [2022-07-12 03:35:40,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:35:40,687 INFO L390 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-07-12 03:35:40,847 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:35:40,848 INFO L390 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 11 treesize of output 11 [2022-07-12 03:35:40,887 INFO L390 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 11 treesize of output 7 [2022-07-12 03:35:40,931 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:35:40,931 INFO L390 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 19 treesize of output 22 [2022-07-12 03:35:41,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:35:41,077 INFO L390 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 22 treesize of output 21 [2022-07-12 03:35:41,242 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:35:41,242 INFO L390 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 56 treesize of output 53 [2022-07-12 03:35:41,245 INFO L390 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 27 treesize of output 19 [2022-07-12 03:35:41,248 INFO L390 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-07-12 03:35:41,473 INFO L390 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 33 treesize of output 21 [2022-07-12 03:35:41,476 INFO L390 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 21 treesize of output 13 [2022-07-12 03:35:41,512 INFO L390 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 28 treesize of output 10 [2022-07-12 03:35:41,534 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:35:41,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:35:41,776 INFO L390 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 84 treesize of output 64 [2022-07-12 03:35:41,787 INFO L390 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 84 treesize of output 64 [2022-07-12 03:35:41,799 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_sll_circular_update_at_~data#1|) (<= |c_ULTIMATE.start_sll_circular_update_at_~data#1| .cse0) (forall ((v_ArrVal_1087 (Array Int Int))) (= (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1087) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1088 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)))) is different from false [2022-07-12 03:35:41,821 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:35:41,821 INFO L390 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 46 treesize of output 45 [2022-07-12 03:35:41,825 INFO L390 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 17 treesize of output 15 [2022-07-12 03:35:44,047 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_1085 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_1085) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (<= |c_ULTIMATE.start_main_~i~0#1| 0) (<= 0 |c_ULTIMATE.start_main_~i~0#1|)) is different from false [2022-07-12 03:35:44,374 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int) (v_ArrVal_1085 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_1085) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))) is different from false [2022-07-12 03:35:44,383 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int) (v_ArrVal_1085 Int) (v_ArrVal_1083 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1083) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_1085) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) is different from false [2022-07-12 03:35:44,399 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:35:44,399 INFO L390 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 24 treesize of output 25 [2022-07-12 03:35:44,403 INFO L390 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 43 treesize of output 39 [2022-07-12 03:35:44,405 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:35:44,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2022-07-12 03:35:44,409 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:35:44,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2022-07-12 03:35:44,782 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-12 03:35:44,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476691287] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:35:44,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:35:44,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 25] total 63 [2022-07-12 03:35:44,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305693361] [2022-07-12 03:35:44,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:35:44,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-07-12 03:35:44,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:35:44,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-07-12 03:35:44,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=3249, Unknown=4, NotChecked=468, Total=3906 [2022-07-12 03:35:44,785 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 63 states, 63 states have (on average 1.7301587301587302) internal successors, (109), 54 states have internal predecessors, (109), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 03:35:45,368 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0) (<= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0)) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int) (v_ArrVal_1085 Int) (v_ArrVal_1083 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1083) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_1085) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))))) is different from false [2022-07-12 03:35:45,667 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int) (v_ArrVal_1085 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_1085) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 0)) is different from false [2022-07-12 03:35:45,969 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_1085 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_1085) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (<= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-12 03:35:47,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:35:47,035 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2022-07-12 03:35:47,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-12 03:35:47,036 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.7301587301587302) internal successors, (109), 54 states have internal predecessors, (109), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2022-07-12 03:35:47,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:35:47,036 INFO L225 Difference]: With dead ends: 85 [2022-07-12 03:35:47,037 INFO L226 Difference]: Without dead ends: 80 [2022-07-12 03:35:47,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 78 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 887 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=355, Invalid=4922, Unknown=7, NotChecked=1036, Total=6320 [2022-07-12 03:35:47,046 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 109 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 204 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 03:35:47,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 637 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 768 Invalid, 0 Unknown, 204 Unchecked, 0.5s Time] [2022-07-12 03:35:47,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-12 03:35:47,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2022-07-12 03:35:47,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 67 states have internal predecessors, (71), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 03:35:47,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2022-07-12 03:35:47,073 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 46 [2022-07-12 03:35:47,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:35:47,073 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2022-07-12 03:35:47,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 1.7301587301587302) internal successors, (109), 54 states have internal predecessors, (109), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 03:35:47,073 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-07-12 03:35:47,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-12 03:35:47,074 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:35:47,074 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2022-07-12 03:35:47,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 03:35:47,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-12 03:35:47,291 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:35:47,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:35:47,291 INFO L85 PathProgramCache]: Analyzing trace with hash -2101316258, now seen corresponding path program 4 times [2022-07-12 03:35:47,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:35:47,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620714220] [2022-07-12 03:35:47,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:35:47,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:35:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:47,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 03:35:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:47,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:35:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:47,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 03:35:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:47,391 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 03:35:47,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:35:47,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620714220] [2022-07-12 03:35:47,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620714220] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:35:47,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942541547] [2022-07-12 03:35:47,392 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 03:35:47,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:35:47,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:35:47,393 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:35:47,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 03:35:47,529 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 03:35:47,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:35:47,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 03:35:47,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:35:47,549 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 03:35:47,549 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:35:47,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942541547] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:35:47,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 03:35:47,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-07-12 03:35:47,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763589275] [2022-07-12 03:35:47,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:35:47,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:35:47,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:35:47,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:35:47,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:35:47,551 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 03:35:47,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:35:47,562 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2022-07-12 03:35:47,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:35:47,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2022-07-12 03:35:47,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:35:47,563 INFO L225 Difference]: With dead ends: 80 [2022-07-12 03:35:47,563 INFO L226 Difference]: Without dead ends: 43 [2022-07-12 03:35:47,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:35:47,564 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 40 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:35:47,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 38 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:35:47,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-12 03:35:47,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-07-12 03:35:47,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 03:35:47,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2022-07-12 03:35:47,570 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 47 [2022-07-12 03:35:47,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:35:47,571 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2022-07-12 03:35:47,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 03:35:47,571 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2022-07-12 03:35:47,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-12 03:35:47,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:35:47,572 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2022-07-12 03:35:47,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-12 03:35:47,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:35:47,787 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:35:47,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:35:47,788 INFO L85 PathProgramCache]: Analyzing trace with hash -349906719, now seen corresponding path program 2 times [2022-07-12 03:35:47,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:35:47,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612531384] [2022-07-12 03:35:47,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:35:47,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:35:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:47,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 03:35:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:47,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:35:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:35:47,839 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 03:35:47,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:35:47,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612531384] [2022-07-12 03:35:47,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612531384] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:35:47,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350631089] [2022-07-12 03:35:47,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:35:47,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:35:47,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:35:47,841 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:35:47,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 03:35:47,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:35:47,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:35:47,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 03:35:47,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:35:48,030 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 03:35:48,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:35:48,068 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 03:35:48,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350631089] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:35:48,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:35:48,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2022-07-12 03:35:48,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004321309] [2022-07-12 03:35:48,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:35:48,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 03:35:48,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:35:48,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 03:35:48,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 03:35:48,070 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 03:35:48,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:35:48,138 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2022-07-12 03:35:48,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 03:35:48,139 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2022-07-12 03:35:48,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:35:48,139 INFO L225 Difference]: With dead ends: 43 [2022-07-12 03:35:48,139 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 03:35:48,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-12 03:35:48,140 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 22 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:35:48,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 93 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:35:48,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 03:35:48,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 03:35:48,142 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-07-12 03:35:48,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 03:35:48,142 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2022-07-12 03:35:48,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:35:48,142 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 03:35:48,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 03:35:48,142 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 03:35:48,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 03:35:48,144 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 03:35:48,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 03:35:48,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-12 03:35:48,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 03:35:52,381 INFO L902 garLoopResultBuilder]: At program point L638(lines 620 639) the Hoare annotation is: true [2022-07-12 03:35:52,381 INFO L895 garLoopResultBuilder]: At program point L614-2(lines 614 617) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse4 (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse5 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse6 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|))) (.cse12 (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (.cse13 (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse14 (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_sll_circular_update_at_~index#1|)) (.cse16 (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (.cse1 (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse0 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse8 (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_sll_circular_update_at_~data#1|)) (.cse9 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse7 (+ |ULTIMATE.start_main_~len~0#1| 1)) (.cse10 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse11 (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))) (.cse2 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse15 (<= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 (= (select .cse1 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) 0) .cse2 .cse3 .cse4 (forall ((v_ArrVal_514 (Array Int Int))) (<= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_514) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))) .cse5 .cse6 (= .cse7 |ULTIMATE.start_sll_circular_update_at_~data#1|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse2 .cse3 .cse4 (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) .cse5 .cse6 .cse8 .cse9 (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_update_at_~data#1|) .cse10 .cse12 .cse13 .cse14 .cse16 (= (select .cse1 |ULTIMATE.start_main_~s~0#1.offset|) 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (and .cse0 (forall ((v_ArrVal_1087 (Array Int Int))) (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1087) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) .cse8 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) .cse9 (<= .cse7 |ULTIMATE.start_sll_circular_update_at_~data#1|) (forall ((v_ArrVal_1088 (Array Int Int))) (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1088) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) .cse10 .cse11 (not .cse2) .cse15))) [2022-07-12 03:35:52,381 INFO L899 garLoopResultBuilder]: For program point L614-3(lines 614 617) no Hoare annotation was computed. [2022-07-12 03:35:52,381 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 03:35:52,381 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 03:35:52,381 INFO L899 garLoopResultBuilder]: For program point L631(lines 631 633) no Hoare annotation was computed. [2022-07-12 03:35:52,381 INFO L902 garLoopResultBuilder]: At program point L598-2(lines 598 602) the Hoare annotation is: true [2022-07-12 03:35:52,381 INFO L899 garLoopResultBuilder]: For program point L598-3(lines 598 602) no Hoare annotation was computed. [2022-07-12 03:35:52,382 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse17 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse18 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse0 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse2 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse5 (not (= .cse18 |ULTIMATE.start_main_~s~0#1.base|))) (.cse7 (<= |ULTIMATE.start_main_~len~0#1| 2)) (.cse12 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse13 (<= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0)) (.cse1 (<= 2 |ULTIMATE.start_main_~len~0#1|)) (.cse4 (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|)) (.cse6 (= (select (select |#memory_int| .cse18) (+ .cse17 4)) (+ |ULTIMATE.start_main_~len~0#1| 1))) (.cse15 (<= 0 |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) (.cse8 (= .cse17 0)) (.cse9 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)) (.cse10 (<= 0 |ULTIMATE.start_main_~i~0#1|)) (.cse11 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse3 (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) .cse2 (<= |ULTIMATE.start_main_~expected~0#1| .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= .cse3 |ULTIMATE.start_main_~expected~0#1|) .cse12) (let ((.cse14 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|))) (let ((.cse16 (select (select |#memory_int| .cse14) 4))) (and .cse0 .cse13 .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) 0) (not (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| .cse14)) .cse2 .cse4 .cse5 .cse6 .cse15 .cse7 (<= 1 |ULTIMATE.start_sll_circular_get_data_at_~index#1|) .cse8 .cse9 .cse10 .cse11 (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1) .cse12 (<= .cse16 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~expected~0#1| .cse16)))) (and .cse13 .cse1 .cse4 .cse6 .cse15 .cse8 (= 2 |ULTIMATE.start_main_~expected~0#1|) .cse9 .cse10 .cse11 (= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= .cse3 |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))))) [2022-07-12 03:35:52,382 INFO L899 garLoopResultBuilder]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2022-07-12 03:35:52,382 INFO L895 garLoopResultBuilder]: At program point L632(lines 620 639) the Hoare annotation is: false [2022-07-12 03:35:52,382 INFO L899 garLoopResultBuilder]: For program point L625-2(lines 625 628) no Hoare annotation was computed. [2022-07-12 03:35:52,382 INFO L895 garLoopResultBuilder]: At program point L625-3(lines 625 628) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse7 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse8 (not (= .cse0 |ULTIMATE.start_main_~s~0#1.base|))) (.cse9 (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse2 (= .cse1 0)) (.cse10 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|))) (.cse3 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)) (.cse4 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))) (.cse11 (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (.cse12 (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse13 (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (.cse14 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= (select (select |#memory_int| .cse0) (+ .cse1 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)) .cse2 .cse3 .cse4 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse5 .cse6 (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse7 .cse8 .cse9 .cse2 .cse10 .cse4 .cse5 .cse11 .cse12 .cse13 .cse14) (and .cse7 .cse8 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) .cse9 (= |ULTIMATE.start_main_~i~0#1| 1) .cse2 .cse10 .cse3 .cse4 .cse5 .cse6 .cse11 .cse12 .cse13 .cse14)))) [2022-07-12 03:35:52,382 INFO L899 garLoopResultBuilder]: For program point L625-4(lines 625 628) no Hoare annotation was computed. [2022-07-12 03:35:52,382 INFO L895 garLoopResultBuilder]: At program point L584(line 584) the Hoare annotation is: (and (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_~len#1|)) [2022-07-12 03:35:52,382 INFO L899 garLoopResultBuilder]: For program point L584-1(line 584) no Hoare annotation was computed. [2022-07-12 03:35:52,382 INFO L895 garLoopResultBuilder]: At program point L593(lines 583 594) the Hoare annotation is: (and (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|)) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) [2022-07-12 03:35:52,382 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 03:35:52,383 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 637) no Hoare annotation was computed. [2022-07-12 03:35:52,383 INFO L895 garLoopResultBuilder]: At program point L586-2(lines 586 591) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse2 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0) .cse1 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) .cse2 (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0))) (and .cse1 (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) .cse2 (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_~len#1|)))) [2022-07-12 03:35:52,383 INFO L899 garLoopResultBuilder]: For program point L586-3(lines 586 591) no Hoare annotation was computed. [2022-07-12 03:35:52,383 INFO L895 garLoopResultBuilder]: At program point L611(lines 606 612) the Hoare annotation is: (let ((.cse3 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse0 (<= 2 |ULTIMATE.start_main_~len~0#1|)) (.cse2 (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|)) (.cse4 (= (select (select |#memory_int| .cse3) (+ .cse8 4)) (+ |ULTIMATE.start_main_~len~0#1| 1))) (.cse5 (= .cse8 0)) (.cse6 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)) (.cse7 (<= 0 |ULTIMATE.start_main_~i~0#1|)) (.cse1 (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)))) (or (and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) .cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~expected~0#1| .cse1) .cse2 (not (= .cse3 |ULTIMATE.start_main_~s~0#1.base|)) .cse4 (<= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_sll_circular_get_data_at_#res#1|) .cse5 (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|) .cse6 .cse7 (<= .cse1 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (and (<= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0) .cse0 .cse2 .cse4 (<= 0 |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) .cse5 (= 2 |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|) .cse6 .cse7 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= .cse1 |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))))) [2022-07-12 03:35:52,383 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 03:35:52,383 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 605) no Hoare annotation was computed. [2022-07-12 03:35:52,383 INFO L895 garLoopResultBuilder]: At program point L587(line 587) the Hoare annotation is: (and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_~len#1|)) [2022-07-12 03:35:52,383 INFO L899 garLoopResultBuilder]: For program point L587-1(line 587) no Hoare annotation was computed. [2022-07-12 03:35:52,383 INFO L899 garLoopResultBuilder]: For program point L596(lines 596 604) no Hoare annotation was computed. [2022-07-12 03:35:52,383 INFO L899 garLoopResultBuilder]: For program point L629-2(lines 629 634) no Hoare annotation was computed. [2022-07-12 03:35:52,384 INFO L895 garLoopResultBuilder]: At program point L629-3(lines 629 634) the Hoare annotation is: (let ((.cse4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse3 (<= 1 |ULTIMATE.start_main_~i~0#1|))) (let ((.cse0 (or (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|)) (and (<= 2 |ULTIMATE.start_main_~len~0#1|) .cse3))) (.cse1 (<= |ULTIMATE.start_main_~len~0#1| 2)) (.cse5 (= (select (select |#memory_int| .cse4) (+ .cse8 4)) (+ |ULTIMATE.start_main_~len~0#1| 1))) (.cse6 (= .cse8 0)) (.cse2 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)) (.cse7 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1))) (or (and .cse0 .cse1 .cse2 (<= 2 |ULTIMATE.start_main_~i~0#1|)) (and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) .cse3 (not (= .cse4 |ULTIMATE.start_main_~s~0#1.base|)) .cse0 .cse5 .cse1 .cse6 .cse2 .cse7 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse5 .cse6 .cse2 .cse7 (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))))) [2022-07-12 03:35:52,384 INFO L899 garLoopResultBuilder]: For program point L629-4(lines 629 634) no Hoare annotation was computed. [2022-07-12 03:35:52,384 INFO L899 garLoopResultBuilder]: For program point L613(lines 613 619) no Hoare annotation was computed. [2022-07-12 03:35:52,384 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2022-07-12 03:35:52,384 INFO L899 garLoopResultBuilder]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2022-07-12 03:35:52,384 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2022-07-12 03:35:52,384 INFO L895 garLoopResultBuilder]: At program point node_createENTRY(lines 574 582) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-07-12 03:35:52,384 INFO L899 garLoopResultBuilder]: For program point node_createFINAL(lines 574 582) no Hoare annotation was computed. [2022-07-12 03:35:52,384 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2022-07-12 03:35:52,386 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1] [2022-07-12 03:35:52,388 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 03:35:52,396 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,397 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,397 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,397 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,398 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,398 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,398 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,400 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,401 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,401 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,401 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,401 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,401 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,402 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,403 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,403 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,403 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,404 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,404 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,404 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,405 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,405 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,406 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,406 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,406 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,406 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,406 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,407 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,408 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,408 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,408 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,408 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,408 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,408 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,410 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,411 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_514,QUANTIFIED] [2022-07-12 03:35:52,411 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,411 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,411 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,412 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,412 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,412 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,412 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,412 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,412 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1087,QUANTIFIED] [2022-07-12 03:35:52,413 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,413 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,413 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1088,QUANTIFIED] [2022-07-12 03:35:52,415 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,415 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_514,QUANTIFIED] [2022-07-12 03:35:52,415 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,415 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,416 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,416 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,416 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,416 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,416 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,417 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,431 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1087,QUANTIFIED] [2022-07-12 03:35:52,431 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,432 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,432 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1088,QUANTIFIED] [2022-07-12 03:35:52,433 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,433 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,433 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,434 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,434 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,434 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,434 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,434 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,434 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,434 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,434 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,435 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,435 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,435 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,435 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,436 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,436 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,436 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,436 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,436 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,436 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,436 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,436 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,437 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,437 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,437 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,438 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,438 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,438 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,438 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,438 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,439 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,439 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,439 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,439 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,439 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,439 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,440 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,440 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,440 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,440 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,440 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,440 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,441 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,441 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,442 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,442 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,442 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,442 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,442 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,442 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,443 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,443 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,443 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,443 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,443 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,443 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,444 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,444 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,444 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 03:35:52 BoogieIcfgContainer [2022-07-12 03:35:52,445 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 03:35:52,446 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 03:35:52,446 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 03:35:52,446 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 03:35:52,446 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:35:31" (3/4) ... [2022-07-12 03:35:52,450 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 03:35:52,454 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2022-07-12 03:35:52,460 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2022-07-12 03:35:52,460 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-07-12 03:35:52,460 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 03:35:52,460 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 03:35:52,475 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\result == 0 && head == 0) && #memory_$Pointer$[\result][\result] == 0) && !(#memory_$Pointer$[\result][\result] == \result)) && len <= 1) && len == 2) && !(head == last)) && !(head == #memory_$Pointer$[head][head]) [2022-07-12 03:35:52,475 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((0 <= s && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1) && #memory_$Pointer$[s][s] == 0) && index <= 0) && len <= 1) && 2 <= i) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && !(head == s)) && s <= 0) || (((((((((((i == 0 && head == 0) && !(#memory_$Pointer$[s][s] == s)) && \result <= 0) && #memory_$Pointer$[s][s] == 0) && !(#memory_$Pointer$[\result][\result] == \result)) && len <= 1) && len == 2) && !(head == last)) && 0 <= \result) && !(head == #memory_$Pointer$[head][head])) && s == 0)) || ((((((((((((((head == 0 && !(#memory_$Pointer$[s][s] == s)) && !(#memory_$Pointer$[head][head] == s)) && \result <= 0) && i == 1) && #memory_$Pointer$[s][s] == 0) && !(#memory_$Pointer$[\result][\result] == \result)) && index <= 0) && len <= 1) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && !(head == last)) && 0 <= \result) && !(head == #memory_$Pointer$[head][head])) && s == 0) [2022-07-12 03:35:52,476 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((0 <= s && #memory_$Pointer$[head][head] == 0) && head == s) && head == 0) && \result <= 0) && (forall v_ArrVal_514 : [int]int :: len <= unknown-#memory_int-unknown[#memory_$Pointer$[head][head] := v_ArrVal_514][s][s + 4])) && s == head) && !(#memory_$Pointer$[\result][\result] == \result)) && len + 1 == data) && len + i == data) && len <= 1) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && !(head == last)) && 0 <= \result) && i == index) && s <= 0) && !(head == #memory_$Pointer$[head][head])) || (((((((((((((((head == s && head == 0) && \result <= 0) && !(head == #memory_$Pointer$[head][s])) && s == head) && !(#memory_$Pointer$[\result][\result] == \result)) && len + i == data) && len <= 1) && len == data) && len == 2) && !(head == last)) && 0 <= \result) && i == index) && !(head == #memory_$Pointer$[head][head])) && #memory_$Pointer$[head][s] == 0) && s == 0)) || ((((((((((((0 <= s && (forall v_ArrVal_1087 : [int]int :: #memory_$Pointer$[head := v_ArrVal_1087][s][s] == head)) && i + 1 <= len) && #memory_$Pointer$[s][s] == 0) && len + i == data) && index <= 0) && len <= 1) && len + 1 <= data) && (forall v_ArrVal_1088 : [int]int :: #memory_$Pointer$[head := v_ArrVal_1088][s][s] == head)) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && !(head == s)) && s <= 0) [2022-07-12 03:35:52,476 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((0 <= s && 2 <= len) && 1 <= i) && expected <= unknown-#memory_int-unknown[head][head + 4]) && i + 1 <= len) && !(#memory_$Pointer$[s][s] == s)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1) && len <= 2) && expected <= \result) && #memory_$Pointer$[s][s] == 0) && \result <= expected) && index <= 0) && 0 <= i) && unknown-#memory_int-unknown[head][head + 4] <= expected) && s <= 0) || ((((((((((((((((head <= 0 && 2 <= len) && i + 1 <= len) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1) && 0 <= head) && #memory_$Pointer$[s][s] == 0) && 2 == expected) && \result == expected) && index <= 0) && 0 <= i) && len <= 1) && index == 0) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && !(head == s)) && unknown-#memory_int-unknown[head][head + 4] == expected) && s == 0) [2022-07-12 03:35:52,492 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 03:35:52,493 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 03:35:52,493 INFO L158 Benchmark]: Toolchain (without parser) took 21424.73ms. Allocated memory was 92.3MB in the beginning and 176.2MB in the end (delta: 83.9MB). Free memory was 58.3MB in the beginning and 120.2MB in the end (delta: -61.9MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2022-07-12 03:35:52,493 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 92.3MB. Free memory was 47.4MB in the beginning and 47.3MB in the end (delta: 38.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:35:52,493 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.33ms. Allocated memory is still 92.3MB. Free memory was 57.9MB in the beginning and 59.7MB in the end (delta: -1.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 03:35:52,494 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.42ms. Allocated memory is still 92.3MB. Free memory was 59.7MB in the beginning and 57.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:35:52,494 INFO L158 Benchmark]: Boogie Preprocessor took 37.05ms. Allocated memory is still 92.3MB. Free memory was 57.7MB in the beginning and 56.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:35:52,494 INFO L158 Benchmark]: RCFGBuilder took 407.85ms. Allocated memory was 92.3MB in the beginning and 121.6MB in the end (delta: 29.4MB). Free memory was 56.1MB in the beginning and 96.3MB in the end (delta: -40.2MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2022-07-12 03:35:52,494 INFO L158 Benchmark]: TraceAbstraction took 20506.86ms. Allocated memory was 121.6MB in the beginning and 176.2MB in the end (delta: 54.5MB). Free memory was 95.1MB in the beginning and 123.3MB in the end (delta: -28.2MB). Peak memory consumption was 105.0MB. Max. memory is 16.1GB. [2022-07-12 03:35:52,494 INFO L158 Benchmark]: Witness Printer took 47.13ms. Allocated memory is still 176.2MB. Free memory was 123.3MB in the beginning and 120.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 03:35:52,499 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.30ms. Allocated memory is still 92.3MB. Free memory was 47.4MB in the beginning and 47.3MB in the end (delta: 38.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.33ms. Allocated memory is still 92.3MB. Free memory was 57.9MB in the beginning and 59.7MB in the end (delta: -1.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.42ms. Allocated memory is still 92.3MB. Free memory was 59.7MB in the beginning and 57.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.05ms. Allocated memory is still 92.3MB. Free memory was 57.7MB in the beginning and 56.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 407.85ms. Allocated memory was 92.3MB in the beginning and 121.6MB in the end (delta: 29.4MB). Free memory was 56.1MB in the beginning and 96.3MB in the end (delta: -40.2MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * TraceAbstraction took 20506.86ms. Allocated memory was 121.6MB in the beginning and 176.2MB in the end (delta: 54.5MB). Free memory was 95.1MB in the beginning and 123.3MB in the end (delta: -28.2MB). Peak memory consumption was 105.0MB. Max. memory is 16.1GB. * Witness Printer took 47.13ms. Allocated memory is still 176.2MB. Free memory was 123.3MB in the beginning and 120.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * 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$.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$.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$.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$.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$.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$.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$.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[v_ArrVal_514,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$.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$.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$.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[v_ArrVal_1087,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1088,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_514,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$.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$.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$.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[v_ArrVal_1087,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1088,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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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: 637]: 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 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.4s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 656 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 653 mSDsluCounter, 2542 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 481 IncrementalHoareTripleChecker+Unchecked, 2160 mSDsCounter, 168 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2102 IncrementalHoareTripleChecker+Invalid, 2751 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 168 mSolverCounterUnsat, 382 mSDtfsCounter, 2102 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 931 GetRequests, 681 SyntacticMatches, 23 SemanticMatches, 227 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 2065 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=11, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 113 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 18 PreInvPairs, 38 NumberOfFragments, 1180 HoareAnnotationTreeSize, 18 FomulaSimplifications, 7771 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 14 FomulaSimplificationsInter, 6226 FormulaSimplificationTreeSizeReductionInter, 3.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 896 NumberOfCodeBlocks, 893 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1198 ConstructedInterpolants, 20 QuantifiedInterpolants, 6558 SizeOfPredicates, 90 NumberOfNonLiveVariables, 3101 ConjunctsInSsa, 246 ConjunctsInUnsatCore, 31 InterpolantComputations, 5 PerfectInterpolantSequences, 377/539 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: 620]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 598]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant [2022-07-12 03:35:52,511 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,512 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,512 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,512 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,512 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,512 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,512 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,513 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,513 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,513 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,514 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,514 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,514 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,514 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((0 <= s && 2 <= len) && 1 <= i) && expected <= unknown-#memory_int-unknown[head][head + 4]) && i + 1 <= len) && !(#memory_$Pointer$[s][s] == s)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1) && len <= 2) && expected <= \result) && #memory_$Pointer$[s][s] == 0) && \result <= expected) && index <= 0) && 0 <= i) && unknown-#memory_int-unknown[head][head + 4] <= expected) && s <= 0) || ((((((((((((((((head <= 0 && 2 <= len) && i + 1 <= len) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1) && 0 <= head) && #memory_$Pointer$[s][s] == 0) && 2 == expected) && \result == expected) && index <= 0) && 0 <= i) && len <= 1) && index == 0) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && !(head == s)) && unknown-#memory_int-unknown[head][head + 4] == expected) && s == 0) - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 586]: Loop Invariant [2022-07-12 03:35:52,515 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,515 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,515 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,515 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,515 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,516 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((last == #memory_$Pointer$[head][head] && head == 0) && len <= 1) && len == 2) && !(head == #memory_$Pointer$[head][head])) && #memory_$Pointer$[head][head] == 0) || ((((head == 0 && head == last) && len == 2) && \valid[last] == 1) && len == len) - InvariantResult [Line: 629]: Loop Invariant [2022-07-12 03:35:52,516 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,516 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,516 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,516 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,517 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,517 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,517 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,517 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,517 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,518 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,518 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,518 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,518 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,518 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((2 + i <= len && 0 <= i) || (2 <= len && 1 <= i)) && len <= 2) && index <= 0) && 2 <= i) || ((((((((((0 <= s && index <= 0) && 1 <= i) && !(#memory_$Pointer$[s][s] == s)) && ((2 + i <= len && 0 <= i) || (2 <= len && 1 <= i))) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1) && len <= 2) && #memory_$Pointer$[s][s] == 0) && index <= 0) && len <= 1) && s <= 0)) || ((((((((i == 0 && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1) && #memory_$Pointer$[s][s] == 0) && index <= 0) && len <= 1) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && !(head == s)) && s == 0) - InvariantResult [Line: 614]: Loop Invariant [2022-07-12 03:35:52,519 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,519 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_514,QUANTIFIED] [2022-07-12 03:35:52,519 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,519 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,519 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,519 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,520 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,520 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,520 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,520 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,520 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1087,QUANTIFIED] [2022-07-12 03:35:52,520 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,520 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,521 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1088,QUANTIFIED] [2022-07-12 03:35:52,521 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,521 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_514,QUANTIFIED] [2022-07-12 03:35:52,522 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,522 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,522 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,522 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,522 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,522 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,522 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,523 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,523 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1087,QUANTIFIED] [2022-07-12 03:35:52,523 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,523 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,523 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1088,QUANTIFIED] Derived loop invariant: ((((((((((((((((((0 <= s && #memory_$Pointer$[head][head] == 0) && head == s) && head == 0) && \result <= 0) && (forall v_ArrVal_514 : [int]int :: len <= unknown-#memory_int-unknown[#memory_$Pointer$[head][head] := v_ArrVal_514][s][s + 4])) && s == head) && !(#memory_$Pointer$[\result][\result] == \result)) && len + 1 == data) && len + i == data) && len <= 1) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && !(head == last)) && 0 <= \result) && i == index) && s <= 0) && !(head == #memory_$Pointer$[head][head])) || (((((((((((((((head == s && head == 0) && \result <= 0) && !(head == #memory_$Pointer$[head][s])) && s == head) && !(#memory_$Pointer$[\result][\result] == \result)) && len + i == data) && len <= 1) && len == data) && len == 2) && !(head == last)) && 0 <= \result) && i == index) && !(head == #memory_$Pointer$[head][head])) && #memory_$Pointer$[head][s] == 0) && s == 0)) || ((((((((((((0 <= s && (forall v_ArrVal_1087 : [int]int :: #memory_$Pointer$[head := v_ArrVal_1087][s][s] == head)) && i + 1 <= len) && #memory_$Pointer$[s][s] == 0) && len + i == data) && index <= 0) && len <= 1) && len + 1 <= data) && (forall v_ArrVal_1088 : [int]int :: #memory_$Pointer$[head := v_ArrVal_1088][s][s] == head)) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && !(head == s)) && s <= 0) - InvariantResult [Line: 625]: Loop Invariant [2022-07-12 03:35:52,524 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,524 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,524 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,525 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,525 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,525 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,525 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,525 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,525 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,525 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,526 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,526 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,526 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,526 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,527 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,527 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,527 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,529 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,529 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,529 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,529 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,529 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,530 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,530 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((0 <= s && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1) && #memory_$Pointer$[s][s] == 0) && index <= 0) && len <= 1) && 2 <= i) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && !(head == s)) && s <= 0) || (((((((((((i == 0 && head == 0) && !(#memory_$Pointer$[s][s] == s)) && \result <= 0) && #memory_$Pointer$[s][s] == 0) && !(#memory_$Pointer$[\result][\result] == \result)) && len <= 1) && len == 2) && !(head == last)) && 0 <= \result) && !(head == #memory_$Pointer$[head][head])) && s == 0)) || ((((((((((((((head == 0 && !(#memory_$Pointer$[s][s] == s)) && !(#memory_$Pointer$[head][head] == s)) && \result <= 0) && i == 1) && #memory_$Pointer$[s][s] == 0) && !(#memory_$Pointer$[\result][\result] == \result)) && index <= 0) && len <= 1) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && !(head == last)) && 0 <= \result) && !(head == #memory_$Pointer$[head][head])) && s == 0) - InvariantResult [Line: 583]: Loop Invariant [2022-07-12 03:35:52,530 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,531 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,531 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,531 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,531 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,532 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((\result == 0 && head == 0) && #memory_$Pointer$[\result][\result] == 0) && !(#memory_$Pointer$[\result][\result] == \result)) && len <= 1) && len == 2) && !(head == last)) && !(head == #memory_$Pointer$[head][head]) - InvariantResult [Line: 607]: Loop Invariant [2022-07-12 03:35:52,532 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,532 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,533 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,533 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,533 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,533 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,533 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,533 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,533 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,534 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,534 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,534 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,534 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,534 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,534 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,535 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,535 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,535 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,536 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,536 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,536 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,536 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,536 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,536 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,537 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,537 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,537 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,538 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-12 03:35:52,538 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-12 03:35:52,538 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((0 <= s && 2 <= len) && index <= 0) && 1 <= i) && expected <= unknown-#memory_int-unknown[head][head + 4]) && i + 1 <= len) && !(#memory_$Pointer$[s][s] == s)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1) && len <= 2) && #memory_$Pointer$[s][s] == 0) && index <= 0) && 0 <= i) && len <= 1) && unknown-#memory_int-unknown[head][head + 4] <= expected) && s <= 0) || (((((((((((((((((((0 <= s && head <= 0) && 2 <= len) && #memory_$Pointer$[head][head] == 0) && !(head == #memory_$Pointer$[head][head])) && 1 <= i) && i + 1 <= len) && !(#memory_$Pointer$[s][s] == s)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1) && 0 <= head) && len <= 2) && 1 <= index) && #memory_$Pointer$[s][s] == 0) && index <= 0) && 0 <= i) && len <= 1) && index <= 1) && s <= 0) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head]][4] <= expected) && expected <= unknown-#memory_int-unknown[#memory_$Pointer$[head][head]][4])) || (((((((((((((((head <= 0 && 2 <= len) && i + 1 <= len) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1) && 0 <= head) && #memory_$Pointer$[s][s] == 0) && 2 == expected) && index <= 0) && 0 <= i) && len <= 1) && index == 0) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && !(head == s)) && unknown-#memory_int-unknown[head][head + 4] == expected) && s == 0) RESULT: Ultimate proved your program to be correct! [2022-07-12 03:35:52,565 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE