./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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/dll2c_update_all_reverse.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 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 02:13:58,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 02:13:58,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 02:13:58,878 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 02:13:58,878 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 02:13:58,879 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 02:13:58,882 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 02:13:58,884 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 02:13:58,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 02:13:58,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 02:13:58,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 02:13:58,892 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 02:13:58,893 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 02:13:58,894 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 02:13:58,895 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 02:13:58,897 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 02:13:58,897 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 02:13:58,898 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 02:13:58,899 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 02:13:58,903 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 02:13:58,904 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 02:13:58,905 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 02:13:58,906 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 02:13:58,907 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 02:13:58,907 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 02:13:58,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 02:13:58,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 02:13:58,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 02:13:58,913 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 02:13:58,914 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 02:13:58,914 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 02:13:58,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 02:13:58,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 02:13:58,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 02:13:58,917 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 02:13:58,918 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 02:13:58,918 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 02:13:58,918 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 02:13:58,918 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 02:13:58,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 02:13:58,919 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 02:13:58,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 02:13:58,926 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 02:13:58,949 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 02:13:58,950 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 02:13:58,950 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 02:13:58,950 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 02:13:58,950 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 02:13:58,951 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 02:13:58,951 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 02:13:58,951 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 02:13:58,952 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 02:13:58,952 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 02:13:58,952 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 02:13:58,952 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 02:13:58,953 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 02:13:58,953 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 02:13:58,953 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 02:13:58,953 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 02:13:58,953 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 02:13:58,954 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 02:13:58,954 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 02:13:58,954 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 02:13:58,954 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 02:13:58,954 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 02:13:58,954 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 02:13:58,954 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 02:13:58,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:13:58,955 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 02:13:58,955 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 02:13:58,955 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 02:13:58,955 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 02:13:58,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 02:13:58,956 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 02:13:58,956 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 02:13:58,956 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 02:13:58,956 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 -> 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 [2022-07-21 02:13:59,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 02:13:59,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 02:13:59,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 02:13:59,248 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 02:13:59,249 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 02:13:59,250 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-07-21 02:13:59,303 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45dad4fc4/6608c158e56440988020b10f8309cb97/FLAG091a0cd9d [2022-07-21 02:13:59,663 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 02:13:59,664 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-07-21 02:13:59,704 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45dad4fc4/6608c158e56440988020b10f8309cb97/FLAG091a0cd9d [2022-07-21 02:14:00,055 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45dad4fc4/6608c158e56440988020b10f8309cb97 [2022-07-21 02:14:00,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 02:14:00,058 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 02:14:00,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 02:14:00,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 02:14:00,063 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 02:14:00,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:14:00" (1/1) ... [2022-07-21 02:14:00,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e4c1fc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:00, skipping insertion in model container [2022-07-21 02:14:00,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:14:00" (1/1) ... [2022-07-21 02:14:00,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 02:14:00,103 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 02:14:00,384 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/dll2c_update_all_reverse.i[24556,24569] [2022-07-21 02:14:00,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:14:00,397 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 02:14:00,433 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/dll2c_update_all_reverse.i[24556,24569] [2022-07-21 02:14:00,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:14:00,450 INFO L208 MainTranslator]: Completed translation [2022-07-21 02:14:00,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:00 WrapperNode [2022-07-21 02:14:00,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 02:14:00,465 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 02:14:00,479 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 02:14:00,479 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 02:14:00,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:00" (1/1) ... [2022-07-21 02:14:00,507 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:00" (1/1) ... [2022-07-21 02:14:00,525 INFO L137 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 131 [2022-07-21 02:14:00,526 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 02:14:00,527 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 02:14:00,527 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 02:14:00,527 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 02:14:00,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:00" (1/1) ... [2022-07-21 02:14:00,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:00" (1/1) ... [2022-07-21 02:14:00,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:00" (1/1) ... [2022-07-21 02:14:00,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:00" (1/1) ... [2022-07-21 02:14:00,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:00" (1/1) ... [2022-07-21 02:14:00,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:00" (1/1) ... [2022-07-21 02:14:00,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:00" (1/1) ... [2022-07-21 02:14:00,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 02:14:00,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 02:14:00,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 02:14:00,551 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 02:14:00,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:00" (1/1) ... [2022-07-21 02:14:00,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:14:00,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:14:00,585 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-21 02:14:00,588 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-21 02:14:00,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 02:14:00,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 02:14:00,613 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-21 02:14:00,613 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-21 02:14:00,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 02:14:00,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 02:14:00,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 02:14:00,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 02:14:00,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 02:14:00,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 02:14:00,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 02:14:00,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 02:14:00,739 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 02:14:00,740 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 02:14:00,975 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 02:14:00,979 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 02:14:00,982 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-21 02:14:00,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:14:00 BoogieIcfgContainer [2022-07-21 02:14:00,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 02:14:00,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 02:14:00,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 02:14:00,987 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 02:14:00,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 02:14:00" (1/3) ... [2022-07-21 02:14:00,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@426dbf14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:14:00, skipping insertion in model container [2022-07-21 02:14:00,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:00" (2/3) ... [2022-07-21 02:14:00,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@426dbf14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:14:00, skipping insertion in model container [2022-07-21 02:14:00,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:14:00" (3/3) ... [2022-07-21 02:14:00,989 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.i [2022-07-21 02:14:00,998 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 02:14:00,998 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 02:14:01,037 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 02:14:01,043 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@9f31b2b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@58fc29f0 [2022-07-21 02:14:01,043 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 02:14:01,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 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-21 02:14:01,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 02:14:01,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:01,052 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-21 02:14:01,052 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:01,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:01,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1387430191, now seen corresponding path program 1 times [2022-07-21 02:14:01,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:14:01,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101694899] [2022-07-21 02:14:01,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:01,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:14:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:01,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:14:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:01,270 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-21 02:14:01,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:14:01,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101694899] [2022-07-21 02:14:01,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101694899] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:14:01,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:14:01,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 02:14:01,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202408143] [2022-07-21 02:14:01,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:14:01,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 02:14:01,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:14:01,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 02:14:01,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:14:01,302 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 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-21 02:14:01,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:14:01,352 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2022-07-21 02:14:01,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 02:14:01,354 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-21 02:14:01,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:14:01,359 INFO L225 Difference]: With dead ends: 63 [2022-07-21 02:14:01,359 INFO L226 Difference]: Without dead ends: 30 [2022-07-21 02:14:01,361 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-21 02:14:01,364 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:14:01,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:14:01,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-21 02:14:01,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-21 02:14:01,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 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-21 02:14:01,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-07-21 02:14:01,388 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 20 [2022-07-21 02:14:01,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:14:01,389 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-07-21 02:14:01,389 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-21 02:14:01,389 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-07-21 02:14:01,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 02:14:01,391 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:01,392 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-21 02:14:01,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 02:14:01,392 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:01,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:01,393 INFO L85 PathProgramCache]: Analyzing trace with hash 498100996, now seen corresponding path program 1 times [2022-07-21 02:14:01,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:14:01,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989168181] [2022-07-21 02:14:01,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:01,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:14:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:01,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:14:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:01,511 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-21 02:14:01,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:14:01,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989168181] [2022-07-21 02:14:01,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989168181] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:14:01,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:14:01,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:14:01,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75229499] [2022-07-21 02:14:01,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:14:01,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:14:01,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:14:01,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:14:01,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:14:01,523 INFO L87 Difference]: Start difference. First operand 30 states and 36 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-21 02:14:01,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:14:01,554 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-07-21 02:14:01,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:14:01,555 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-21 02:14:01,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:14:01,556 INFO L225 Difference]: With dead ends: 51 [2022-07-21 02:14:01,556 INFO L226 Difference]: Without dead ends: 35 [2022-07-21 02:14:01,560 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-21 02:14:01,561 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:14:01,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 86 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:14:01,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-21 02:14:01,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-07-21 02:14:01,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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-21 02:14:01,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-07-21 02:14:01,572 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2022-07-21 02:14:01,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:14:01,573 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-07-21 02:14:01,573 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-21 02:14:01,574 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-07-21 02:14:01,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-21 02:14:01,575 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:01,575 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] [2022-07-21 02:14:01,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 02:14:01,576 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:01,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:01,577 INFO L85 PathProgramCache]: Analyzing trace with hash 698671896, now seen corresponding path program 1 times [2022-07-21 02:14:01,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:14:01,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350117889] [2022-07-21 02:14:01,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:01,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:14:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:01,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:14:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:01,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 02:14:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:01,732 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-21 02:14:01,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:14:01,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350117889] [2022-07-21 02:14:01,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350117889] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:14:01,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:14:01,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 02:14:01,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405850759] [2022-07-21 02:14:01,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:14:01,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 02:14:01,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:14:01,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 02:14:01,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:14:01,746 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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-21 02:14:01,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:14:01,798 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-07-21 02:14:01,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 02:14:01,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 30 [2022-07-21 02:14:01,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:14:01,799 INFO L225 Difference]: With dead ends: 53 [2022-07-21 02:14:01,799 INFO L226 Difference]: Without dead ends: 44 [2022-07-21 02:14:01,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:14:01,800 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 45 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:14:01,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 72 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:14:01,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-21 02:14:01,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2022-07-21 02:14:01,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 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-21 02:14:01,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-07-21 02:14:01,805 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 30 [2022-07-21 02:14:01,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:14:01,805 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-07-21 02:14:01,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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-21 02:14:01,806 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-07-21 02:14:01,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-21 02:14:01,810 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:01,810 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, 1, 1] [2022-07-21 02:14:01,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 02:14:01,810 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:01,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:01,811 INFO L85 PathProgramCache]: Analyzing trace with hash 143562896, now seen corresponding path program 1 times [2022-07-21 02:14:01,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:14:01,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477352430] [2022-07-21 02:14:01,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:01,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:14:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:01,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:14:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:01,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 02:14:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:01,904 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-21 02:14:01,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:14:01,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477352430] [2022-07-21 02:14:01,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477352430] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:14:01,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:14:01,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 02:14:01,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716881601] [2022-07-21 02:14:01,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:14:01,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 02:14:01,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:14:01,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 02:14:01,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-21 02:14:01,906 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 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-21 02:14:01,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:14:01,961 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2022-07-21 02:14:01,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 02:14:01,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 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 35 [2022-07-21 02:14:01,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:14:01,962 INFO L225 Difference]: With dead ends: 59 [2022-07-21 02:14:01,962 INFO L226 Difference]: Without dead ends: 45 [2022-07-21 02:14:01,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-21 02:14:01,963 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 45 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:14:01,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 88 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:14:01,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-21 02:14:01,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2022-07-21 02:14:01,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 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-21 02:14:01,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-07-21 02:14:01,968 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 35 [2022-07-21 02:14:01,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:14:01,968 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-07-21 02:14:01,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 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-21 02:14:01,969 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-07-21 02:14:01,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 02:14:01,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:01,969 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, 1, 1, 1] [2022-07-21 02:14:01,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 02:14:01,970 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:01,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:01,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1641789207, now seen corresponding path program 1 times [2022-07-21 02:14:01,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:14:01,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214856805] [2022-07-21 02:14:01,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:01,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:14:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:02,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:14:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:02,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 02:14:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 02:14:02,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:14:02,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214856805] [2022-07-21 02:14:02,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214856805] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:14:02,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225306054] [2022-07-21 02:14:02,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:02,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:14:02,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:14:02,084 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-21 02:14:02,087 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-21 02:14:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:02,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 02:14:02,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:14:02,327 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 02:14:02,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:14:02,387 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 02:14:02,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225306054] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:14:02,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:14:02,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-07-21 02:14:02,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591991210] [2022-07-21 02:14:02,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:14:02,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 02:14:02,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:14:02,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 02:14:02,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-21 02:14:02,389 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 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-21 02:14:02,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:14:02,427 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2022-07-21 02:14:02,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 02:14:02,428 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 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 36 [2022-07-21 02:14:02,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:14:02,429 INFO L225 Difference]: With dead ends: 56 [2022-07-21 02:14:02,429 INFO L226 Difference]: Without dead ends: 47 [2022-07-21 02:14:02,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-21 02:14:02,430 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 84 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:14:02,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 97 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:14:02,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-21 02:14:02,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2022-07-21 02:14:02,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 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-21 02:14:02,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-07-21 02:14:02,436 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 36 [2022-07-21 02:14:02,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:14:02,436 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-07-21 02:14:02,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 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-21 02:14:02,436 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-07-21 02:14:02,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 02:14:02,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:02,437 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, 1] [2022-07-21 02:14:02,458 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-21 02:14:02,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:14:02,652 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:02,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:02,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1233857887, now seen corresponding path program 2 times [2022-07-21 02:14:02,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:14:02,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79386847] [2022-07-21 02:14:02,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:02,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:14:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:02,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:14:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:02,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 02:14:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:02,760 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 02:14:02,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:14:02,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79386847] [2022-07-21 02:14:02,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79386847] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:14:02,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:14:02,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 02:14:02,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851887415] [2022-07-21 02:14:02,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:14:02,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 02:14:02,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:14:02,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 02:14:02,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 02:14:02,762 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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-21 02:14:02,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:14:02,806 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-07-21 02:14:02,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 02:14:02,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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 41 [2022-07-21 02:14:02,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:14:02,810 INFO L225 Difference]: With dead ends: 55 [2022-07-21 02:14:02,810 INFO L226 Difference]: Without dead ends: 47 [2022-07-21 02:14:02,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 02:14:02,814 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 32 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:14:02,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 98 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:14:02,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-21 02:14:02,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2022-07-21 02:14:02,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 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-21 02:14:02,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-07-21 02:14:02,829 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 41 [2022-07-21 02:14:02,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:14:02,829 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-07-21 02:14:02,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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-21 02:14:02,830 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-07-21 02:14:02,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-21 02:14:02,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:02,832 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, 1, 1] [2022-07-21 02:14:02,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 02:14:02,832 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:02,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:02,832 INFO L85 PathProgramCache]: Analyzing trace with hash -353457273, now seen corresponding path program 1 times [2022-07-21 02:14:02,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:14:02,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454506699] [2022-07-21 02:14:02,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:02,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:14:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:03,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:14:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:03,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 02:14:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:03,547 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 02:14:03,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:14:03,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454506699] [2022-07-21 02:14:03,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454506699] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:14:03,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032769468] [2022-07-21 02:14:03,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:03,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:14:03,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:14:03,562 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-21 02:14:03,605 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-21 02:14:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:03,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 107 conjunts are in the unsatisfiable core [2022-07-21 02:14:03,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:14:03,750 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-21 02:14:03,887 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:14:03,887 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-21 02:14:03,922 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-21 02:14:03,963 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:14:03,964 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 26 treesize of output 27 [2022-07-21 02:14:04,066 INFO L356 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2022-07-21 02:14:04,067 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-21 02:14:04,087 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-21 02:14:04,281 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,SelfDestructingSolverStorable6 [2022-07-21 02:14:04,282 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_36| input size 47 context size 47 output size 47 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-21 02:14:04,285 INFO L158 Benchmark]: Toolchain (without parser) took 4226.45ms. Allocated memory was 60.8MB in the beginning and 88.1MB in the end (delta: 27.3MB). Free memory was 38.1MB in the beginning and 62.3MB in the end (delta: -24.2MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2022-07-21 02:14:04,285 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 60.8MB. Free memory was 42.5MB in the beginning and 42.5MB in the end (delta: 50.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 02:14:04,285 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.48ms. Allocated memory is still 60.8MB. Free memory was 37.9MB in the beginning and 36.4MB in the end (delta: 1.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-21 02:14:04,285 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.77ms. Allocated memory is still 60.8MB. Free memory was 36.2MB in the beginning and 34.2MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 02:14:04,286 INFO L158 Benchmark]: Boogie Preprocessor took 23.54ms. Allocated memory is still 60.8MB. Free memory was 34.2MB in the beginning and 32.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 02:14:04,286 INFO L158 Benchmark]: RCFGBuilder took 433.08ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 32.4MB in the beginning and 48.1MB in the end (delta: -15.6MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2022-07-21 02:14:04,286 INFO L158 Benchmark]: TraceAbstraction took 3299.46ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 47.5MB in the beginning and 62.3MB in the end (delta: -14.8MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. [2022-07-21 02:14:04,287 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.18ms. Allocated memory is still 60.8MB. Free memory was 42.5MB in the beginning and 42.5MB in the end (delta: 50.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 404.48ms. Allocated memory is still 60.8MB. Free memory was 37.9MB in the beginning and 36.4MB in the end (delta: 1.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.77ms. Allocated memory is still 60.8MB. Free memory was 36.2MB in the beginning and 34.2MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.54ms. Allocated memory is still 60.8MB. Free memory was 34.2MB in the beginning and 32.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 433.08ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 32.4MB in the beginning and 48.1MB in the end (delta: -15.6MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3299.46ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 47.5MB in the beginning and 62.3MB in the end (delta: -14.8MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_36| input size 47 context size 47 output size 47 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_36| input size 47 context size 47 output size 47: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-21 02:14:04,311 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/dll2c_update_all_reverse.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 02:14:05,913 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 02:14:05,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 02:14:05,949 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 02:14:05,949 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 02:14:05,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 02:14:05,953 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 02:14:05,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 02:14:05,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 02:14:05,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 02:14:05,961 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 02:14:05,965 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 02:14:05,965 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 02:14:05,966 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 02:14:05,967 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 02:14:05,970 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 02:14:05,970 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 02:14:05,972 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 02:14:05,973 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 02:14:05,976 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 02:14:05,977 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 02:14:05,979 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 02:14:05,980 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 02:14:05,980 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 02:14:05,981 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 02:14:05,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 02:14:05,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 02:14:05,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 02:14:05,986 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 02:14:05,986 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 02:14:05,986 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 02:14:05,987 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 02:14:05,988 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 02:14:05,988 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 02:14:05,989 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 02:14:05,990 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 02:14:05,990 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 02:14:05,990 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 02:14:05,990 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 02:14:05,990 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 02:14:05,991 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 02:14:05,992 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 02:14:05,992 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-21 02:14:06,019 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 02:14:06,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 02:14:06,020 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 02:14:06,020 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 02:14:06,020 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 02:14:06,020 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 02:14:06,021 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 02:14:06,021 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 02:14:06,021 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 02:14:06,022 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 02:14:06,022 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 02:14:06,022 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 02:14:06,022 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 02:14:06,022 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 02:14:06,029 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 02:14:06,029 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 02:14:06,029 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 02:14:06,029 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 02:14:06,029 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 02:14:06,029 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 02:14:06,029 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 02:14:06,029 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 02:14:06,029 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 02:14:06,030 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 02:14:06,030 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 02:14:06,030 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 02:14:06,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:14:06,030 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 02:14:06,030 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 02:14:06,030 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 02:14:06,030 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 02:14:06,030 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 02:14:06,031 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 02:14:06,031 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 02:14:06,031 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 02:14:06,031 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 02:14:06,031 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.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 -> 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 [2022-07-21 02:14:06,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 02:14:06,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 02:14:06,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 02:14:06,354 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 02:14:06,354 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 02:14:06,355 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-07-21 02:14:06,416 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b490ae2c8/1671f0beaf814bca8b79bf926d83db09/FLAG554ddf974 [2022-07-21 02:14:06,861 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 02:14:06,861 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-07-21 02:14:06,870 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b490ae2c8/1671f0beaf814bca8b79bf926d83db09/FLAG554ddf974 [2022-07-21 02:14:06,899 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b490ae2c8/1671f0beaf814bca8b79bf926d83db09 [2022-07-21 02:14:06,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 02:14:06,903 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 02:14:06,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 02:14:06,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 02:14:06,911 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 02:14:06,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:14:06" (1/1) ... [2022-07-21 02:14:06,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ee7d4f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:06, skipping insertion in model container [2022-07-21 02:14:06,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:14:06" (1/1) ... [2022-07-21 02:14:06,918 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 02:14:06,939 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 02:14:07,095 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/dll2c_update_all_reverse.i[24556,24569] [2022-07-21 02:14:07,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:14:07,104 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 02:14:07,140 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/dll2c_update_all_reverse.i[24556,24569] [2022-07-21 02:14:07,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:14:07,166 INFO L208 MainTranslator]: Completed translation [2022-07-21 02:14:07,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:07 WrapperNode [2022-07-21 02:14:07,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 02:14:07,167 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 02:14:07,167 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 02:14:07,167 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 02:14:07,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:07" (1/1) ... [2022-07-21 02:14:07,199 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:07" (1/1) ... [2022-07-21 02:14:07,223 INFO L137 Inliner]: procedures = 129, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 131 [2022-07-21 02:14:07,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 02:14:07,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 02:14:07,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 02:14:07,226 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 02:14:07,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:07" (1/1) ... [2022-07-21 02:14:07,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:07" (1/1) ... [2022-07-21 02:14:07,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:07" (1/1) ... [2022-07-21 02:14:07,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:07" (1/1) ... [2022-07-21 02:14:07,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:07" (1/1) ... [2022-07-21 02:14:07,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:07" (1/1) ... [2022-07-21 02:14:07,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:07" (1/1) ... [2022-07-21 02:14:07,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 02:14:07,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 02:14:07,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 02:14:07,273 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 02:14:07,274 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:07" (1/1) ... [2022-07-21 02:14:07,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:14:07,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:14:07,317 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-21 02:14:07,368 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-21 02:14:07,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-21 02:14:07,380 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-21 02:14:07,380 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-21 02:14:07,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 02:14:07,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 02:14:07,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 02:14:07,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 02:14:07,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 02:14:07,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-21 02:14:07,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 02:14:07,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 02:14:07,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 02:14:07,507 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 02:14:07,509 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 02:14:07,756 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 02:14:07,760 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 02:14:07,761 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-21 02:14:07,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:14:07 BoogieIcfgContainer [2022-07-21 02:14:07,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 02:14:07,763 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 02:14:07,764 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 02:14:07,766 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 02:14:07,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 02:14:06" (1/3) ... [2022-07-21 02:14:07,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d3a571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:14:07, skipping insertion in model container [2022-07-21 02:14:07,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:14:07" (2/3) ... [2022-07-21 02:14:07,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d3a571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:14:07, skipping insertion in model container [2022-07-21 02:14:07,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:14:07" (3/3) ... [2022-07-21 02:14:07,768 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.i [2022-07-21 02:14:07,777 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 02:14:07,778 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 02:14:07,809 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 02:14:07,814 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@61c12817, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7361e1c [2022-07-21 02:14:07,815 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 02:14:07,818 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 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-21 02:14:07,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 02:14:07,824 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:07,824 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-21 02:14:07,825 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:07,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:07,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1387430191, now seen corresponding path program 1 times [2022-07-21 02:14:07,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:14:07,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [536409294] [2022-07-21 02:14:07,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:07,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:14:07,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:14:07,856 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:14:07,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-21 02:14:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:07,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-21 02:14:07,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:14:07,985 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-21 02:14:07,986 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:14:07,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:14:07,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [536409294] [2022-07-21 02:14:07,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [536409294] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:14:07,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:14:07,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 02:14:07,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786109271] [2022-07-21 02:14:07,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:14:07,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 02:14:07,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:14:08,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 02:14:08,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 02:14:08,012 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 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 2 states, 2 states have (on average 9.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-21 02:14:08,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:14:08,026 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2022-07-21 02:14:08,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 02:14:08,028 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.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-21 02:14:08,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:14:08,033 INFO L225 Difference]: With dead ends: 63 [2022-07-21 02:14:08,033 INFO L226 Difference]: Without dead ends: 30 [2022-07-21 02:14:08,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 02:14:08,037 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:14:08,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:14:08,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-21 02:14:08,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-21 02:14:08,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 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-21 02:14:08,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-07-21 02:14:08,063 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 20 [2022-07-21 02:14:08,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:14:08,064 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-07-21 02:14:08,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.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-21 02:14:08,065 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-07-21 02:14:08,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 02:14:08,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:08,066 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-21 02:14:08,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-21 02:14:08,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:14:08,275 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:08,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:08,276 INFO L85 PathProgramCache]: Analyzing trace with hash 498100996, now seen corresponding path program 1 times [2022-07-21 02:14:08,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:14:08,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1851191762] [2022-07-21 02:14:08,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:08,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:14:08,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:14:08,279 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:14:08,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-21 02:14:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:08,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 02:14:08,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:14:08,433 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-21 02:14:08,434 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:14:08,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:14:08,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1851191762] [2022-07-21 02:14:08,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1851191762] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:14:08,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:14:08,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 02:14:08,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742069737] [2022-07-21 02:14:08,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:14:08,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 02:14:08,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:14:08,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 02:14:08,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:14:08,440 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 3 states, 3 states have (on average 6.0) 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-21 02:14:08,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:14:08,451 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-07-21 02:14:08,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 02:14:08,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) 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-21 02:14:08,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:14:08,453 INFO L225 Difference]: With dead ends: 51 [2022-07-21 02:14:08,453 INFO L226 Difference]: Without dead ends: 35 [2022-07-21 02:14:08,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-21 02:14:08,461 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:14:08,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 65 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:14:08,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-21 02:14:08,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-07-21 02:14:08,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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-21 02:14:08,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-07-21 02:14:08,466 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2022-07-21 02:14:08,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:14:08,476 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-07-21 02:14:08,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) 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-21 02:14:08,476 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-07-21 02:14:08,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-21 02:14:08,477 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:08,477 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] [2022-07-21 02:14:08,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-21 02:14:08,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:14:08,686 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:08,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:08,689 INFO L85 PathProgramCache]: Analyzing trace with hash 698671896, now seen corresponding path program 1 times [2022-07-21 02:14:08,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:14:08,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080959611] [2022-07-21 02:14:08,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:08,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:14:08,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:14:08,691 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:14:08,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-21 02:14:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:08,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 02:14:08,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:14:08,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-21 02:14:08,875 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:14:08,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:14:08,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080959611] [2022-07-21 02:14:08,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080959611] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:14:08,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:14:08,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:14:08,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783100894] [2022-07-21 02:14:08,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:14:08,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:14:08,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:14:08,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:14:08,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:14:08,878 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-21 02:14:08,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:14:08,904 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-07-21 02:14:08,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:14:08,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 30 [2022-07-21 02:14:08,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:14:08,905 INFO L225 Difference]: With dead ends: 53 [2022-07-21 02:14:08,906 INFO L226 Difference]: Without dead ends: 44 [2022-07-21 02:14:08,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:14:08,907 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 45 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:14:08,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 65 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:14:08,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-21 02:14:08,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2022-07-21 02:14:08,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 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-21 02:14:08,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-07-21 02:14:08,915 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 30 [2022-07-21 02:14:08,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:14:08,916 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-07-21 02:14:08,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-21 02:14:08,916 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-07-21 02:14:08,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-21 02:14:08,917 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:08,917 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, 1, 1] [2022-07-21 02:14:08,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-21 02:14:09,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:14:09,124 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:09,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:09,124 INFO L85 PathProgramCache]: Analyzing trace with hash 143562896, now seen corresponding path program 1 times [2022-07-21 02:14:09,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:14:09,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [377724710] [2022-07-21 02:14:09,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:09,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:14:09,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:14:09,129 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:14:09,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-21 02:14:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:09,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 02:14:09,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:14:09,350 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-21 02:14:09,351 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:14:09,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:14:09,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [377724710] [2022-07-21 02:14:09,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [377724710] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:14:09,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:14:09,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 02:14:09,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552683295] [2022-07-21 02:14:09,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:14:09,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 02:14:09,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:14:09,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 02:14:09,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:14:09,357 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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-21 02:14:09,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:14:09,416 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2022-07-21 02:14:09,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 02:14:09,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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 35 [2022-07-21 02:14:09,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:14:09,418 INFO L225 Difference]: With dead ends: 59 [2022-07-21 02:14:09,419 INFO L226 Difference]: Without dead ends: 45 [2022-07-21 02:14:09,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 02:14:09,420 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 45 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:14:09,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 92 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:14:09,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-21 02:14:09,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2022-07-21 02:14:09,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 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-21 02:14:09,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-07-21 02:14:09,430 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 35 [2022-07-21 02:14:09,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:14:09,431 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-07-21 02:14:09,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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-21 02:14:09,431 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-07-21 02:14:09,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 02:14:09,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:09,432 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, 1, 1, 1] [2022-07-21 02:14:09,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-21 02:14:09,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:14:09,644 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:09,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:09,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1641789207, now seen corresponding path program 1 times [2022-07-21 02:14:09,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:14:09,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [333712812] [2022-07-21 02:14:09,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:09,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:14:09,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:14:09,648 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:14:09,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-21 02:14:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:09,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 02:14:09,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:14:09,812 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 02:14:09,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:14:09,886 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 02:14:09,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:14:09,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [333712812] [2022-07-21 02:14:09,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [333712812] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:14:09,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:14:09,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-21 02:14:09,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809806508] [2022-07-21 02:14:09,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:14:09,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 02:14:09,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:14:09,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 02:14:09,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-21 02:14:09,888 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (4), 1 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-21 02:14:09,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:14:09,989 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-07-21 02:14:09,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 02:14:09,989 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (4), 1 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 36 [2022-07-21 02:14:09,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:14:09,990 INFO L225 Difference]: With dead ends: 67 [2022-07-21 02:14:09,990 INFO L226 Difference]: Without dead ends: 58 [2022-07-21 02:14:09,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-07-21 02:14:09,991 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 80 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:14:09,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 156 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 02:14:09,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-21 02:14:09,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 38. [2022-07-21 02:14:09,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 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-21 02:14:09,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-07-21 02:14:09,999 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 36 [2022-07-21 02:14:09,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:14:09,999 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-07-21 02:14:09,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (4), 1 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-21 02:14:09,999 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-07-21 02:14:10,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 02:14:10,000 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:10,000 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, 1] [2022-07-21 02:14:10,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-21 02:14:10,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:14:10,210 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:10,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:10,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1233857887, now seen corresponding path program 2 times [2022-07-21 02:14:10,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:14:10,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625734634] [2022-07-21 02:14:10,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 02:14:10,213 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:14:10,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:14:10,214 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:14:10,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-21 02:14:10,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 02:14:10,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:14:10,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 02:14:10,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:14:10,379 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 02:14:10,379 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:14:10,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:14:10,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625734634] [2022-07-21 02:14:10,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1625734634] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:14:10,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:14:10,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 02:14:10,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250210805] [2022-07-21 02:14:10,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:14:10,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 02:14:10,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:14:10,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 02:14:10,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:14:10,383 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-21 02:14:10,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:14:10,425 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-07-21 02:14:10,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 02:14:10,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 41 [2022-07-21 02:14:10,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:14:10,429 INFO L225 Difference]: With dead ends: 55 [2022-07-21 02:14:10,429 INFO L226 Difference]: Without dead ends: 47 [2022-07-21 02:14:10,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 02:14:10,432 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 32 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:14:10,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 92 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:14:10,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-21 02:14:10,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2022-07-21 02:14:10,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 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-21 02:14:10,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-07-21 02:14:10,449 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 41 [2022-07-21 02:14:10,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:14:10,450 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-07-21 02:14:10,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-21 02:14:10,450 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-07-21 02:14:10,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-21 02:14:10,452 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:10,452 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, 1, 1] [2022-07-21 02:14:10,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-21 02:14:10,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:14:10,662 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:10,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:10,662 INFO L85 PathProgramCache]: Analyzing trace with hash -353457273, now seen corresponding path program 1 times [2022-07-21 02:14:10,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:14:10,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276045756] [2022-07-21 02:14:10,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:10,663 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:14:10,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:14:10,664 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:14:10,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-21 02:14:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:10,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-21 02:14:10,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:14:10,889 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-21 02:14:10,991 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:14:10,992 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 12 treesize of output 12 [2022-07-21 02:14:11,019 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-21 02:14:11,066 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:14:11,066 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 26 treesize of output 27 [2022-07-21 02:14:11,149 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-07-21 02:14:11,150 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 38 [2022-07-21 02:14:11,156 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 13 treesize of output 15 [2022-07-21 02:14:11,446 INFO L356 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2022-07-21 02:14:11,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 65 [2022-07-21 02:14:11,455 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 29 treesize of output 21 [2022-07-21 02:14:11,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:11,465 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 32 treesize of output 34 [2022-07-21 02:14:11,470 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 5 treesize of output 3 [2022-07-21 02:14:11,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:11,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2022-07-21 02:14:11,690 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 28 treesize of output 30 [2022-07-21 02:14:11,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:14:11,696 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 35 treesize of output 34 [2022-07-21 02:14:11,970 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 40 treesize of output 28 [2022-07-21 02:14:11,979 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 28 treesize of output 20 [2022-07-21 02:14:12,138 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 26 treesize of output 14 [2022-07-21 02:14:12,384 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 02:14:12,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:14:13,106 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_421 (_ BitVec 32)) (v_ArrVal_420 (_ BitVec 32))) (= (bvadd (_ bv4294967295 32) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_418) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_420)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_421)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2022-07-21 02:14:13,137 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_418 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv4294967295 32) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_418) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-07-21 02:14:13,155 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:14:13,156 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 40 treesize of output 41 [2022-07-21 02:14:13,169 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:14:13,169 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 79 treesize of output 82 [2022-07-21 02:14:13,177 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 29 treesize of output 18 [2022-07-21 02:14:13,223 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_416) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_415 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv8 32) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_415) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (= (bvadd (_ bv4294967295 32) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) |c_ULTIMATE.start_dll_circular_update_at_~data#1|) (forall ((v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_416) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-21 02:14:13,253 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_416) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_415 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_415) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)))) (forall ((v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_416) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0))) (= (bvadd (_ bv4294967295 32) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) |c_ULTIMATE.start_dll_circular_update_at_~data#1|)) is different from false [2022-07-21 02:14:13,284 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_416) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_416) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0))) (= (bvadd (_ bv4294967295 32) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (bvadd |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (forall ((v_ArrVal_415 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv8 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_415) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-07-21 02:14:13,302 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_415 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (_ bv8 32)) (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_415) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))) (forall ((v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_416) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) .cse0))) (forall ((v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_416) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) |c_ULTIMATE.start_dll_circular_create_#res#1.base|)))) is different from false [2022-07-21 02:14:13,320 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 7 treesize of output 5 [2022-07-21 02:14:13,327 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_409 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= .cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_409)) .cse0 v_ArrVal_416) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) (forall ((v_ArrVal_409 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (store (store .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_409)) (select .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_416))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) is different from false [2022-07-21 02:14:13,365 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_409 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_409)) .cse2 v_ArrVal_416) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) .cse2))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_409 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (store (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_409)) (select .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_416))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2022-07-21 02:14:13,413 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_409 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_404))) (store .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_409)) .cse2 v_ArrVal_416) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) .cse2))))) (forall ((v_ArrVal_409 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_404))) (store .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_409)) (select .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_416))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_404))) (store .cse7 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2022-07-21 02:14:13,434 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:14:13,434 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 38 treesize of output 31 [2022-07-21 02:14:13,442 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:14:13,442 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 295 treesize of output 285 [2022-07-21 02:14:13,450 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 294 treesize of output 278 [2022-07-21 02:14:13,523 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 41 treesize of output 37 [2022-07-21 02:14:13,537 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 02:14:13,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 1 [2022-07-21 02:14:13,543 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 02:14:13,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 1 [2022-07-21 02:14:13,917 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-21 02:14:13,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:14:13,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276045756] [2022-07-21 02:14:13,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276045756] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:14:13,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:14:13,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 44 [2022-07-21 02:14:13,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865532536] [2022-07-21 02:14:13,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:14:13,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-21 02:14:13,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:14:13,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-21 02:14:13,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1116, Unknown=9, NotChecked=666, Total=1892 [2022-07-21 02:14:13,919 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 44 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 39 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:14:17,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:14:17,711 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2022-07-21 02:14:17,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 02:14:17,711 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 39 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 42 [2022-07-21 02:14:17,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:14:17,713 INFO L225 Difference]: With dead ends: 69 [2022-07-21 02:14:17,713 INFO L226 Difference]: Without dead ends: 67 [2022-07-21 02:14:17,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 39 SyntacticMatches, 8 SemanticMatches, 49 ConstructedPredicates, 9 IntricatePredicates, 2 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=141, Invalid=1608, Unknown=9, NotChecked=792, Total=2550 [2022-07-21 02:14:17,714 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 392 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 02:14:17,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 620 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 327 Invalid, 0 Unknown, 392 Unchecked, 0.8s Time] [2022-07-21 02:14:17,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-21 02:14:17,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-07-21 02:14:17,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 61 states have internal predecessors, (74), 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-21 02:14:17,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2022-07-21 02:14:17,732 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 42 [2022-07-21 02:14:17,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:14:17,733 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2022-07-21 02:14:17,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 39 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 02:14:17,733 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2022-07-21 02:14:17,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-21 02:14:17,735 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:17,735 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, 1, 1, 1] [2022-07-21 02:14:17,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-21 02:14:17,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:14:17,946 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:17,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:17,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1979380319, now seen corresponding path program 2 times [2022-07-21 02:14:17,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:14:17,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2142927233] [2022-07-21 02:14:17,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 02:14:17,948 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:14:17,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:14:17,949 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:14:17,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-21 02:14:18,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 02:14:18,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:14:18,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 02:14:18,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:14:18,151 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 02:14:18,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:14:18,244 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 02:14:18,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:14:18,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2142927233] [2022-07-21 02:14:18,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2142927233] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:14:18,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:14:18,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-21 02:14:18,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304930651] [2022-07-21 02:14:18,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:14:18,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 02:14:18,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:14:18,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 02:14:18,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-21 02:14:18,245 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (4), 1 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-21 02:14:18,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:14:18,420 INFO L93 Difference]: Finished difference Result 106 states and 126 transitions. [2022-07-21 02:14:18,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 02:14:18,421 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (4), 1 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 43 [2022-07-21 02:14:18,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:14:18,422 INFO L225 Difference]: With dead ends: 106 [2022-07-21 02:14:18,422 INFO L226 Difference]: Without dead ends: 98 [2022-07-21 02:14:18,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2022-07-21 02:14:18,422 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 116 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:14:18,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 162 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 02:14:18,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-21 02:14:18,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 74. [2022-07-21 02:14:18,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 69 states have internal predecessors, (83), 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-21 02:14:18,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2022-07-21 02:14:18,430 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 43 [2022-07-21 02:14:18,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:14:18,430 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2022-07-21 02:14:18,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (4), 1 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-21 02:14:18,430 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2022-07-21 02:14:18,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-21 02:14:18,431 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:18,431 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, 1, 1, 1] [2022-07-21 02:14:18,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-21 02:14:18,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:14:18,645 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:18,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:18,645 INFO L85 PathProgramCache]: Analyzing trace with hash 497262156, now seen corresponding path program 3 times [2022-07-21 02:14:18,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:14:18,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938314228] [2022-07-21 02:14:18,646 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 02:14:18,646 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:14:18,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:14:18,648 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:14:18,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-21 02:14:18,840 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-21 02:14:18,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:14:18,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 02:14:18,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:14:18,913 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-21 02:14:18,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:14:19,018 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-21 02:14:19,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:14:19,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1938314228] [2022-07-21 02:14:19,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1938314228] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:14:19,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:14:19,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-21 02:14:19,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362553128] [2022-07-21 02:14:19,019 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:14:19,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 02:14:19,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:14:19,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 02:14:19,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-21 02:14:19,021 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (4), 1 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-21 02:14:19,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:14:19,150 INFO L93 Difference]: Finished difference Result 100 states and 119 transitions. [2022-07-21 02:14:19,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 02:14:19,151 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (4), 1 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 43 [2022-07-21 02:14:19,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:14:19,152 INFO L225 Difference]: With dead ends: 100 [2022-07-21 02:14:19,152 INFO L226 Difference]: Without dead ends: 76 [2022-07-21 02:14:19,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2022-07-21 02:14:19,154 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 108 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:14:19,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 165 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 02:14:19,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-21 02:14:19,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2022-07-21 02:14:19,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.173913043478261) internal successors, (81), 69 states have internal predecessors, (81), 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-21 02:14:19,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2022-07-21 02:14:19,169 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 87 transitions. Word has length 43 [2022-07-21 02:14:19,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:14:19,170 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 87 transitions. [2022-07-21 02:14:19,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (4), 1 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-21 02:14:19,170 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2022-07-21 02:14:19,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-21 02:14:19,171 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:19,171 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, 1, 1, 1] [2022-07-21 02:14:19,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-21 02:14:19,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:14:19,382 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:19,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:19,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1076128498, now seen corresponding path program 4 times [2022-07-21 02:14:19,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:14:19,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857477454] [2022-07-21 02:14:19,383 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 02:14:19,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:14:19,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:14:19,384 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:14:19,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-21 02:14:19,499 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 02:14:19,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:14:19,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 02:14:19,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:14:19,532 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 02:14:19,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:14:19,591 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 02:14:19,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:14:19,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [857477454] [2022-07-21 02:14:19,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [857477454] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:14:19,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:14:19,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-21 02:14:19,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456669990] [2022-07-21 02:14:19,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:14:19,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 02:14:19,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:14:19,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 02:14:19,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-21 02:14:19,592 INFO L87 Difference]: Start difference. First operand 74 states and 87 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (4), 1 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-21 02:14:19,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:14:19,764 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2022-07-21 02:14:19,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 02:14:19,764 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (4), 1 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 43 [2022-07-21 02:14:19,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:14:19,766 INFO L225 Difference]: With dead ends: 155 [2022-07-21 02:14:19,766 INFO L226 Difference]: Without dead ends: 126 [2022-07-21 02:14:19,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2022-07-21 02:14:19,767 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 257 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:14:19,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 181 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:14:19,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-21 02:14:19,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 74. [2022-07-21 02:14:19,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.144927536231884) internal successors, (79), 69 states have internal predecessors, (79), 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-21 02:14:19,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2022-07-21 02:14:19,778 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 43 [2022-07-21 02:14:19,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:14:19,778 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2022-07-21 02:14:19,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (4), 1 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-21 02:14:19,778 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2022-07-21 02:14:19,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-21 02:14:19,794 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:19,794 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, 1, 1] [2022-07-21 02:14:19,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-21 02:14:19,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:14:19,995 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:19,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:19,995 INFO L85 PathProgramCache]: Analyzing trace with hash 315770834, now seen corresponding path program 1 times [2022-07-21 02:14:19,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:14:19,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642670278] [2022-07-21 02:14:19,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:14:19,996 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:14:19,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:14:19,997 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:14:19,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-21 02:14:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:14:20,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-21 02:14:20,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:14:20,353 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 17 treesize of output 13 [2022-07-21 02:14:20,555 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 15 treesize of output 7 [2022-07-21 02:14:20,591 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 02:14:20,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:14:20,795 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 46 treesize of output 40 [2022-07-21 02:14:20,947 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-21 02:14:20,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:14:20,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642670278] [2022-07-21 02:14:20,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642670278] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:14:20,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:14:20,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 27 [2022-07-21 02:14:20,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823462385] [2022-07-21 02:14:20,948 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:14:20,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-21 02:14:20,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:14:20,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-21 02:14:20,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2022-07-21 02:14:20,949 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 27 states, 27 states have (on average 2.888888888888889) internal successors, (78), 26 states have internal predecessors, (78), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 02:14:22,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:14:22,417 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2022-07-21 02:14:22,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-21 02:14:22,418 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.888888888888889) internal successors, (78), 26 states have internal predecessors, (78), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2022-07-21 02:14:22,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:14:22,419 INFO L225 Difference]: With dead ends: 138 [2022-07-21 02:14:22,419 INFO L226 Difference]: Without dead ends: 136 [2022-07-21 02:14:22,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=320, Invalid=1572, Unknown=0, NotChecked=0, Total=1892 [2022-07-21 02:14:22,421 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 368 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:14:22,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 451 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-21 02:14:22,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-21 02:14:22,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 104. [2022-07-21 02:14:22,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 99 states have (on average 1.1414141414141414) internal successors, (113), 99 states have internal predecessors, (113), 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-21 02:14:22,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2022-07-21 02:14:22,464 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 48 [2022-07-21 02:14:22,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:14:22,465 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2022-07-21 02:14:22,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.888888888888889) internal successors, (78), 26 states have internal predecessors, (78), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 02:14:22,466 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2022-07-21 02:14:22,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-21 02:14:22,467 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:22,468 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, 1, 1] [2022-07-21 02:14:22,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-21 02:14:22,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:14:22,679 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:22,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:22,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1250615156, now seen corresponding path program 2 times [2022-07-21 02:14:22,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:14:22,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [126109923] [2022-07-21 02:14:22,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 02:14:22,680 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:14:22,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:14:22,682 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:14:22,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-21 02:14:22,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 02:14:22,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:14:22,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 02:14:22,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:14:22,897 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 02:14:22,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:14:22,998 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 02:14:22,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:14:22,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [126109923] [2022-07-21 02:14:22,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [126109923] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:14:22,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:14:22,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-21 02:14:22,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675065828] [2022-07-21 02:14:22,998 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:14:22,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 02:14:22,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:14:22,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 02:14:22,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-21 02:14:22,999 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (4), 1 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-21 02:14:23,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:14:23,116 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2022-07-21 02:14:23,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 02:14:23,117 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (4), 1 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 49 [2022-07-21 02:14:23,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:14:23,118 INFO L225 Difference]: With dead ends: 114 [2022-07-21 02:14:23,118 INFO L226 Difference]: Without dead ends: 105 [2022-07-21 02:14:23,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-07-21 02:14:23,119 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 91 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:14:23,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 127 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:14:23,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-21 02:14:23,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 92. [2022-07-21 02:14:23,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 87 states have (on average 1.1149425287356323) internal successors, (97), 87 states have internal predecessors, (97), 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-21 02:14:23,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2022-07-21 02:14:23,130 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 49 [2022-07-21 02:14:23,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:14:23,130 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2022-07-21 02:14:23,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (4), 1 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-21 02:14:23,131 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2022-07-21 02:14:23,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-21 02:14:23,131 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:23,131 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-07-21 02:14:23,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-21 02:14:23,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:14:23,339 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:23,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:23,340 INFO L85 PathProgramCache]: Analyzing trace with hash -744940389, now seen corresponding path program 5 times [2022-07-21 02:14:23,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:14:23,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1182107019] [2022-07-21 02:14:23,340 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 02:14:23,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:14:23,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:14:23,342 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:14:23,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-21 02:14:23,547 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-07-21 02:14:23,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:14:23,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 02:14:23,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:14:23,578 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 02:14:23,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:14:23,632 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-21 02:14:23,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:14:23,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1182107019] [2022-07-21 02:14:23,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1182107019] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-21 02:14:23,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 02:14:23,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2022-07-21 02:14:23,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593536557] [2022-07-21 02:14:23,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:14:23,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 02:14:23,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:14:23,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 02:14:23,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-21 02:14:23,633 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-21 02:14:23,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:14:23,658 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2022-07-21 02:14:23,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:14:23,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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) Word has length 52 [2022-07-21 02:14:23,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:14:23,660 INFO L225 Difference]: With dead ends: 111 [2022-07-21 02:14:23,660 INFO L226 Difference]: Without dead ends: 58 [2022-07-21 02:14:23,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-21 02:14:23,660 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 46 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:14:23,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 63 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:14:23,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-21 02:14:23,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-07-21 02:14:23,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 54 states have internal predecessors, (58), 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-21 02:14:23,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2022-07-21 02:14:23,669 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 52 [2022-07-21 02:14:23,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:14:23,669 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2022-07-21 02:14:23,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-21 02:14:23,669 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-07-21 02:14:23,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-21 02:14:23,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:14:23,670 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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-21 02:14:23,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-21 02:14:23,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:14:23,881 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:14:23,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:14:23,881 INFO L85 PathProgramCache]: Analyzing trace with hash 2003315528, now seen corresponding path program 3 times [2022-07-21 02:14:23,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:14:23,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663960723] [2022-07-21 02:14:23,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 02:14:23,882 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:14:23,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:14:23,883 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:14:23,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-21 02:14:24,096 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-21 02:14:24,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:14:24,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-21 02:14:24,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:14:24,177 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 15 treesize of output 11 [2022-07-21 02:14:24,458 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 40 treesize of output 22 [2022-07-21 02:14:24,571 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-21 02:14:24,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:14:24,956 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 42 treesize of output 36 [2022-07-21 02:14:25,136 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-21 02:14:25,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:14:25,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663960723] [2022-07-21 02:14:25,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [663960723] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:14:25,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:14:25,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2022-07-21 02:14:25,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952860790] [2022-07-21 02:14:25,138 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:14:25,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-21 02:14:25,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:14:25,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-21 02:14:25,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-07-21 02:14:25,139 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 2 states have call successors, (4), 1 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-21 02:14:26,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:14:26,052 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2022-07-21 02:14:26,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 02:14:26,052 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 2 states have call successors, (4), 1 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 53 [2022-07-21 02:14:26,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:14:26,053 INFO L225 Difference]: With dead ends: 62 [2022-07-21 02:14:26,053 INFO L226 Difference]: Without dead ends: 0 [2022-07-21 02:14:26,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2022-07-21 02:14:26,054 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 30 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 02:14:26,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 238 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 60 Unchecked, 0.3s Time] [2022-07-21 02:14:26,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-21 02:14:26,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-21 02:14:26,054 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-21 02:14:26,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-21 02:14:26,055 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2022-07-21 02:14:26,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:14:26,055 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-21 02:14:26,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 2 states have call successors, (4), 1 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-21 02:14:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-21 02:14:26,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-21 02:14:26,057 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 02:14:26,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-21 02:14:26,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:14:26,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-21 02:14:37,207 INFO L895 garLoopResultBuilder]: At program point L638(lines 626 645) the Hoare annotation is: false [2022-07-21 02:14:37,208 INFO L895 garLoopResultBuilder]: At program point L589(line 589) the Hoare annotation is: (and (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv1 1)) (not (bvsgt (bvadd |ULTIMATE.start_dll_circular_create_~len#1| (_ bv4294967295 32)) (_ bv1 32))) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) [2022-07-21 02:14:37,208 INFO L899 garLoopResultBuilder]: For program point L589-1(line 589) no Hoare annotation was computed. [2022-07-21 02:14:37,208 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-21 02:14:37,208 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-21 02:14:37,208 INFO L899 garLoopResultBuilder]: For program point L631-2(lines 631 634) no Hoare annotation was computed. [2022-07-21 02:14:37,208 INFO L895 garLoopResultBuilder]: At program point L631-3(lines 631 634) the Hoare annotation is: (let ((.cse10 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse9 (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32))) (.cse0 (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse1 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| (_ bv0 32))) (.cse2 (not (bvsgt |ULTIMATE.start_dll_circular_create_~len#1| (_ bv1 32)))) (.cse3 (= (bvadd (select (select |#memory_int| (select .cse10 |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (_ bv1 32)) (bvmul (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))) (.cse4 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32))) (.cse5 (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32))) (.cse6 (= |ULTIMATE.start_dll_circular_update_at_~index#1| (_ bv0 32))) (.cse7 (not (= (select .cse10 (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|))) (.cse8 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))) (or (and .cse0 .cse1 (not (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (bvsgt .cse9 (_ bv4294967295 32))) (and .cse0 .cse1 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~len~0#1| .cse9) .cse2 .cse4 .cse5 .cse8 (forall ((v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_416) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~len~0#1| (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32))))))) [2022-07-21 02:14:37,208 INFO L899 garLoopResultBuilder]: For program point L631-4(lines 631 634) no Hoare annotation was computed. [2022-07-21 02:14:37,208 INFO L895 garLoopResultBuilder]: At program point L599(lines 585 600) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv0 32)))) (and (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_dll_circular_create_#res#1.base|)) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| (_ bv0 32)) (not (bvsgt |ULTIMATE.start_dll_circular_create_~len#1| (_ bv1 32))) (not (= .cse0 |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) (_ bv0 32)) |ULTIMATE.start_dll_circular_create_#res#1.base|)) (= .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse1 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= .cse1 |ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) [2022-07-21 02:14:37,208 INFO L899 garLoopResultBuilder]: For program point L591(lines 591 593) no Hoare annotation was computed. [2022-07-21 02:14:37,208 INFO L899 garLoopResultBuilder]: For program point L591-2(lines 591 593) no Hoare annotation was computed. [2022-07-21 02:14:37,208 INFO L895 garLoopResultBuilder]: At program point L617(lines 612 618) the Hoare annotation is: (let ((.cse11 (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|)) (.cse12 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))))) (let ((.cse3 (bvsgt (bvadd .cse11 .cse12) (_ bv4294967295 32))) (.cse5 (not (bvsgt |ULTIMATE.start_dll_circular_create_~len#1| (_ bv1 32)))) (.cse6 (not (bvsgt (bvadd (_ bv4294967295 32) .cse11 .cse12) (_ bv4294967295 32)))) (.cse0 (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse1 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| (_ bv0 32))) (.cse2 (= |ULTIMATE.start_dll_circular_get_data_at_~index#1| (_ bv0 32))) (.cse7 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32))) (.cse8 (= |ULTIMATE.start_dll_circular_update_at_~index#1| (_ bv0 32))) (.cse9 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~len~0#1| (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32))) .cse3 (exists ((|ULTIMATE.start_main_~i~0#1| (_ BitVec 32))) (let ((.cse4 (bvmul |ULTIMATE.start_main_~i~0#1| (_ bv2 32)))) (and (= |ULTIMATE.start_main_~expected~0#1| (bvadd .cse4 (_ bv1 32))) (= (bvmul |ULTIMATE.start_main_~expected~0#1| (_ bv2 32)) (bvadd |ULTIMATE.start_dll_circular_get_data_at_#res#1| .cse4 (_ bv1 32)))))) .cse5 .cse6 .cse7 .cse8 .cse9) (and (exists ((|ULTIMATE.start_dll_circular_get_data_at_~index#1| (_ BitVec 32))) (let ((.cse10 (bvmul |ULTIMATE.start_main_~expected~0#1| (_ bv4294967295 32)))) (and (not (bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_dll_circular_get_data_at_#res#1| .cse10 |ULTIMATE.start_dll_circular_get_data_at_~index#1|) (_ bv4294967295 32))) (= |ULTIMATE.start_main_~expected~0#1| (bvadd (_ bv2 32) |ULTIMATE.start_dll_circular_get_data_at_~index#1|)) (not (bvsgt |ULTIMATE.start_dll_circular_get_data_at_~index#1| (_ bv0 32))) (bvsgt (bvadd |ULTIMATE.start_dll_circular_get_data_at_#res#1| .cse10 |ULTIMATE.start_dll_circular_get_data_at_~index#1|) (_ bv4294967295 32)) (bvsgt |ULTIMATE.start_dll_circular_get_data_at_~index#1| (_ bv4294967295 32))))) .cse3 .cse5 .cse6 (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) .cse7 .cse8) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) .cse1 .cse2 .cse7 .cse8)) .cse9)))) [2022-07-21 02:14:37,208 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 611) no Hoare annotation was computed. [2022-07-21 02:14:37,208 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-21 02:14:37,208 INFO L899 garLoopResultBuilder]: For program point L602(lines 602 610) no Hoare annotation was computed. [2022-07-21 02:14:37,208 INFO L899 garLoopResultBuilder]: For program point L635-2(lines 635 640) no Hoare annotation was computed. [2022-07-21 02:14:37,209 INFO L895 garLoopResultBuilder]: At program point L635-3(lines 635 640) the Hoare annotation is: (let ((.cse9 (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|)) (.cse10 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32))))) (let ((.cse0 (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse1 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| (_ bv0 32))) (.cse2 (bvsgt (bvadd .cse9 .cse10) (_ bv4294967295 32))) (.cse3 (not (bvsgt |ULTIMATE.start_dll_circular_create_~len#1| (_ bv1 32)))) (.cse4 (not (bvsgt (bvadd (_ bv4294967295 32) .cse9 .cse10) (_ bv4294967295 32)))) (.cse6 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32))) (.cse7 (= |ULTIMATE.start_dll_circular_update_at_~index#1| (_ bv0 32))) (.cse8 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))) (or (let ((.cse5 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (and .cse0 .cse1 (= |ULTIMATE.start_main_~len~0#1| (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32))) .cse2 .cse3 .cse4 (= (bvadd (select (select |#memory_int| (select .cse5 |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (_ bv1 32)) (bvmul (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) .cse6 (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) .cse7 (not (= (select .cse5 (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)) .cse8)) (and .cse0 .cse1 (= |ULTIMATE.start_dll_circular_get_data_at_~index#1| (_ bv0 32)) (not (bvsgt |ULTIMATE.start_main_~i~0#1| (_ bv0 32))) .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 (not (bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (_ bv0 32))))))) [2022-07-21 02:14:37,209 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 643) no Hoare annotation was computed. [2022-07-21 02:14:37,209 INFO L899 garLoopResultBuilder]: For program point L635-4(lines 635 640) no Hoare annotation was computed. [2022-07-21 02:14:37,209 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 625) no Hoare annotation was computed. [2022-07-21 02:14:37,209 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (and (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))) [2022-07-21 02:14:37,209 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2022-07-21 02:14:37,209 INFO L902 garLoopResultBuilder]: At program point L644(lines 626 645) the Hoare annotation is: true [2022-07-21 02:14:37,209 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-21 02:14:37,209 INFO L895 garLoopResultBuilder]: At program point L620-2(lines 620 623) the Hoare annotation is: (let ((.cse12 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (.cse5 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse9 (not (= (select .cse12 (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|))) (.cse10 (= |ULTIMATE.start_dll_circular_update_at_~data#1| (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~len~0#1|))) (.cse13 (bvmul (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse1 (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse2 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| (_ bv0 32))) (.cse3 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (_ bv0 32))) |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))) (.cse4 (= |ULTIMATE.start_main_~len~0#1| (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)))) (.cse6 (not (bvsgt |ULTIMATE.start_dll_circular_create_~len#1| (_ bv1 32)))) (.cse7 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32))) (.cse8 (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32))) (.cse14 (= |ULTIMATE.start_dll_circular_update_at_~index#1| (_ bv0 32))) (.cse11 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (_ bv1 32) |ULTIMATE.start_dll_circular_update_at_~index#1|) .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) .cse5 .cse6 (= (bvadd (select (select |#memory_int| (select .cse12 |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (_ bv1 32)) .cse13) .cse7 .cse8 .cse14 .cse9 .cse10 (= |ULTIMATE.start_main_~len~0#1| (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)))) (and (= (bvadd |ULTIMATE.start_dll_circular_update_at_~data#1| (_ bv1 32)) .cse13) .cse1 .cse2 .cse3 .cse4 .cse6 (forall ((v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_416) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))) .cse7 .cse8 .cse14 (forall ((v_ArrVal_415 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_415) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) .cse11 (forall ((v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_416) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_dll_circular_update_at_~head#1.base|)))))) [2022-07-21 02:14:37,209 INFO L899 garLoopResultBuilder]: For program point L620-3(lines 620 623) no Hoare annotation was computed. [2022-07-21 02:14:37,209 INFO L899 garLoopResultBuilder]: For program point L637(lines 637 639) no Hoare annotation was computed. [2022-07-21 02:14:37,209 INFO L902 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2022-07-21 02:14:37,209 INFO L899 garLoopResultBuilder]: For program point L604-3(lines 604 608) no Hoare annotation was computed. [2022-07-21 02:14:37,209 INFO L895 garLoopResultBuilder]: At program point L588-2(lines 588 596) the Hoare annotation is: (let ((.cse1 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))) (or (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (_ bv0 32)))) (and (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (bvsgt |ULTIMATE.start_dll_circular_create_~len#1| (_ bv1 32))) (not (= .cse0 |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32)) .cse1 (= .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse2 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= .cse2 |ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (and (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (_ bv0 1)) .cse1 (= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))))) [2022-07-21 02:14:37,209 INFO L899 garLoopResultBuilder]: For program point L588-3(lines 588 596) no Hoare annotation was computed. [2022-07-21 02:14:37,210 INFO L895 garLoopResultBuilder]: At program point L613-2(lines 613 616) the Hoare annotation is: (let ((.cse16 (bvmul (_ bv4294967295 32) |ULTIMATE.start_main_~len~0#1|)) (.cse17 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv8 32)))) (.cse18 (bvmul |ULTIMATE.start_main_~expected~0#1| (_ bv4294967295 32))) (.cse19 (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (bvadd |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv8 32))))) (let ((.cse1 (= |ULTIMATE.start_main_~expected~0#1| (bvadd (_ bv2 32) |ULTIMATE.start_dll_circular_get_data_at_~index#1|))) (.cse2 (bvsgt (bvadd .cse18 |ULTIMATE.start_dll_circular_get_data_at_~index#1| .cse19) (_ bv4294967295 32))) (.cse4 (not (bvsgt (bvadd (_ bv4294967295 32) .cse18 |ULTIMATE.start_dll_circular_get_data_at_~index#1| .cse19) (_ bv4294967295 32)))) (.cse0 (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse14 (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32))) (.cse3 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| (_ bv0 32))) (.cse13 (= |ULTIMATE.start_dll_circular_get_data_at_~index#1| (_ bv0 32))) (.cse5 (bvsgt (bvadd .cse16 .cse17) (_ bv4294967295 32))) (.cse6 (not (bvsgt |ULTIMATE.start_dll_circular_create_~len#1| (_ bv1 32)))) (.cse7 (not (bvsgt (bvadd (_ bv4294967295 32) .cse16 .cse17) (_ bv4294967295 32)))) (.cse9 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32))) (.cse10 (= |ULTIMATE.start_dll_circular_update_at_~index#1| (_ bv0 32))) (.cse11 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))) (or (let ((.cse8 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (and (= |ULTIMATE.start_dll_circular_get_data_at_~index#1| (_ bv1 32)) .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~len~0#1| (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32))) .cse5 (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv0 32)) .cse6 .cse7 (= (bvadd (select (select |#memory_int| (select .cse8 |ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (_ bv1 32)) (bvmul (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) .cse9 (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) .cse10 (not (= (select .cse8 (_ bv0 32)) |ULTIMATE.start_main_~s~0#1.base|)) .cse11 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (_ bv0 32)) |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|)) (exists ((|ULTIMATE.start_main_~i~0#1| (_ BitVec 32))) (let ((.cse12 (bvmul |ULTIMATE.start_main_~i~0#1| (_ bv2 32)))) (and (= (bvmul |ULTIMATE.start_main_~expected~0#1| (_ bv2 32)) (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (_ bv0 32))) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (_ bv0 32)))) .cse12 (_ bv1 32))) (= |ULTIMATE.start_main_~expected~0#1| (bvadd .cse12 (_ bv1 32)))))))) (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (or (and .cse0 .cse3 .cse13 (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) .cse9 .cse10) (and .cse0 .cse14 .cse3 .cse13 .cse9 .cse10)) .cse11) (and .cse0 .cse14 .cse3 .cse13 .cse5 .cse6 .cse7 (exists ((|ULTIMATE.start_main_~i~0#1| (_ BitVec 32))) (let ((.cse15 (bvmul |ULTIMATE.start_main_~i~0#1| (_ bv2 32)))) (and (= (bvmul |ULTIMATE.start_main_~expected~0#1| (_ bv2 32)) (bvadd .cse15 (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (bvadd |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| (_ bv8 32))) (_ bv1 32))) (= |ULTIMATE.start_main_~expected~0#1| (bvadd .cse15 (_ bv1 32)))))) .cse9 .cse10 .cse11)))) [2022-07-21 02:14:37,210 INFO L899 garLoopResultBuilder]: For program point L613-3(lines 613 616) no Hoare annotation was computed. [2022-07-21 02:14:37,210 INFO L899 garLoopResultBuilder]: For program point L577(lines 577 579) no Hoare annotation was computed. [2022-07-21 02:14:37,210 INFO L899 garLoopResultBuilder]: For program point L577-1(lines 577 579) no Hoare annotation was computed. [2022-07-21 02:14:37,210 INFO L902 garLoopResultBuilder]: At program point L573(line 573) the Hoare annotation is: true [2022-07-21 02:14:37,210 INFO L895 garLoopResultBuilder]: At program point node_createENTRY(lines 575 584) the Hoare annotation is: (= |old(#valid)| |#valid|) [2022-07-21 02:14:37,210 INFO L899 garLoopResultBuilder]: For program point node_createFINAL(lines 575 584) no Hoare annotation was computed. [2022-07-21 02:14:37,210 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 575 584) no Hoare annotation was computed. [2022-07-21 02:14:37,212 INFO L356 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1, 1] [2022-07-21 02:14:37,213 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 02:14:37,237 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,238 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,238 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-21 02:14:37,238 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,239 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,239 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,239 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,239 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,243 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,243 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,243 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-21 02:14:37,244 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,244 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,244 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,244 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,248 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,269 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,269 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,269 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-21 02:14:37,270 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,272 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,272 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:14:37,272 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,272 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,273 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,273 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-21 02:14:37,273 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,273 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_416,QUANTIFIED] [2022-07-21 02:14:37,273 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:14:37,273 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_415,QUANTIFIED] [2022-07-21 02:14:37,274 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,274 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_416,QUANTIFIED] [2022-07-21 02:14:37,277 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,292 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,293 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-21 02:14:37,293 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,293 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,294 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:14:37,294 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,294 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,294 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,294 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-21 02:14:37,294 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,295 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_416,QUANTIFIED] [2022-07-21 02:14:37,296 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:14:37,297 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_415,QUANTIFIED] [2022-07-21 02:14:37,297 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,297 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_416,QUANTIFIED] [2022-07-21 02:14:37,298 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,301 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:14:37,302 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,302 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,303 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:14:37,303 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,304 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,307 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:14:37,307 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,308 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,308 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,308 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-21 02:14:37,308 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,308 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_416,QUANTIFIED] [2022-07-21 02:14:37,308 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,309 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,309 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:14:37,309 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,310 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,310 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:14:37,310 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,310 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,310 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,310 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-21 02:14:37,311 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,311 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_416,QUANTIFIED] [2022-07-21 02:14:37,311 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,315 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,315 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:14:37,315 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,316 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-07-21 02:14:37,316 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-07-21 02:14:37,317 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_get_data_at_~index#1,QUANTIFIED] [2022-07-21 02:14:37,327 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_get_data_at_~index#1,QUANTIFIED] [2022-07-21 02:14:37,327 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_get_data_at_~index#1,QUANTIFIED] [2022-07-21 02:14:37,327 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_get_data_at_~index#1,QUANTIFIED] [2022-07-21 02:14:37,327 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_get_data_at_~index#1,QUANTIFIED] [2022-07-21 02:14:37,328 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-07-21 02:14:37,328 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-07-21 02:14:37,328 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_get_data_at_~index#1,QUANTIFIED] [2022-07-21 02:14:37,328 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_get_data_at_~index#1,QUANTIFIED] [2022-07-21 02:14:37,329 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_get_data_at_~index#1,QUANTIFIED] [2022-07-21 02:14:37,329 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_get_data_at_~index#1,QUANTIFIED] [2022-07-21 02:14:37,329 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_get_data_at_~index#1,QUANTIFIED] [2022-07-21 02:14:37,330 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,333 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,333 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,334 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,334 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,334 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,334 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,334 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,335 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,335 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:14:37,335 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,336 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,336 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,336 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:14:37,336 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-07-21 02:14:37,336 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-07-21 02:14:37,336 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-07-21 02:14:37,337 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-07-21 02:14:37,337 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,339 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:14:37,339 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,339 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,339 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,340 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:14:37,340 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-07-21 02:14:37,340 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-07-21 02:14:37,341 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-07-21 02:14:37,341 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-07-21 02:14:37,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 02:14:37 BoogieIcfgContainer [2022-07-21 02:14:37,343 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 02:14:37,343 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 02:14:37,344 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 02:14:37,344 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 02:14:37,344 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:14:07" (3/4) ... [2022-07-21 02:14:37,346 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-21 02:14:37,363 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2022-07-21 02:14:37,368 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2022-07-21 02:14:37,368 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-07-21 02:14:37,368 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-21 02:14:37,368 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-21 02:14:37,385 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0bv32 == new_head && (\exists ULTIMATE.start_dll_circular_create_~last~0#1.offset : bv32 :: #memory_$Pointer$[#memory_$Pointer$[\result][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == \result)) && \result == 0bv32) && !~bvsgt32(len, 1bv32)) && !(#memory_$Pointer$[new_head][new_head] == new_head)) && head == 0bv32) && 2bv32 == len) && !(#memory_$Pointer$[\result][0bv32] == \result)) && #memory_$Pointer$[new_head][new_head] == last) && #memory_$Pointer$[head][0bv32] == last) && !(#memory_$Pointer$[head][0bv32] == head) [2022-07-21 02:14:37,385 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((0bv32 == new_head && \result == 0bv32) && !~bvsgt32(i, 0bv32)) && !~bvsgt32(len, 1bv32)) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])], 1bv32) == ~bvmul32(2bv32, len)) && head == 0bv32) && s == 0bv32) && index == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && 2bv32 == len) && ~bvadd64(i, len, 1bv32) == unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]) && ~bvsgt32(~bvadd64(i, 1bv32), 4294967295bv32)) || ((((((((0bv32 == new_head && \result == 0bv32) && (\exists ULTIMATE.start_dll_circular_create_~last~0#1.offset : bv32 :: #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == s)) && len == ~bvadd64(i, 1bv32)) && !~bvsgt32(len, 1bv32)) && head == 0bv32) && s == 0bv32) && 2bv32 == len) && (forall v_ArrVal_416 : [bv32]bv32 :: !(s == #memory_$Pointer$[#memory_$Pointer$[s][s] := v_ArrVal_416][s][s])))) || (((((((((0bv32 == new_head && \result == 0bv32) && !~bvsgt32(len, 1bv32)) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])], 1bv32) == ~bvmul32(2bv32, len)) && head == 0bv32) && s == 0bv32) && index == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && 2bv32 == len) && len == ~bvadd64(i, 2bv32)) [2022-07-21 02:14:37,385 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((0bv32 == new_head && \result == 0bv32) && len == ~bvadd64(i, 1bv32)) && ~bvsgt32(~bvadd64(~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && !~bvsgt32(len, 1bv32)) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])], 1bv32) == ~bvmul32(2bv32, len)) && head == 0bv32) && s == 0bv32) && index == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && 2bv32 == len) || ((((((((((0bv32 == new_head && \result == 0bv32) && index == 0bv32) && !~bvsgt32(i, 0bv32)) && ~bvsgt32(~bvadd64(~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && !~bvsgt32(len, 1bv32)) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && head == 0bv32) && index == 0bv32) && 2bv32 == len) && !~bvsgt32(~bvadd64(4294967295bv32, i), 0bv32)) [2022-07-21 02:14:37,386 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((s == head && 0bv32 == new_head) && \result == 0bv32) && (\exists ULTIMATE.start_dll_circular_create_~last~0#1.offset : bv32 :: #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == s)) && len == ~bvadd64(i, 1bv32)) && head == s) && !~bvsgt32(len, 1bv32)) && head == 0bv32) && s == 0bv32) && 1bv32 == index) && !(#memory_$Pointer$[s][0bv32] == s)) && data == ~bvadd64(i, len)) && 2bv32 == len) || ((((((((((((s == head && 0bv32 == new_head) && \result == 0bv32) && i == 0bv32) && head == s) && !~bvsgt32(len, 1bv32)) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])], 1bv32) == ~bvmul32(2bv32, len)) && head == 0bv32) && s == 0bv32) && index == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && data == ~bvadd64(i, len)) && len == ~bvadd64(i, 2bv32))) || ((((((((((((~bvadd64(data, 1bv32) == ~bvmul32(2bv32, len) && 0bv32 == new_head) && \result == 0bv32) && (\exists ULTIMATE.start_dll_circular_create_~last~0#1.offset : bv32 :: #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == s)) && len == ~bvadd64(i, 1bv32)) && !~bvsgt32(len, 1bv32)) && (forall v_ArrVal_416 : [bv32]bv32 :: !(#memory_$Pointer$[head := v_ArrVal_416][s][s] == s))) && head == 0bv32) && s == 0bv32) && index == 0bv32) && (forall v_ArrVal_415 : [bv32]bv32 :: #memory_$Pointer$[head := v_ArrVal_415][s][s] == head)) && 2bv32 == len) && (forall v_ArrVal_416 : [bv32]bv32 :: #memory_$Pointer$[head := v_ArrVal_416][s][s] == head)) [2022-07-21 02:14:37,386 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((index == 1bv32 && 0bv32 == new_head) && expected == ~bvadd64(2bv32, index)) && ~bvsgt32(~bvadd64(~bvmul32(expected, 4294967295bv32), index, unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]), 4294967295bv32)) && \result == 0bv32) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(expected, 4294967295bv32), index, unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]), 4294967295bv32)) && len == ~bvadd64(i, 1bv32)) && ~bvsgt32(~bvadd64(~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && head == 0bv32) && !~bvsgt32(len, 1bv32)) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])], 1bv32) == ~bvmul32(2bv32, len)) && head == 0bv32) && s == 0bv32) && index == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && 2bv32 == len) && !(#memory_$Pointer$[head][0bv32] == head)) && (\exists ULTIMATE.start_main_~i~0#1 : bv32 :: ~bvmul32(expected, 2bv32) == ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[head][0bv32]][~bvadd64(8bv32, #memory_$Pointer$[head][0bv32])], ~bvmul32(ULTIMATE.start_main_~i~0#1, 2bv32), 1bv32) && expected == ~bvadd64(~bvmul32(ULTIMATE.start_main_~i~0#1, 2bv32), 1bv32))) || (((((((expected == ~bvadd64(2bv32, index) && ~bvsgt32(~bvadd64(~bvmul32(expected, 4294967295bv32), index, unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]), 4294967295bv32)) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(expected, 4294967295bv32), index, unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]), 4294967295bv32)) && ~bvsgt32(~bvadd64(~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && !~bvsgt32(len, 1bv32)) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && ((((((0bv32 == new_head && \result == 0bv32) && index == 0bv32) && i == 0bv32) && head == 0bv32) && index == 0bv32) || (((((0bv32 == new_head && i == 1bv32) && \result == 0bv32) && index == 0bv32) && head == 0bv32) && index == 0bv32))) && 2bv32 == len)) || ((((((((((0bv32 == new_head && i == 1bv32) && \result == 0bv32) && index == 0bv32) && ~bvsgt32(~bvadd64(~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && !~bvsgt32(len, 1bv32)) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && (\exists ULTIMATE.start_main_~i~0#1 : bv32 :: ~bvmul32(expected, 2bv32) == ~bvadd64(~bvmul32(ULTIMATE.start_main_~i~0#1, 2bv32), unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)], 1bv32) && expected == ~bvadd64(~bvmul32(ULTIMATE.start_main_~i~0#1, 2bv32), 1bv32))) && head == 0bv32) && index == 0bv32) && 2bv32 == len) [2022-07-21 02:14:37,387 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((0bv32 == new_head && \result == 0bv32) && index == 0bv32) && len == ~bvadd64(i, 1bv32)) && ~bvsgt32(~bvadd64(~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && (\exists ULTIMATE.start_main_~i~0#1 : bv32 :: expected == ~bvadd64(~bvmul32(ULTIMATE.start_main_~i~0#1, 2bv32), 1bv32) && ~bvmul32(expected, 2bv32) == ~bvadd64(\result, ~bvmul32(ULTIMATE.start_main_~i~0#1, 2bv32), 1bv32))) && !~bvsgt32(len, 1bv32)) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && head == 0bv32) && index == 0bv32) && 2bv32 == len) || ((((((\exists ULTIMATE.start_dll_circular_get_data_at_~index#1 : bv32 :: (((!~bvsgt32(~bvadd64(4294967295bv32, \result, ~bvmul32(expected, 4294967295bv32), ULTIMATE.start_dll_circular_get_data_at_~index#1), 4294967295bv32) && expected == ~bvadd64(2bv32, ULTIMATE.start_dll_circular_get_data_at_~index#1)) && !~bvsgt32(ULTIMATE.start_dll_circular_get_data_at_~index#1, 0bv32)) && ~bvsgt32(~bvadd64(\result, ~bvmul32(expected, 4294967295bv32), ULTIMATE.start_dll_circular_get_data_at_~index#1), 4294967295bv32)) && ~bvsgt32(ULTIMATE.start_dll_circular_get_data_at_~index#1, 4294967295bv32)) && ~bvsgt32(~bvadd64(~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && !~bvsgt32(len, 1bv32)) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && ((((((0bv32 == new_head && \result == 0bv32) && index == 0bv32) && i == 0bv32) && head == 0bv32) && index == 0bv32) || (((((0bv32 == new_head && i == 1bv32) && \result == 0bv32) && index == 0bv32) && head == 0bv32) && index == 0bv32))) && 2bv32 == len) [2022-07-21 02:14:37,400 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 02:14:37,401 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 02:14:37,401 INFO L158 Benchmark]: Toolchain (without parser) took 30498.40ms. Allocated memory was 65.0MB in the beginning and 132.1MB in the end (delta: 67.1MB). Free memory was 44.3MB in the beginning and 96.6MB in the end (delta: -52.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-21 02:14:37,402 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 65.0MB. Free memory was 47.1MB in the beginning and 47.0MB in the end (delta: 50.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 02:14:37,402 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.26ms. Allocated memory is still 65.0MB. Free memory was 44.2MB in the beginning and 42.6MB in the end (delta: 1.5MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2022-07-21 02:14:37,402 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.84ms. Allocated memory is still 65.0MB. Free memory was 42.6MB in the beginning and 40.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 02:14:37,402 INFO L158 Benchmark]: Boogie Preprocessor took 46.37ms. Allocated memory is still 65.0MB. Free memory was 40.3MB in the beginning and 38.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 02:14:37,402 INFO L158 Benchmark]: RCFGBuilder took 490.12ms. Allocated memory was 65.0MB in the beginning and 90.2MB in the end (delta: 25.2MB). Free memory was 38.2MB in the beginning and 69.8MB in the end (delta: -31.5MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2022-07-21 02:14:37,405 INFO L158 Benchmark]: TraceAbstraction took 29579.54ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 69.0MB in the beginning and 99.7MB in the end (delta: -30.7MB). Peak memory consumption was 75.7MB. Max. memory is 16.1GB. [2022-07-21 02:14:37,405 INFO L158 Benchmark]: Witness Printer took 57.13ms. Allocated memory is still 132.1MB. Free memory was 99.7MB in the beginning and 96.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 02:14:37,409 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.20ms. Allocated memory is still 65.0MB. Free memory was 47.1MB in the beginning and 47.0MB in the end (delta: 50.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.26ms. Allocated memory is still 65.0MB. Free memory was 44.2MB in the beginning and 42.6MB in the end (delta: 1.5MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.84ms. Allocated memory is still 65.0MB. Free memory was 42.6MB in the beginning and 40.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.37ms. Allocated memory is still 65.0MB. Free memory was 40.3MB in the beginning and 38.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 490.12ms. Allocated memory was 65.0MB in the beginning and 90.2MB in the end (delta: 25.2MB). Free memory was 38.2MB in the beginning and 69.8MB in the end (delta: -31.5MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * TraceAbstraction took 29579.54ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 69.0MB in the beginning and 99.7MB in the end (delta: -30.7MB). Peak memory consumption was 75.7MB. Max. memory is 16.1GB. * Witness Printer took 57.13ms. Allocated memory is still 132.1MB. Free memory was 99.7MB in the beginning and 96.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,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$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,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$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,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$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_416,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_415,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_416,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,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$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_416,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_415,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_416,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_416,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$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_416,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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_get_data_at_~index#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_get_data_at_~index#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_get_data_at_~index#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_get_data_at_~index#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_get_data_at_~index#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_get_data_at_~index#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_get_data_at_~index#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_get_data_at_~index#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_get_data_at_~index#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_get_data_at_~index#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] * 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: 643]: 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, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.4s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1242 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1239 mSDsluCounter, 2525 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 452 IncrementalHoareTripleChecker+Unchecked, 2065 mSDsCounter, 248 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1211 IncrementalHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 248 mSolverCounterUnsat, 460 mSDtfsCounter, 1211 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1023 GetRequests, 806 SyntacticMatches, 8 SemanticMatches, 209 ConstructedPredicates, 9 IntricatePredicates, 2 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=11, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 179 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 18 PreInvPairs, 46 NumberOfFragments, 1242 HoareAnnotationTreeSize, 18 FomulaSimplifications, 30149 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 14 FomulaSimplificationsInter, 11299 FormulaSimplificationTreeSizeReductionInter, 10.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 555 NumberOfCodeBlocks, 531 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 941 ConstructedInterpolants, 42 QuantifiedInterpolants, 5580 SizeOfPredicates, 123 NumberOfNonLiveVariables, 2905 ConjunctsInSsa, 184 ConjunctsInUnsatCore, 23 InterpolantComputations, 6 PerfectInterpolantSequences, 330/414 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: 626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 585]: Loop Invariant [2022-07-21 02:14:37,428 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,428 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,428 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-21 02:14:37,429 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,429 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,429 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,429 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,429 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,430 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,430 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,430 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-21 02:14:37,430 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,430 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,430 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,430 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,430 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((0bv32 == new_head && (\exists ULTIMATE.start_dll_circular_create_~last~0#1.offset : bv32 :: #memory_$Pointer$[#memory_$Pointer$[\result][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == \result)) && \result == 0bv32) && !~bvsgt32(len, 1bv32)) && !(#memory_$Pointer$[new_head][new_head] == new_head)) && head == 0bv32) && 2bv32 == len) && !(#memory_$Pointer$[\result][0bv32] == \result)) && #memory_$Pointer$[new_head][new_head] == last) && #memory_$Pointer$[head][0bv32] == last) && !(#memory_$Pointer$[head][0bv32] == head) - InvariantResult [Line: 620]: Loop Invariant [2022-07-21 02:14:37,431 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,431 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,431 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-21 02:14:37,431 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,431 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,432 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:14:37,432 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,432 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,432 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,432 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-21 02:14:37,432 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,432 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_416,QUANTIFIED] [2022-07-21 02:14:37,433 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:14:37,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_415,QUANTIFIED] [2022-07-21 02:14:37,433 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_416,QUANTIFIED] [2022-07-21 02:14:37,434 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,434 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,434 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-21 02:14:37,434 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,434 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,434 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:14:37,435 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,435 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,435 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,435 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-21 02:14:37,435 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,435 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_416,QUANTIFIED] [2022-07-21 02:14:37,435 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:14:37,436 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_415,QUANTIFIED] [2022-07-21 02:14:37,436 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,436 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_416,QUANTIFIED] Derived loop invariant: (((((((((((((s == head && 0bv32 == new_head) && \result == 0bv32) && (\exists ULTIMATE.start_dll_circular_create_~last~0#1.offset : bv32 :: #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == s)) && len == ~bvadd64(i, 1bv32)) && head == s) && !~bvsgt32(len, 1bv32)) && head == 0bv32) && s == 0bv32) && 1bv32 == index) && !(#memory_$Pointer$[s][0bv32] == s)) && data == ~bvadd64(i, len)) && 2bv32 == len) || ((((((((((((s == head && 0bv32 == new_head) && \result == 0bv32) && i == 0bv32) && head == s) && !~bvsgt32(len, 1bv32)) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])], 1bv32) == ~bvmul32(2bv32, len)) && head == 0bv32) && s == 0bv32) && index == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && data == ~bvadd64(i, len)) && len == ~bvadd64(i, 2bv32))) || ((((((((((((~bvadd64(data, 1bv32) == ~bvmul32(2bv32, len) && 0bv32 == new_head) && \result == 0bv32) && (\exists ULTIMATE.start_dll_circular_create_~last~0#1.offset : bv32 :: #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == s)) && len == ~bvadd64(i, 1bv32)) && !~bvsgt32(len, 1bv32)) && (forall v_ArrVal_416 : [bv32]bv32 :: !(#memory_$Pointer$[head := v_ArrVal_416][s][s] == s))) && head == 0bv32) && s == 0bv32) && index == 0bv32) && (forall v_ArrVal_415 : [bv32]bv32 :: #memory_$Pointer$[head := v_ArrVal_415][s][s] == head)) && 2bv32 == len) && (forall v_ArrVal_416 : [bv32]bv32 :: #memory_$Pointer$[head := v_ArrVal_416][s][s] == head)) - InvariantResult [Line: 635]: Loop Invariant [2022-07-21 02:14:37,437 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,437 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:14:37,437 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,437 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,437 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:14:37,438 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((0bv32 == new_head && \result == 0bv32) && len == ~bvadd64(i, 1bv32)) && ~bvsgt32(~bvadd64(~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && !~bvsgt32(len, 1bv32)) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])], 1bv32) == ~bvmul32(2bv32, len)) && head == 0bv32) && s == 0bv32) && index == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && 2bv32 == len) || ((((((((((0bv32 == new_head && \result == 0bv32) && index == 0bv32) && !~bvsgt32(i, 0bv32)) && ~bvsgt32(~bvadd64(~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && !~bvsgt32(len, 1bv32)) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && head == 0bv32) && index == 0bv32) && 2bv32 == len) && !~bvsgt32(~bvadd64(4294967295bv32, i), 0bv32)) - InvariantResult [Line: 626]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 631]: Loop Invariant [2022-07-21 02:14:37,438 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,438 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:14:37,438 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,439 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,439 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,439 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-21 02:14:37,439 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,439 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_416,QUANTIFIED] [2022-07-21 02:14:37,439 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,439 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,440 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:14:37,440 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,440 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,440 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:14:37,440 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,441 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,441 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,441 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_create_~last~0#1.offset,QUANTIFIED] [2022-07-21 02:14:37,441 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,441 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_416,QUANTIFIED] [2022-07-21 02:14:37,441 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,441 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,441 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:14:37,442 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((0bv32 == new_head && \result == 0bv32) && !~bvsgt32(i, 0bv32)) && !~bvsgt32(len, 1bv32)) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])], 1bv32) == ~bvmul32(2bv32, len)) && head == 0bv32) && s == 0bv32) && index == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && 2bv32 == len) && ~bvadd64(i, len, 1bv32) == unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]) && ~bvsgt32(~bvadd64(i, 1bv32), 4294967295bv32)) || ((((((((0bv32 == new_head && \result == 0bv32) && (\exists ULTIMATE.start_dll_circular_create_~last~0#1.offset : bv32 :: #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][ULTIMATE.start_dll_circular_create_~last~0#1.offset] == s)) && len == ~bvadd64(i, 1bv32)) && !~bvsgt32(len, 1bv32)) && head == 0bv32) && s == 0bv32) && 2bv32 == len) && (forall v_ArrVal_416 : [bv32]bv32 :: !(s == #memory_$Pointer$[#memory_$Pointer$[s][s] := v_ArrVal_416][s][s])))) || (((((((((0bv32 == new_head && \result == 0bv32) && !~bvsgt32(len, 1bv32)) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])], 1bv32) == ~bvmul32(2bv32, len)) && head == 0bv32) && s == 0bv32) && index == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && 2bv32 == len) && len == ~bvadd64(i, 2bv32)) - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 612]: Loop Invariant [2022-07-21 02:14:37,442 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-07-21 02:14:37,442 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-07-21 02:14:37,443 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_get_data_at_~index#1,QUANTIFIED] [2022-07-21 02:14:37,443 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_get_data_at_~index#1,QUANTIFIED] [2022-07-21 02:14:37,443 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_get_data_at_~index#1,QUANTIFIED] [2022-07-21 02:14:37,443 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_get_data_at_~index#1,QUANTIFIED] [2022-07-21 02:14:37,443 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_get_data_at_~index#1,QUANTIFIED] [2022-07-21 02:14:37,444 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-07-21 02:14:37,444 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-07-21 02:14:37,444 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_get_data_at_~index#1,QUANTIFIED] [2022-07-21 02:14:37,444 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_get_data_at_~index#1,QUANTIFIED] [2022-07-21 02:14:37,444 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_get_data_at_~index#1,QUANTIFIED] [2022-07-21 02:14:37,444 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_get_data_at_~index#1,QUANTIFIED] [2022-07-21 02:14:37,444 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_circular_get_data_at_~index#1,QUANTIFIED] Derived loop invariant: ((((((((((0bv32 == new_head && \result == 0bv32) && index == 0bv32) && len == ~bvadd64(i, 1bv32)) && ~bvsgt32(~bvadd64(~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && (\exists ULTIMATE.start_main_~i~0#1 : bv32 :: expected == ~bvadd64(~bvmul32(ULTIMATE.start_main_~i~0#1, 2bv32), 1bv32) && ~bvmul32(expected, 2bv32) == ~bvadd64(\result, ~bvmul32(ULTIMATE.start_main_~i~0#1, 2bv32), 1bv32))) && !~bvsgt32(len, 1bv32)) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && head == 0bv32) && index == 0bv32) && 2bv32 == len) || ((((((\exists ULTIMATE.start_dll_circular_get_data_at_~index#1 : bv32 :: (((!~bvsgt32(~bvadd64(4294967295bv32, \result, ~bvmul32(expected, 4294967295bv32), ULTIMATE.start_dll_circular_get_data_at_~index#1), 4294967295bv32) && expected == ~bvadd64(2bv32, ULTIMATE.start_dll_circular_get_data_at_~index#1)) && !~bvsgt32(ULTIMATE.start_dll_circular_get_data_at_~index#1, 0bv32)) && ~bvsgt32(~bvadd64(\result, ~bvmul32(expected, 4294967295bv32), ULTIMATE.start_dll_circular_get_data_at_~index#1), 4294967295bv32)) && ~bvsgt32(ULTIMATE.start_dll_circular_get_data_at_~index#1, 4294967295bv32)) && ~bvsgt32(~bvadd64(~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && !~bvsgt32(len, 1bv32)) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && ((((((0bv32 == new_head && \result == 0bv32) && index == 0bv32) && i == 0bv32) && head == 0bv32) && index == 0bv32) || (((((0bv32 == new_head && i == 1bv32) && \result == 0bv32) && index == 0bv32) && head == 0bv32) && index == 0bv32))) && 2bv32 == len) - InvariantResult [Line: 588]: Loop Invariant [2022-07-21 02:14:37,445 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,445 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,445 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,445 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,446 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,446 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,446 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,446 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((0bv32 == new_head && !~bvsgt32(len, 1bv32)) && !(#memory_$Pointer$[new_head][new_head] == new_head)) && head == 0bv32) && 2bv32 == len) && #memory_$Pointer$[new_head][new_head] == last) && #memory_$Pointer$[head][0bv32] == last) && !(#memory_$Pointer$[head][0bv32] == head)) || (((last == head && ~bvadd64(1bv1, ~bvneg64(\valid[head])) == 0bv1) && 2bv32 == len) && len == 2bv32) - InvariantResult [Line: 613]: Loop Invariant [2022-07-21 02:14:37,446 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,447 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:14:37,447 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,447 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,447 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,447 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:14:37,447 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-07-21 02:14:37,447 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-07-21 02:14:37,448 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-07-21 02:14:37,448 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-07-21 02:14:37,448 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,449 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:14:37,449 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,449 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,449 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-21 02:14:37,449 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-21 02:14:37,449 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-07-21 02:14:37,449 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-07-21 02:14:37,450 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-07-21 02:14:37,450 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] Derived loop invariant: (((((((((((((((((((index == 1bv32 && 0bv32 == new_head) && expected == ~bvadd64(2bv32, index)) && ~bvsgt32(~bvadd64(~bvmul32(expected, 4294967295bv32), index, unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]), 4294967295bv32)) && \result == 0bv32) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(expected, 4294967295bv32), index, unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]), 4294967295bv32)) && len == ~bvadd64(i, 1bv32)) && ~bvsgt32(~bvadd64(~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && head == 0bv32) && !~bvsgt32(len, 1bv32)) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(8bv32, #memory_$Pointer$[s][s])], 1bv32) == ~bvmul32(2bv32, len)) && head == 0bv32) && s == 0bv32) && index == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && 2bv32 == len) && !(#memory_$Pointer$[head][0bv32] == head)) && (\exists ULTIMATE.start_main_~i~0#1 : bv32 :: ~bvmul32(expected, 2bv32) == ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[head][0bv32]][~bvadd64(8bv32, #memory_$Pointer$[head][0bv32])], ~bvmul32(ULTIMATE.start_main_~i~0#1, 2bv32), 1bv32) && expected == ~bvadd64(~bvmul32(ULTIMATE.start_main_~i~0#1, 2bv32), 1bv32))) || (((((((expected == ~bvadd64(2bv32, index) && ~bvsgt32(~bvadd64(~bvmul32(expected, 4294967295bv32), index, unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]), 4294967295bv32)) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(expected, 4294967295bv32), index, unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)]), 4294967295bv32)) && ~bvsgt32(~bvadd64(~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && !~bvsgt32(len, 1bv32)) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && ((((((0bv32 == new_head && \result == 0bv32) && index == 0bv32) && i == 0bv32) && head == 0bv32) && index == 0bv32) || (((((0bv32 == new_head && i == 1bv32) && \result == 0bv32) && index == 0bv32) && head == 0bv32) && index == 0bv32))) && 2bv32 == len)) || ((((((((((0bv32 == new_head && i == 1bv32) && \result == 0bv32) && index == 0bv32) && ~bvsgt32(~bvadd64(~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && !~bvsgt32(len, 1bv32)) && !~bvsgt32(~bvadd64(4294967295bv32, ~bvmul32(4294967295bv32, len), unknown-#memory_int-unknown[s][~bvadd64(s, 8bv32)]), 4294967295bv32)) && (\exists ULTIMATE.start_main_~i~0#1 : bv32 :: ~bvmul32(expected, 2bv32) == ~bvadd64(~bvmul32(ULTIMATE.start_main_~i~0#1, 2bv32), unknown-#memory_int-unknown[head][~bvadd64(head, 8bv32)], 1bv32) && expected == ~bvadd64(~bvmul32(ULTIMATE.start_main_~i~0#1, 2bv32), 1bv32))) && head == 0bv32) && index == 0bv32) && 2bv32 == len) - InvariantResult [Line: 573]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-21 02:14:37,496 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