./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec 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/sll2n_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 bf89a9db9089e52f60762f5e253ea7c1b22972a3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 02:48:14,388 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 02:48:14,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 02:48:14,444 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 02:48:14,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 02:48:14,448 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 02:48:14,449 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 02:48:14,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 02:48:14,457 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 02:48:14,462 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 02:48:14,463 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 02:48:14,468 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 02:48:14,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 02:48:14,470 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 02:48:14,471 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 02:48:14,472 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 02:48:14,473 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 02:48:14,473 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 02:48:14,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 02:48:14,482 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 02:48:14,483 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 02:48:14,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 02:48:14,487 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 02:48:14,488 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 02:48:14,501 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 02:48:14,502 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 02:48:14,502 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 02:48:14,503 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 02:48:14,503 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 02:48:14,504 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 02:48:14,504 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 02:48:14,505 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 02:48:14,506 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 02:48:14,506 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 02:48:14,507 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 02:48:14,507 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 02:48:14,508 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 02:48:14,508 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 02:48:14,508 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 02:48:14,509 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 02:48:14,510 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 02:48:14,511 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 02:48:14,530 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 02:48:14,530 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 02:48:14,531 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 02:48:14,531 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 02:48:14,532 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 02:48:14,532 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 02:48:14,532 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 02:48:14,532 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 02:48:14,533 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 02:48:14,533 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 02:48:14,533 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 02:48:14,533 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 02:48:14,533 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 02:48:14,533 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 02:48:14,534 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 02:48:14,534 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 02:48:14,534 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 02:48:14,534 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 02:48:14,534 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 02:48:14,535 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 02:48:14,535 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 02:48:14,535 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 02:48:14,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 02:48:14,535 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 02:48:14,536 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 02:48:14,536 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 02:48:14,536 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 02:48:14,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 02:48:14,536 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 02:48:14,536 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 02:48:14,537 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 -> bf89a9db9089e52f60762f5e253ea7c1b22972a3 [2021-08-26 02:48:14,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 02:48:14,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 02:48:14,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 02:48:14,845 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 02:48:14,846 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 02:48:14,847 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2021-08-26 02:48:14,904 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/552a0076f/a9fd72f0ac9544e2908e1c8ef47981d7/FLAGd0c9d8c0d [2021-08-26 02:48:15,427 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 02:48:15,430 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2021-08-26 02:48:15,448 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/552a0076f/a9fd72f0ac9544e2908e1c8ef47981d7/FLAGd0c9d8c0d [2021-08-26 02:48:15,755 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/552a0076f/a9fd72f0ac9544e2908e1c8ef47981d7 [2021-08-26 02:48:15,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 02:48:15,758 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 02:48:15,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 02:48:15,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 02:48:15,767 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 02:48:15,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:48:15" (1/1) ... [2021-08-26 02:48:15,770 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cb30c3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:48:15, skipping insertion in model container [2021-08-26 02:48:15,770 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:48:15" (1/1) ... [2021-08-26 02:48:15,776 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 02:48:15,799 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 02:48:16,058 WARN L228 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/sll2n_update_all_reverse.i[24236,24249] [2021-08-26 02:48:16,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 02:48:16,074 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 02:48:16,131 WARN L228 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/sll2n_update_all_reverse.i[24236,24249] [2021-08-26 02:48:16,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 02:48:16,156 INFO L208 MainTranslator]: Completed translation [2021-08-26 02:48:16,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:48:16 WrapperNode [2021-08-26 02:48:16,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 02:48:16,159 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 02:48:16,159 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 02:48:16,159 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 02:48:16,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:48:16" (1/1) ... [2021-08-26 02:48:16,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:48:16" (1/1) ... [2021-08-26 02:48:16,218 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 02:48:16,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 02:48:16,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 02:48:16,219 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 02:48:16,226 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:48:16" (1/1) ... [2021-08-26 02:48:16,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:48:16" (1/1) ... [2021-08-26 02:48:16,240 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:48:16" (1/1) ... [2021-08-26 02:48:16,240 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:48:16" (1/1) ... [2021-08-26 02:48:16,249 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:48:16" (1/1) ... [2021-08-26 02:48:16,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:48:16" (1/1) ... [2021-08-26 02:48:16,254 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:48:16" (1/1) ... [2021-08-26 02:48:16,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 02:48:16,257 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 02:48:16,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 02:48:16,257 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 02:48:16,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:48:16" (1/1) ... [2021-08-26 02:48:16,272 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 02:48:16,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 02:48:16,294 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) [2021-08-26 02:48:16,326 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 [2021-08-26 02:48:16,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-26 02:48:16,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-26 02:48:16,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-26 02:48:16,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-26 02:48:16,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 02:48:16,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-26 02:48:16,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-26 02:48:16,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 02:48:16,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 02:48:16,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 02:48:16,793 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 02:48:16,793 INFO L299 CfgBuilder]: Removed 22 assume(true) statements. [2021-08-26 02:48:16,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:48:16 BoogieIcfgContainer [2021-08-26 02:48:16,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 02:48:16,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 02:48:16,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 02:48:16,799 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 02:48:16,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 02:48:15" (1/3) ... [2021-08-26 02:48:16,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cecdf13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:48:16, skipping insertion in model container [2021-08-26 02:48:16,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:48:16" (2/3) ... [2021-08-26 02:48:16,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cecdf13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:48:16, skipping insertion in model container [2021-08-26 02:48:16,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:48:16" (3/3) ... [2021-08-26 02:48:16,802 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2021-08-26 02:48:16,806 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 02:48:16,806 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 02:48:16,855 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 02:48:16,863 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 02:48:16,863 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 02:48:16,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 28 states have internal predecessors, (42), 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) [2021-08-26 02:48:16,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-26 02:48:16,887 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:48:16,888 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:48:16,888 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:48:16,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:48:16,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1121238131, now seen corresponding path program 1 times [2021-08-26 02:48:16,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:48:16,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958416260] [2021-08-26 02:48:16,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:48:16,906 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:48:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:48:17,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:48:17,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:48:17,053 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958416260] [2021-08-26 02:48:17,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958416260] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:48:17,054 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:48:17,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 02:48:17,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923540480] [2021-08-26 02:48:17,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-26 02:48:17,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:48:17,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-26 02:48:17,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 02:48:17,086 INFO L87 Difference]: Start difference. First operand has 29 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 28 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:48:17,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:48:17,103 INFO L93 Difference]: Finished difference Result 50 states and 73 transitions. [2021-08-26 02:48:17,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-26 02:48:17,104 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-26 02:48:17,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:48:17,111 INFO L225 Difference]: With dead ends: 50 [2021-08-26 02:48:17,111 INFO L226 Difference]: Without dead ends: 22 [2021-08-26 02:48:17,115 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 02:48:17,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-08-26 02:48:17,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-08-26 02:48:17,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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) [2021-08-26 02:48:17,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2021-08-26 02:48:17,142 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2021-08-26 02:48:17,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:48:17,143 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2021-08-26 02:48:17,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:48:17,144 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2021-08-26 02:48:17,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-26 02:48:17,145 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:48:17,146 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:48:17,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 02:48:17,146 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:48:17,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:48:17,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1860179837, now seen corresponding path program 1 times [2021-08-26 02:48:17,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:48:17,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125668654] [2021-08-26 02:48:17,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:48:17,151 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:48:17,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:48:17,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:48:17,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:48:17,244 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125668654] [2021-08-26 02:48:17,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125668654] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:48:17,244 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:48:17,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 02:48:17,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508155151] [2021-08-26 02:48:17,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 02:48:17,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:48:17,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 02:48:17,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 02:48:17,248 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:48:17,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:48:17,270 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2021-08-26 02:48:17,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 02:48:17,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-26 02:48:17,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:48:17,271 INFO L225 Difference]: With dead ends: 42 [2021-08-26 02:48:17,272 INFO L226 Difference]: Without dead ends: 27 [2021-08-26 02:48:17,272 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 02:48:17,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-08-26 02:48:17,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2021-08-26 02:48:17,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:48:17,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-08-26 02:48:17,280 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2021-08-26 02:48:17,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:48:17,280 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-08-26 02:48:17,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:48:17,281 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-08-26 02:48:17,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-26 02:48:17,283 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:48:17,283 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:48:17,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 02:48:17,283 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:48:17,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:48:17,291 INFO L82 PathProgramCache]: Analyzing trace with hash -2027989739, now seen corresponding path program 1 times [2021-08-26 02:48:17,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:48:17,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952278051] [2021-08-26 02:48:17,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:48:17,293 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:48:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:48:17,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:48:17,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:48:17,397 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952278051] [2021-08-26 02:48:17,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952278051] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:48:17,399 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775152828] [2021-08-26 02:48:17,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:48:17,399 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:48:17,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 02:48:17,410 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) [2021-08-26 02:48:17,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-26 02:48:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:48:17,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-26 02:48:17,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 02:48:17,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:48:17,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775152828] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:48:17,695 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 02:48:17,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-08-26 02:48:17,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15982827] [2021-08-26 02:48:17,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 02:48:17,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:48:17,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 02:48:17,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-26 02:48:17,697 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:48:17,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:48:17,722 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2021-08-26 02:48:17,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 02:48:17,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-08-26 02:48:17,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:48:17,724 INFO L225 Difference]: With dead ends: 43 [2021-08-26 02:48:17,724 INFO L226 Difference]: Without dead ends: 28 [2021-08-26 02:48:17,725 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.2ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-26 02:48:17,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-08-26 02:48:17,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-08-26 02:48:17,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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) [2021-08-26 02:48:17,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-08-26 02:48:17,733 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 18 [2021-08-26 02:48:17,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:48:17,733 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-08-26 02:48:17,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:48:17,734 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-08-26 02:48:17,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-26 02:48:17,734 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:48:17,734 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:48:17,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-26 02:48:17,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:48:17,955 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:48:17,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:48:17,956 INFO L82 PathProgramCache]: Analyzing trace with hash -650193283, now seen corresponding path program 2 times [2021-08-26 02:48:17,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:48:17,956 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240271948] [2021-08-26 02:48:17,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:48:17,956 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:48:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:48:18,072 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-26 02:48:18,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:48:18,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240271948] [2021-08-26 02:48:18,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240271948] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:48:18,073 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:48:18,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 02:48:18,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977466097] [2021-08-26 02:48:18,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 02:48:18,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:48:18,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 02:48:18,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 02:48:18,077 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:48:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:48:18,121 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2021-08-26 02:48:18,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 02:48:18,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-08-26 02:48:18,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:48:18,124 INFO L225 Difference]: With dead ends: 49 [2021-08-26 02:48:18,125 INFO L226 Difference]: Without dead ends: 40 [2021-08-26 02:48:18,125 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 02:48:18,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-08-26 02:48:18,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 29. [2021-08-26 02:48:18,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:48:18,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2021-08-26 02:48:18,130 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 23 [2021-08-26 02:48:18,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:48:18,131 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-08-26 02:48:18,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:48:18,131 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2021-08-26 02:48:18,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-26 02:48:18,132 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:48:18,132 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:48:18,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 02:48:18,133 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:48:18,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:48:18,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1288329753, now seen corresponding path program 1 times [2021-08-26 02:48:18,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:48:18,134 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757199136] [2021-08-26 02:48:18,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:48:18,134 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:48:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:48:18,249 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-26 02:48:18,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:48:18,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757199136] [2021-08-26 02:48:18,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757199136] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:48:18,250 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:48:18,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 02:48:18,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196521547] [2021-08-26 02:48:18,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 02:48:18,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:48:18,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 02:48:18,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 02:48:18,252 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2021-08-26 02:48:18,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:48:18,290 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2021-08-26 02:48:18,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 02:48:18,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-08-26 02:48:18,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:48:18,291 INFO L225 Difference]: With dead ends: 54 [2021-08-26 02:48:18,291 INFO L226 Difference]: Without dead ends: 41 [2021-08-26 02:48:18,292 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.5ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-08-26 02:48:18,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-08-26 02:48:18,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2021-08-26 02:48:18,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:48:18,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2021-08-26 02:48:18,300 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 27 [2021-08-26 02:48:18,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:48:18,300 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2021-08-26 02:48:18,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2021-08-26 02:48:18,300 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2021-08-26 02:48:18,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-26 02:48:18,301 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:48:18,301 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:48:18,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-26 02:48:18,301 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:48:18,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:48:18,302 INFO L82 PathProgramCache]: Analyzing trace with hash 883328756, now seen corresponding path program 1 times [2021-08-26 02:48:18,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:48:18,302 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987772984] [2021-08-26 02:48:18,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:48:18,302 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:48:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:48:18,371 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-26 02:48:18,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:48:18,371 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987772984] [2021-08-26 02:48:18,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987772984] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:48:18,372 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727588728] [2021-08-26 02:48:18,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:48:18,372 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:48:18,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 02:48:18,373 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) [2021-08-26 02:48:18,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-26 02:48:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:48:18,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-26 02:48:18,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 02:48:18,615 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-26 02:48:18,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727588728] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:48:18,615 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 02:48:18,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-08-26 02:48:18,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751715688] [2021-08-26 02:48:18,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 02:48:18,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:48:18,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 02:48:18,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-08-26 02:48:18,617 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:48:18,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:48:18,654 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2021-08-26 02:48:18,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 02:48:18,654 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-08-26 02:48:18,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:48:18,655 INFO L225 Difference]: With dead ends: 52 [2021-08-26 02:48:18,655 INFO L226 Difference]: Without dead ends: 43 [2021-08-26 02:48:18,656 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 30.6ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-08-26 02:48:18,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-08-26 02:48:18,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2021-08-26 02:48:18,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:48:18,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2021-08-26 02:48:18,660 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 28 [2021-08-26 02:48:18,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:48:18,660 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2021-08-26 02:48:18,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:48:18,660 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2021-08-26 02:48:18,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-26 02:48:18,661 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:48:18,661 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:48:18,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-26 02:48:18,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-08-26 02:48:18,876 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:48:18,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:48:18,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1177402658, now seen corresponding path program 2 times [2021-08-26 02:48:18,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:48:18,877 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492077270] [2021-08-26 02:48:18,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:48:18,877 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:48:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:48:18,933 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-08-26 02:48:18,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:48:18,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492077270] [2021-08-26 02:48:18,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492077270] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:48:18,934 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:48:18,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 02:48:18,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486608532] [2021-08-26 02:48:18,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 02:48:18,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:48:18,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 02:48:18,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-26 02:48:18,935 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:48:18,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:48:18,969 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2021-08-26 02:48:18,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 02:48:18,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-08-26 02:48:18,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:48:18,971 INFO L225 Difference]: With dead ends: 51 [2021-08-26 02:48:18,971 INFO L226 Difference]: Without dead ends: 43 [2021-08-26 02:48:18,971 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 16.9ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-26 02:48:18,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-08-26 02:48:18,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2021-08-26 02:48:18,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:48:18,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2021-08-26 02:48:18,975 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 32 [2021-08-26 02:48:18,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:48:18,975 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2021-08-26 02:48:18,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:48:18,976 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2021-08-26 02:48:18,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-26 02:48:18,976 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:48:18,976 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:48:18,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-26 02:48:18,977 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:48:18,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:48:18,977 INFO L82 PathProgramCache]: Analyzing trace with hash -2088089927, now seen corresponding path program 1 times [2021-08-26 02:48:18,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:48:18,977 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956581663] [2021-08-26 02:48:18,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:48:18,978 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:48:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:48:19,712 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:48:19,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:48:19,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956581663] [2021-08-26 02:48:19,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956581663] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:48:19,713 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462167970] [2021-08-26 02:48:19,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:48:19,713 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:48:19,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 02:48:19,720 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 02:48:19,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-26 02:48:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:48:19,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 84 conjunts are in the unsatisfiable core [2021-08-26 02:48:19,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 02:48:19,898 INFO L388 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 [2021-08-26 02:48:19,974 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-26 02:48:19,974 INFO L388 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 [2021-08-26 02:48:20,044 INFO L388 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 18 treesize of output 14 [2021-08-26 02:48:20,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-26 02:48:20,361 INFO L354 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2021-08-26 02:48:20,361 INFO L388 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 134 treesize of output 88 [2021-08-26 02:48:20,366 INFO L388 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 89 treesize of output 79 [2021-08-26 02:48:20,379 INFO L354 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2021-08-26 02:48:20,379 INFO L388 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 79 treesize of output 63 [2021-08-26 02:48:20,554 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-26 02:48:20,554 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 60 [2021-08-26 02:48:20,571 INFO L354 Elim1Store]: treesize reduction 61, result has 23.8 percent of original size [2021-08-26 02:48:20,572 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 62 [2021-08-26 02:48:20,588 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-26 02:48:20,589 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 40 [2021-08-26 02:48:20,801 INFO L388 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 61 treesize of output 43 [2021-08-26 02:48:20,812 INFO L388 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 [2021-08-26 02:48:20,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2021-08-26 02:48:21,019 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-26 02:48:21,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462167970] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:48:21,020 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 02:48:21,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 34 [2021-08-26 02:48:21,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595464401] [2021-08-26 02:48:21,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-26 02:48:21,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:48:21,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-26 02:48:21,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1043, Unknown=0, NotChecked=0, Total=1122 [2021-08-26 02:48:21,022 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 34 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:48:22,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:48:22,946 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2021-08-26 02:48:22,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-08-26 02:48:22,947 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 34 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-08-26 02:48:22,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:48:22,948 INFO L225 Difference]: With dead ends: 75 [2021-08-26 02:48:22,948 INFO L226 Difference]: Without dead ends: 73 [2021-08-26 02:48:22,949 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 2140.6ms TimeCoverageRelationStatistics Valid=407, Invalid=2563, Unknown=0, NotChecked=0, Total=2970 [2021-08-26 02:48:22,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-08-26 02:48:22,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2021-08-26 02:48:22,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.2) internal successors, (60), 50 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:48:22,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2021-08-26 02:48:22,958 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 33 [2021-08-26 02:48:22,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:48:22,958 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2021-08-26 02:48:22,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 34 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:48:22,959 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2021-08-26 02:48:22,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-26 02:48:22,959 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:48:22,960 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:48:22,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-26 02:48:23,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:48:23,176 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:48:23,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:48:23,177 INFO L82 PathProgramCache]: Analyzing trace with hash -254624194, now seen corresponding path program 2 times [2021-08-26 02:48:23,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:48:23,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165973520] [2021-08-26 02:48:23,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:48:23,177 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:48:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:48:23,259 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-08-26 02:48:23,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:48:23,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165973520] [2021-08-26 02:48:23,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165973520] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:48:23,262 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:48:23,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 02:48:23,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106164551] [2021-08-26 02:48:23,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 02:48:23,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:48:23,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 02:48:23,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 02:48:23,264 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:48:23,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:48:23,304 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2021-08-26 02:48:23,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 02:48:23,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-08-26 02:48:23,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:48:23,306 INFO L225 Difference]: With dead ends: 60 [2021-08-26 02:48:23,306 INFO L226 Difference]: Without dead ends: 52 [2021-08-26 02:48:23,307 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 27.4ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-08-26 02:48:23,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-08-26 02:48:23,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-08-26 02:48:23,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 51 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:48:23,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2021-08-26 02:48:23,315 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 34 [2021-08-26 02:48:23,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:48:23,315 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2021-08-26 02:48:23,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:48:23,316 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2021-08-26 02:48:23,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-26 02:48:23,316 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:48:23,317 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:48:23,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-26 02:48:23,317 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:48:23,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:48:23,317 INFO L82 PathProgramCache]: Analyzing trace with hash 891797658, now seen corresponding path program 3 times [2021-08-26 02:48:23,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:48:23,318 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340188297] [2021-08-26 02:48:23,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:48:23,318 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:48:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:48:23,381 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-26 02:48:23,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:48:23,382 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340188297] [2021-08-26 02:48:23,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340188297] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:48:23,382 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650618133] [2021-08-26 02:48:23,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 02:48:23,383 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:48:23,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 02:48:23,385 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 02:48:23,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-26 02:48:23,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-08-26 02:48:23,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 02:48:23,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-26 02:48:23,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 02:48:23,711 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-08-26 02:48:23,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650618133] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:48:23,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 02:48:23,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2021-08-26 02:48:23,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826454234] [2021-08-26 02:48:23,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 02:48:23,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:48:23,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 02:48:23,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-08-26 02:48:23,713 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:48:23,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:48:23,854 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2021-08-26 02:48:23,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 02:48:23,854 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-08-26 02:48:23,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:48:23,855 INFO L225 Difference]: With dead ends: 63 [2021-08-26 02:48:23,855 INFO L226 Difference]: Without dead ends: 43 [2021-08-26 02:48:23,855 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 93.1ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-08-26 02:48:23,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-08-26 02:48:23,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2021-08-26 02:48:23,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:48:23,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2021-08-26 02:48:23,862 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 34 [2021-08-26 02:48:23,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:48:23,862 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2021-08-26 02:48:23,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:48:23,862 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2021-08-26 02:48:23,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-26 02:48:23,863 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:48:23,863 INFO L512 BasicCegarLoop]: 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] [2021-08-26 02:48:23,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-26 02:48:24,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:48:24,081 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:48:24,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:48:24,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1232245788, now seen corresponding path program 1 times [2021-08-26 02:48:24,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:48:24,081 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080971767] [2021-08-26 02:48:24,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:48:24,082 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:48:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:48:24,260 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-26 02:48:24,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:48:24,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080971767] [2021-08-26 02:48:24,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080971767] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:48:24,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025044005] [2021-08-26 02:48:24,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:48:24,262 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:48:24,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 02:48:24,265 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 02:48:24,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-26 02:48:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:48:24,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 60 conjunts are in the unsatisfiable core [2021-08-26 02:48:24,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 02:48:24,721 INFO L388 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 22 treesize of output 18 [2021-08-26 02:48:25,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-08-26 02:48:25,090 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-26 02:48:25,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025044005] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:48:25,090 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 02:48:25,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 21 [2021-08-26 02:48:25,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646204365] [2021-08-26 02:48:25,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-26 02:48:25,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:48:25,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-26 02:48:25,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2021-08-26 02:48:25,094 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:48:25,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:48:25,617 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2021-08-26 02:48:25,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-26 02:48:25,618 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-08-26 02:48:25,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:48:25,618 INFO L225 Difference]: With dead ends: 52 [2021-08-26 02:48:25,618 INFO L226 Difference]: Without dead ends: 50 [2021-08-26 02:48:25,619 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 561.9ms TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2021-08-26 02:48:25,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-08-26 02:48:25,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2021-08-26 02:48:25,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:48:25,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2021-08-26 02:48:25,625 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 39 [2021-08-26 02:48:25,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:48:25,625 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2021-08-26 02:48:25,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:48:25,625 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2021-08-26 02:48:25,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-26 02:48:25,626 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:48:25,626 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:48:25,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-26 02:48:25,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-08-26 02:48:25,837 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 02:48:25,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:48:25,837 INFO L82 PathProgramCache]: Analyzing trace with hash 506740339, now seen corresponding path program 2 times [2021-08-26 02:48:25,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:48:25,838 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171891115] [2021-08-26 02:48:25,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:48:25,838 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:48:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:48:25,911 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-26 02:48:25,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:48:25,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171891115] [2021-08-26 02:48:25,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171891115] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:48:25,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609303765] [2021-08-26 02:48:25,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 02:48:25,912 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:48:25,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 02:48:25,913 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 02:48:25,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-26 02:48:26,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 02:48:26,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 02:48:26,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-26 02:48:26,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 02:48:26,271 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-26 02:48:26,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609303765] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:48:26,271 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 02:48:26,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-08-26 02:48:26,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693926116] [2021-08-26 02:48:26,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 02:48:26,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:48:26,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 02:48:26,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-08-26 02:48:26,274 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 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) [2021-08-26 02:48:26,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:48:26,320 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2021-08-26 02:48:26,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 02:48:26,320 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-08-26 02:48:26,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:48:26,323 INFO L225 Difference]: With dead ends: 51 [2021-08-26 02:48:26,323 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 02:48:26,323 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 44.4ms TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-08-26 02:48:26,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 02:48:26,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 02:48:26,324 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) [2021-08-26 02:48:26,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 02:48:26,324 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2021-08-26 02:48:26,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:48:26,325 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 02:48:26,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 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) [2021-08-26 02:48:26,325 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 02:48:26,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 02:48:26,328 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 02:48:26,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-26 02:48:26,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:48:26,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-26 02:48:26,549 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:48:26,551 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:48:26,578 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:48:26,578 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:48:26,580 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:48:26,580 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:48:26,598 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:48:26,599 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:48:26,600 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:48:26,615 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:48:26,619 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:48:26,631 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:48:27,873 INFO L860 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2021-08-26 02:48:27,873 INFO L857 garLoopResultBuilder]: For program point L622-2(lines 622 627) no Hoare annotation was computed. [2021-08-26 02:48:27,873 INFO L853 garLoopResultBuilder]: At program point L622-3(lines 622 627) the Hoare annotation is: (let ((.cse14 (* 2 ULTIMATE.start_main_~len~0)) (.cse16 (select (select |#memory_int| ULTIMATE.start_main_~s~0.base) ULTIMATE.start_main_~s~0.offset))) (let ((.cse0 (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1)) (.cse1 (= ULTIMATE.start_node_create_~temp~0.offset 0)) (.cse2 (<= ULTIMATE.start_main_~len~0 .cse16)) (.cse3 (<= (+ ULTIMATE.start_sll_update_at_~index 2) ULTIMATE.start_main_~len~0)) (.cse4 (= (select |#valid| ULTIMATE.start_sll_create_~head~0.base) 1)) (.cse5 (<= (+ 2 .cse16) .cse14)) (.cse6 (= (select |#valid| |ULTIMATE.start_node_create_#res.base|) 1)) (.cse7 (= ULTIMATE.start_main_~s~0.offset ULTIMATE.start_sll_update_at_~head.offset)) (.cse8 (= |ULTIMATE.start_node_create_#res.offset| 0)) (.cse9 (= 2 ULTIMATE.start_main_~len~0)) (.cse10 (= ULTIMATE.start_main_~s~0.base ULTIMATE.start_sll_update_at_~head.base)) (.cse11 (<= (+ ULTIMATE.start_sll_update_at_~data 2) .cse14)) (.cse12 (<= ULTIMATE.start_main_~len~0 ULTIMATE.start_sll_update_at_~data))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0) .cse5 .cse6 (<= ULTIMATE.start_sll_get_data_at_~index 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse15 (+ ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse13 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~s~0.base) .cse15))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_main_~s~0.offset 0) .cse7 .cse8 (not (= .cse13 ULTIMATE.start_main_~s~0.base)) .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_main_~len~0 (+ ULTIMATE.start_main_~i~0 1)) (= .cse14 (+ (select (select |#memory_int| .cse13) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~s~0.base) .cse15)) 1)))))))) [2021-08-26 02:48:27,873 INFO L857 garLoopResultBuilder]: For program point L622-4(lines 622 627) no Hoare annotation was computed. [2021-08-26 02:48:27,873 INFO L853 garLoopResultBuilder]: At program point L581(lines 574 582) the Hoare annotation is: (let ((.cse0 (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1)) (.cse1 (= ULTIMATE.start_node_create_~temp~0.offset 0)) (.cse2 (= (select |#valid| |ULTIMATE.start_node_create_#res.base|) 1)) (.cse3 (= |ULTIMATE.start_node_create_#res.offset| 0)) (.cse4 (= 2 ULTIMATE.start_main_~len~0))) (or (and .cse0 .cse1 (= 2 ULTIMATE.start_sll_create_~len) .cse2 .cse3 .cse4) (and .cse0 .cse1 (= (select |#valid| ULTIMATE.start_sll_create_~head~0.base) 1) .cse2 (not (= |ULTIMATE.start_node_create_#res.base| ULTIMATE.start_sll_create_~head~0.base)) (<= 1 ULTIMATE.start_sll_create_~len) .cse3 .cse4 (not (= ULTIMATE.start_sll_create_~head~0.base ULTIMATE.start_node_create_~temp~0.base))))) [2021-08-26 02:48:27,873 INFO L857 garLoopResultBuilder]: For program point L606(lines 1 632) no Hoare annotation was computed. [2021-08-26 02:48:27,873 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-26 02:48:27,873 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-26 02:48:27,873 INFO L860 garLoopResultBuilder]: At program point L631(lines 613 632) the Hoare annotation is: true [2021-08-26 02:48:27,874 INFO L853 garLoopResultBuilder]: At program point L590(lines 583 591) the Hoare annotation is: (and (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1) (not (= ULTIMATE.start_sll_create_~head~0.base (select (select |#memory_$Pointer$.base| ULTIMATE.start_sll_create_~head~0.base) 4))) (= ULTIMATE.start_node_create_~temp~0.offset 0) (= (select |#valid| ULTIMATE.start_sll_create_~head~0.base) 1) (= (select |#valid| |ULTIMATE.start_node_create_#res.base|) 1) (= |ULTIMATE.start_node_create_#res.offset| 0) (= 2 ULTIMATE.start_main_~len~0) (= ULTIMATE.start_sll_create_~head~0.offset 0) (not (= |ULTIMATE.start_sll_create_#res.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res.base|) 4))) (= |ULTIMATE.start_sll_create_#res.offset| 0)) [2021-08-26 02:48:27,874 INFO L853 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse17 (select |#memory_$Pointer$.base| ULTIMATE.start_main_~s~0.base)) (.cse23 (+ ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse22 (select .cse17 .cse23)) (.cse24 (+ ULTIMATE.start_sll_update_at_~data 1)) (.cse21 (* 2 ULTIMATE.start_main_~len~0))) (let ((.cse4 (<= (+ ULTIMATE.start_sll_update_at_~index 2) ULTIMATE.start_main_~len~0)) (.cse9 (= ULTIMATE.start_main_~s~0.offset 0)) (.cse12 (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~s~0.base)) (.cse0 (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1)) (.cse1 (not (= ULTIMATE.start_sll_create_~head~0.base (select (select |#memory_$Pointer$.base| ULTIMATE.start_sll_create_~head~0.base) 4)))) (.cse3 (= ULTIMATE.start_node_create_~temp~0.offset 0)) (.cse5 (= (select |#valid| ULTIMATE.start_sll_create_~head~0.base) 1)) (.cse6 (<= .cse24 .cse21)) (.cse7 (= (select |#valid| |ULTIMATE.start_node_create_#res.base|) 1)) (.cse8 (<= .cse21 .cse24)) (.cse18 (= ULTIMATE.start_main_~s~0.offset ULTIMATE.start_sll_update_at_~head.offset)) (.cse10 (= |ULTIMATE.start_node_create_#res.offset| 0)) (.cse19 (not (= .cse22 ULTIMATE.start_main_~s~0.base))) (.cse11 (= 2 ULTIMATE.start_main_~len~0)) (.cse20 (= ULTIMATE.start_main_~s~0.base ULTIMATE.start_sll_update_at_~head.base)) (.cse13 (= ULTIMATE.start_sll_create_~head~0.offset 0)) (.cse14 (not (= |ULTIMATE.start_sll_create_#res.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res.base|) 4)))) (.cse15 (= |ULTIMATE.start_sll_create_#res.offset| 0)) (.cse16 (= ULTIMATE.start_main_~len~0 (+ ULTIMATE.start_main_~i~0 1)))) (or (let ((.cse2 (select .cse17 4))) (and .cse0 .cse1 (= ULTIMATE.start_sll_update_at_~head.base .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_main_~s~0.base .cse2)) .cse8 .cse9 .cse10 .cse11 (= (select .cse12 4) ULTIMATE.start_sll_update_at_~head.offset) .cse13 .cse14 .cse15 .cse16)) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse9 .cse18 .cse10 .cse19 .cse11 .cse20 (<= (+ ULTIMATE.start_sll_update_at_~data 2) .cse21) (<= ULTIMATE.start_main_~len~0 ULTIMATE.start_sll_update_at_~data) (= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0) (= .cse21 (+ (select (select |#memory_int| .cse22) (select .cse12 .cse23)) 1))) (and .cse0 .cse1 (<= ULTIMATE.start_main_~len~0 (+ ULTIMATE.start_sll_update_at_~index 1)) .cse3 (<= ULTIMATE.start_sll_update_at_~index ULTIMATE.start_main_~i~0) .cse5 .cse6 .cse7 .cse8 .cse18 .cse10 .cse19 .cse11 .cse20 .cse13 .cse14 .cse15 (= ULTIMATE.start_sll_update_at_~head.offset 0) .cse16))))) [2021-08-26 02:48:27,874 INFO L857 garLoopResultBuilder]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2021-08-26 02:48:27,874 INFO L857 garLoopResultBuilder]: For program point L624(lines 624 626) no Hoare annotation was computed. [2021-08-26 02:48:27,874 INFO L853 garLoopResultBuilder]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse26 (+ ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse24 (select (select |#memory_int| ULTIMATE.start_main_~s~0.base) ULTIMATE.start_main_~s~0.offset)) (.cse23 (* 2 ULTIMATE.start_main_~len~0)) (.cse25 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~s~0.base) .cse26))) (let ((.cse1 (= (mod (+ ULTIMATE.start_main_~expected~0 1) (- 2)) 0)) (.cse9 (= ULTIMATE.start_main_~s~0.offset 0)) (.cse12 (not (= .cse25 ULTIMATE.start_main_~s~0.base))) (.cse18 (= ULTIMATE.start_main_~len~0 (+ ULTIMATE.start_main_~i~0 1))) (.cse19 (= .cse23 (+ (select (select |#memory_int| .cse25) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~s~0.base) .cse26)) 1))) (.cse0 (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1)) (.cse21 (select (select |#memory_int| ULTIMATE.start_sll_get_data_at_~head.base) ULTIMATE.start_sll_get_data_at_~head.offset)) (.cse2 (= ULTIMATE.start_node_create_~temp~0.offset 0)) (.cse3 (<= ULTIMATE.start_main_~len~0 .cse24)) (.cse4 (<= (+ ULTIMATE.start_sll_update_at_~index 2) ULTIMATE.start_main_~len~0)) (.cse5 (= (select |#valid| ULTIMATE.start_sll_create_~head~0.base) 1)) (.cse7 (<= (+ 2 .cse24) .cse23)) (.cse8 (= (select |#valid| |ULTIMATE.start_node_create_#res.base|) 1)) (.cse22 (<= ULTIMATE.start_sll_get_data_at_~index 0)) (.cse10 (= ULTIMATE.start_main_~s~0.offset ULTIMATE.start_sll_update_at_~head.offset)) (.cse11 (= |ULTIMATE.start_node_create_#res.offset| 0)) (.cse14 (= 2 ULTIMATE.start_main_~len~0)) (.cse15 (= ULTIMATE.start_main_~s~0.base ULTIMATE.start_sll_update_at_~head.base)) (.cse16 (<= (+ ULTIMATE.start_sll_update_at_~data 2) .cse23)) (.cse17 (<= ULTIMATE.start_main_~len~0 ULTIMATE.start_sll_update_at_~data))) (or (let ((.cse20 (+ ULTIMATE.start_sll_get_data_at_~head.offset 4))) (let ((.cse13 (select (select |#memory_$Pointer$.base| ULTIMATE.start_sll_get_data_at_~head.base) .cse20))) (let ((.cse6 (select (select |#memory_int| .cse13) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_sll_get_data_at_~head.base) .cse20)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= .cse6 ULTIMATE.start_main_~expected~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_sll_get_data_at_~head.base .cse13)) .cse14 .cse15 .cse16 (<= ULTIMATE.start_main_~expected~0 .cse6) .cse17 (<= 1 ULTIMATE.start_sll_get_data_at_~index) .cse18 (<= ULTIMATE.start_sll_get_data_at_~index 1) .cse19 (= ULTIMATE.start_sll_get_data_at_~head.offset 0))))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 (= (+ .cse21 (* 2 (div (+ (* ULTIMATE.start_main_~expected~0 (- 1)) 1) (- 2))) 1) (* 2 ULTIMATE.start_main_~expected~0)) .cse9 .cse22 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 (<= .cse21 2) (<= 2 .cse21) .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 (= 2 ULTIMATE.start_main_~expected~0) .cse22 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 (= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0)))))) [2021-08-26 02:48:27,874 INFO L857 garLoopResultBuilder]: For program point L600-3(lines 600 603) no Hoare annotation was computed. [2021-08-26 02:48:27,874 INFO L853 garLoopResultBuilder]: At program point L625(lines 613 632) the Hoare annotation is: false [2021-08-26 02:48:27,874 INFO L857 garLoopResultBuilder]: For program point L592(lines 592 598) no Hoare annotation was computed. [2021-08-26 02:48:27,874 INFO L857 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2021-08-26 02:48:27,874 INFO L857 garLoopResultBuilder]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2021-08-26 02:48:27,874 INFO L860 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2021-08-26 02:48:27,875 INFO L853 garLoopResultBuilder]: At program point L618-2(lines 618 621) the Hoare annotation is: (let ((.cse15 (select |#memory_$Pointer$.base| ULTIMATE.start_main_~s~0.base))) (let ((.cse16 (select .cse15 4))) (let ((.cse0 (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1)) (.cse1 (= ULTIMATE.start_node_create_~temp~0.offset 0)) (.cse9 (<= (+ ULTIMATE.start_sll_update_at_~index 2) ULTIMATE.start_main_~len~0)) (.cse2 (= (select |#valid| ULTIMATE.start_sll_create_~head~0.base) 1)) (.cse3 (= (select |#valid| |ULTIMATE.start_node_create_#res.base|) 1)) (.cse4 (not (= ULTIMATE.start_main_~s~0.base .cse16))) (.cse5 (= ULTIMATE.start_main_~s~0.offset 0)) (.cse6 (= |ULTIMATE.start_node_create_#res.offset| 0)) (.cse7 (= 2 ULTIMATE.start_main_~len~0)) (.cse11 (* 2 ULTIMATE.start_main_~len~0)) (.cse10 (+ ULTIMATE.start_main_~i~0 2)) (.cse13 (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~s~0.base))) (or (and .cse0 (not (= ULTIMATE.start_sll_create_~head~0.base (select (select |#memory_$Pointer$.base| ULTIMATE.start_sll_create_~head~0.base) 4))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_sll_create_~head~0.offset 0) (not (= |ULTIMATE.start_sll_create_#res.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res.base|) 4))) (= |ULTIMATE.start_sll_create_#res.offset| 0) (= ULTIMATE.start_main_~len~0 (+ ULTIMATE.start_main_~i~0 1))) (let ((.cse14 (+ ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse8 (select (select |#memory_int| ULTIMATE.start_main_~s~0.base) ULTIMATE.start_main_~s~0.offset)) (.cse12 (select .cse15 .cse14))) (and .cse0 .cse1 (<= ULTIMATE.start_main_~len~0 .cse8) .cse9 .cse2 (<= .cse10 ULTIMATE.start_main_~len~0) (<= (+ 2 .cse8) .cse11) .cse3 .cse5 (= ULTIMATE.start_main_~s~0.offset ULTIMATE.start_sll_update_at_~head.offset) .cse6 (not (= .cse12 ULTIMATE.start_main_~s~0.base)) .cse7 (= ULTIMATE.start_main_~s~0.base ULTIMATE.start_sll_update_at_~head.base) (<= (+ ULTIMATE.start_sll_update_at_~data 2) .cse11) (<= ULTIMATE.start_main_~len~0 ULTIMATE.start_sll_update_at_~data) (= .cse11 (+ (select (select |#memory_int| .cse12) (select .cse13 .cse14)) 1))))) (let ((.cse19 (select .cse13 4))) (let ((.cse17 (+ ULTIMATE.start_sll_update_at_~data 1)) (.cse18 (+ (select (select |#memory_int| .cse16) .cse19) 1))) (and .cse0 (= ULTIMATE.start_sll_update_at_~head.base .cse16) .cse1 .cse9 .cse2 (<= .cse17 .cse11) .cse3 (<= .cse18 .cse11) .cse4 (<= .cse11 .cse17) .cse5 .cse6 .cse7 (<= .cse11 .cse18) (= .cse19 ULTIMATE.start_sll_update_at_~head.offset) (= .cse10 ULTIMATE.start_main_~len~0)))))))) [2021-08-26 02:48:27,875 INFO L857 garLoopResultBuilder]: For program point L585-2(lines 585 589) no Hoare annotation was computed. [2021-08-26 02:48:27,875 INFO L857 garLoopResultBuilder]: For program point L618-3(lines 618 621) no Hoare annotation was computed. [2021-08-26 02:48:27,875 INFO L853 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse1 (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1)) (.cse2 (= ULTIMATE.start_node_create_~temp~0.offset 0)) (.cse3 (= (select |#valid| ULTIMATE.start_sll_create_~head~0.base) 1)) (.cse4 (= (select |#valid| |ULTIMATE.start_node_create_#res.base|) 1)) (.cse5 (= |ULTIMATE.start_node_create_#res.offset| 0)) (.cse0 (= 2 ULTIMATE.start_main_~len~0))) (or (and (= 2 ULTIMATE.start_sll_create_~len) .cse0) (and .cse1 (not (= ULTIMATE.start_sll_create_~head~0.base (select (select |#memory_$Pointer$.base| ULTIMATE.start_sll_create_~head~0.base) 4))) .cse2 .cse3 .cse4 .cse5 .cse0 (= ULTIMATE.start_sll_create_~head~0.offset 0)) (and .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_sll_create_~len) .cse5 .cse0))) [2021-08-26 02:48:27,875 INFO L857 garLoopResultBuilder]: For program point L585-4(lines 585 589) no Hoare annotation was computed. [2021-08-26 02:48:27,875 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-26 02:48:27,875 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2021-08-26 02:48:27,875 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-26 02:48:27,875 INFO L853 garLoopResultBuilder]: At program point L604(lines 599 605) the Hoare annotation is: (let ((.cse18 (* 2 ULTIMATE.start_main_~len~0)) (.cse20 (select (select |#memory_int| ULTIMATE.start_main_~s~0.base) ULTIMATE.start_main_~s~0.offset))) (let ((.cse0 (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1)) (.cse9 (select (select |#memory_int| ULTIMATE.start_sll_get_data_at_~head.base) ULTIMATE.start_sll_get_data_at_~head.offset)) (.cse1 (= ULTIMATE.start_node_create_~temp~0.offset 0)) (.cse4 (<= ULTIMATE.start_main_~len~0 .cse20)) (.cse5 (<= (+ ULTIMATE.start_sll_update_at_~index 2) ULTIMATE.start_main_~len~0)) (.cse6 (= (select |#valid| ULTIMATE.start_sll_create_~head~0.base) 1)) (.cse7 (<= (+ 2 .cse20) .cse18)) (.cse8 (= (select |#valid| |ULTIMATE.start_node_create_#res.base|) 1)) (.cse10 (<= ULTIMATE.start_sll_get_data_at_~index 0)) (.cse11 (= ULTIMATE.start_main_~s~0.offset ULTIMATE.start_sll_update_at_~head.offset)) (.cse12 (= |ULTIMATE.start_node_create_#res.offset| 0)) (.cse14 (= 2 ULTIMATE.start_main_~len~0)) (.cse15 (= ULTIMATE.start_main_~s~0.base ULTIMATE.start_sll_update_at_~head.base)) (.cse16 (<= (+ ULTIMATE.start_sll_update_at_~data 2) .cse18)) (.cse17 (<= ULTIMATE.start_main_~len~0 ULTIMATE.start_sll_update_at_~data))) (or (let ((.cse19 (+ ULTIMATE.start_main_~s~0.offset 4))) (let ((.cse2 (* 2 (div (+ (* ULTIMATE.start_main_~expected~0 (- 1)) 1) (- 2)))) (.cse3 (* 2 ULTIMATE.start_main_~expected~0)) (.cse13 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~s~0.base) .cse19))) (and .cse0 (= (mod (+ ULTIMATE.start_main_~expected~0 1) (- 2)) 0) .cse1 (= (+ |ULTIMATE.start_sll_get_data_at_#res| .cse2 1) .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (= (+ .cse9 .cse2 1) .cse3) (= ULTIMATE.start_main_~s~0.offset 0) .cse10 .cse11 .cse12 (not (= .cse13 ULTIMATE.start_main_~s~0.base)) .cse14 .cse15 .cse16 .cse17 (= ULTIMATE.start_main_~len~0 (+ ULTIMATE.start_main_~i~0 1)) (= .cse18 (+ (select (select |#memory_int| .cse13) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~s~0.base) .cse19)) 1))))) (and .cse0 (<= .cse9 2) (<= 2 .cse9) (<= 2 |ULTIMATE.start_sll_get_data_at_#res|) .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_main_~expected~0) (<= |ULTIMATE.start_sll_get_data_at_#res| 2) .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 (= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0))))) [2021-08-26 02:48:27,879 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 02:48:27,889 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,890 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,890 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:27,893 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,893 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,893 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:27,895 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,896 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,896 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,897 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,898 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,898 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,898 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:27,901 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,901 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,901 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:27,903 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,904 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,907 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,907 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:27,907 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,908 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,908 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,908 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:27,908 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,908 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:27,909 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,909 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,909 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:27,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:27,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,914 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,914 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:27,914 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,914 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:27,914 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,915 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,915 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:27,918 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:27,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:27,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,921 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,923 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,923 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,923 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,924 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:27,924 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,924 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,924 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,924 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:27,925 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,925 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,925 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,927 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,928 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,928 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,928 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,928 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,928 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:27,929 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,929 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,929 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:27,929 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,929 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,930 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:27,930 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:27,932 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,932 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:27,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,934 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,934 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:27,934 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,934 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:27,934 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:27,935 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:27,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 02:48:27 BoogieIcfgContainer [2021-08-26 02:48:27,937 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 02:48:27,938 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 02:48:27,938 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 02:48:27,938 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 02:48:27,938 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:48:16" (3/4) ... [2021-08-26 02:48:27,941 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-26 02:48:27,949 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2021-08-26 02:48:27,949 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-08-26 02:48:27,950 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 02:48:27,950 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 02:48:27,968 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((2 == len && 2 == len) || (((((((\valid[temp] == 1 && !(head == #memory_$Pointer$[head][4])) && temp == 0) && \valid[head] == 1) && \valid[\result] == 1) && \result == 0) && 2 == len) && head == 0)) || ((((((\valid[temp] == 1 && temp == 0) && \valid[head] == 1) && \valid[\result] == 1) && 1 <= len) && \result == 0) && 2 == len) [2021-08-26 02:48:27,968 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\valid[temp] == 1 && !(head == #memory_$Pointer$[head][4])) && temp == 0) && \valid[head] == 1) && \valid[\result] == 1) && \result == 0) && 2 == len) && head == 0) && !(\result == #memory_$Pointer$[\result][4])) && \result == 0 [2021-08-26 02:48:27,969 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((\valid[temp] == 1 && !(head == #memory_$Pointer$[head][4])) && temp == 0) && \valid[head] == 1) && \valid[\result] == 1) && !(s == #memory_$Pointer$[s][4])) && s == 0) && \result == 0) && 2 == len) && head == 0) && !(\result == #memory_$Pointer$[\result][4])) && \result == 0) && len == i + 1) || ((((((((((((((((\valid[temp] == 1 && temp == 0) && len <= unknown-#memory_int-unknown[s][s]) && index + 2 <= len) && \valid[head] == 1) && i + 2 <= len) && 2 + unknown-#memory_int-unknown[s][s] <= 2 * len) && \valid[\result] == 1) && s == 0) && s == head) && \result == 0) && !(#memory_$Pointer$[s][s + 4] == s)) && 2 == len) && s == head) && data + 2 <= 2 * len) && len <= data) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1)) || (((((((((((((((\valid[temp] == 1 && head == #memory_$Pointer$[s][4]) && temp == 0) && index + 2 <= len) && \valid[head] == 1) && data + 1 <= 2 * len) && \valid[\result] == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] + 1 <= 2 * len) && !(s == #memory_$Pointer$[s][4])) && 2 * len <= data + 1) && s == 0) && \result == 0) && 2 == len) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] + 1) && #memory_$Pointer$[s][4] == head) && i + 2 == len) [2021-08-26 02:48:27,969 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((\valid[temp] == 1 && temp == 0) && len <= unknown-#memory_int-unknown[s][s]) && index + 2 <= len) && \valid[head] == 1) && i + 2 <= len) && 2 + unknown-#memory_int-unknown[s][s] <= 2 * len) && \valid[\result] == 1) && index <= 0) && s == head) && \result == 0) && 2 == len) && s == head) && data + 2 <= 2 * len) && len <= data) || ((((((((((((((((\valid[temp] == 1 && temp == 0) && len <= unknown-#memory_int-unknown[s][s]) && index + 2 <= len) && \valid[head] == 1) && 2 + unknown-#memory_int-unknown[s][s] <= 2 * len) && \valid[\result] == 1) && s == 0) && s == head) && \result == 0) && !(#memory_$Pointer$[s][s + 4] == s)) && 2 == len) && s == head) && data + 2 <= 2 * len) && len <= data) && len == i + 1) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) [2021-08-26 02:48:27,969 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\valid[temp] == 1 && temp == 0) && 2 == len) && \valid[\result] == 1) && \result == 0) && 2 == len) || ((((((((\valid[temp] == 1 && temp == 0) && \valid[head] == 1) && \valid[\result] == 1) && !(\result == head)) && 1 <= len) && \result == 0) && 2 == len) && !(head == temp)) [2021-08-26 02:48:27,969 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((\valid[temp] == 1 && !(head == #memory_$Pointer$[head][4])) && head == #memory_$Pointer$[s][4]) && temp == 0) && index + 2 <= len) && \valid[head] == 1) && data + 1 <= 2 * len) && \valid[\result] == 1) && !(s == #memory_$Pointer$[s][4])) && 2 * len <= data + 1) && s == 0) && \result == 0) && 2 == len) && #memory_$Pointer$[s][4] == head) && head == 0) && !(\result == #memory_$Pointer$[\result][4])) && \result == 0) && len == i + 1) || ((((((((((((((\valid[temp] == 1 && temp == 0) && index + 2 <= len) && \valid[head] == 1) && \valid[\result] == 1) && s == 0) && s == head) && \result == 0) && !(#memory_$Pointer$[s][s + 4] == s)) && 2 == len) && s == head) && data + 2 <= 2 * len) && len <= data) && i + 2 == len) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1)) || ((((((((((((((((((\valid[temp] == 1 && !(head == #memory_$Pointer$[head][4])) && len <= index + 1) && temp == 0) && index <= i) && \valid[head] == 1) && data + 1 <= 2 * len) && \valid[\result] == 1) && 2 * len <= data + 1) && s == head) && \result == 0) && !(#memory_$Pointer$[s][s + 4] == s)) && 2 == len) && s == head) && head == 0) && !(\result == #memory_$Pointer$[\result][4])) && \result == 0) && head == 0) && len == i + 1) [2021-08-26 02:48:27,969 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((\valid[temp] == 1 && (expected + 1) % -2 == 0) && temp == 0) && len <= unknown-#memory_int-unknown[s][s]) && index + 2 <= len) && \valid[head] == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]] <= expected) && 2 + unknown-#memory_int-unknown[s][s] <= 2 * len) && \valid[\result] == 1) && s == 0) && s == head) && \result == 0) && !(#memory_$Pointer$[s][s + 4] == s)) && !(head == #memory_$Pointer$[head][head + 4])) && 2 == len) && s == head) && data + 2 <= 2 * len) && expected <= unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]]) && len <= data) && 1 <= index) && len == i + 1) && index <= 1) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && head == 0) || (((((((((((((((((((\valid[temp] == 1 && (expected + 1) % -2 == 0) && temp == 0) && len <= unknown-#memory_int-unknown[s][s]) && index + 2 <= len) && \valid[head] == 1) && 2 + unknown-#memory_int-unknown[s][s] <= 2 * len) && \valid[\result] == 1) && unknown-#memory_int-unknown[head][head] + 2 * ((expected * -1 + 1) / -2) + 1 == 2 * expected) && s == 0) && index <= 0) && s == head) && \result == 0) && !(#memory_$Pointer$[s][s + 4] == s)) && 2 == len) && s == head) && data + 2 <= 2 * len) && len <= data) && len == i + 1) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1)) || (((((((((((((((((\valid[temp] == 1 && unknown-#memory_int-unknown[head][head] <= 2) && 2 <= unknown-#memory_int-unknown[head][head]) && temp == 0) && len <= unknown-#memory_int-unknown[s][s]) && index + 2 <= len) && \valid[head] == 1) && 2 + unknown-#memory_int-unknown[s][s] <= 2 * len) && \valid[\result] == 1) && 2 == expected) && index <= 0) && s == head) && \result == 0) && 2 == len) && s == head) && data + 2 <= 2 * len) && len <= data) && i + 2 == len) [2021-08-26 02:48:27,970 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\valid[temp] == 1 && (expected + 1) % -2 == 0) && temp == 0) && \result + 2 * ((expected * -1 + 1) / -2) + 1 == 2 * expected) && len <= unknown-#memory_int-unknown[s][s]) && index + 2 <= len) && \valid[head] == 1) && 2 + unknown-#memory_int-unknown[s][s] <= 2 * len) && \valid[\result] == 1) && unknown-#memory_int-unknown[head][head] + 2 * ((expected * -1 + 1) / -2) + 1 == 2 * expected) && s == 0) && index <= 0) && s == head) && \result == 0) && !(#memory_$Pointer$[s][s + 4] == s)) && 2 == len) && s == head) && data + 2 <= 2 * len) && len <= data) && len == i + 1) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) || (((((((((((((((((((\valid[temp] == 1 && unknown-#memory_int-unknown[head][head] <= 2) && 2 <= unknown-#memory_int-unknown[head][head]) && 2 <= \result) && temp == 0) && len <= unknown-#memory_int-unknown[s][s]) && index + 2 <= len) && \valid[head] == 1) && 2 + unknown-#memory_int-unknown[s][s] <= 2 * len) && \valid[\result] == 1) && 2 == expected) && \result <= 2) && index <= 0) && s == head) && \result == 0) && 2 == len) && s == head) && data + 2 <= 2 * len) && len <= data) && i + 2 == len) [2021-08-26 02:48:27,983 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 02:48:27,983 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 02:48:27,984 INFO L168 Benchmark]: Toolchain (without parser) took 12225.52 ms. Allocated memory was 65.0 MB in the beginning and 172.0 MB in the end (delta: 107.0 MB). Free memory was 44.2 MB in the beginning and 61.0 MB in the end (delta: -16.9 MB). Peak memory consumption was 90.8 MB. Max. memory is 16.1 GB. [2021-08-26 02:48:27,984 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 65.0 MB. Free memory was 46.0 MB in the beginning and 45.9 MB in the end (delta: 40.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 02:48:27,985 INFO L168 Benchmark]: CACSL2BoogieTranslator took 398.90 ms. Allocated memory is still 65.0 MB. Free memory was 44.0 MB in the beginning and 41.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-26 02:48:27,985 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.54 ms. Allocated memory is still 65.0 MB. Free memory was 41.4 MB in the beginning and 39.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 02:48:27,985 INFO L168 Benchmark]: Boogie Preprocessor took 37.32 ms. Allocated memory is still 65.0 MB. Free memory was 39.3 MB in the beginning and 37.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 02:48:27,985 INFO L168 Benchmark]: RCFGBuilder took 538.36 ms. Allocated memory is still 65.0 MB. Free memory was 37.7 MB in the beginning and 33.0 MB in the end (delta: 4.7 MB). Peak memory consumption was 12.3 MB. Max. memory is 16.1 GB. [2021-08-26 02:48:27,986 INFO L168 Benchmark]: TraceAbstraction took 11140.24 ms. Allocated memory was 65.0 MB in the beginning and 172.0 MB in the end (delta: 107.0 MB). Free memory was 32.5 MB in the beginning and 64.2 MB in the end (delta: -31.7 MB). Peak memory consumption was 92.9 MB. Max. memory is 16.1 GB. [2021-08-26 02:48:27,986 INFO L168 Benchmark]: Witness Printer took 45.83 ms. Allocated memory is still 172.0 MB. Free memory was 64.2 MB in the beginning and 61.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-26 02:48:27,988 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.19 ms. Allocated memory is still 65.0 MB. Free memory was 46.0 MB in the beginning and 45.9 MB in the end (delta: 40.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 398.90 ms. Allocated memory is still 65.0 MB. Free memory was 44.0 MB in the beginning and 41.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 59.54 ms. Allocated memory is still 65.0 MB. Free memory was 41.4 MB in the beginning and 39.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 37.32 ms. Allocated memory is still 65.0 MB. Free memory was 39.3 MB in the beginning and 37.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 538.36 ms. Allocated memory is still 65.0 MB. Free memory was 37.7 MB in the beginning and 33.0 MB in the end (delta: 4.7 MB). Peak memory consumption was 12.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 11140.24 ms. Allocated memory was 65.0 MB in the beginning and 172.0 MB in the end (delta: 107.0 MB). Free memory was 32.5 MB in the beginning and 64.2 MB in the end (delta: -31.7 MB). Peak memory consumption was 92.9 MB. Max. memory is 16.1 GB. * Witness Printer took 45.83 ms. Allocated memory is still 172.0 MB. Free memory was 64.2 MB in the beginning and 61.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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 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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 630]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11025.4ms, OverallIterations: 12, TraceHistogramMax: 2, EmptinessCheckTime: 17.2ms, AutomataDifference: 2953.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 1327.2ms, InitialAbstractionConstructionTime: 16.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 255 SDtfs, 782 SDslu, 698 SDs, 0 SdLazy, 1116 SolverSat, 259 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 827.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 314 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 2985.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=9, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 80.4ms AutomataMinimizationTime, 12 MinimizatonAttempts, 75 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 31 NumberOfFragments, 1560 HoareAnnotationTreeSize, 12 FomulaSimplifications, 7464 FormulaSimplificationTreeSizeReduction, 88.7ms HoareSimplificationTime, 12 FomulaSimplificationsInter, 521 FormulaSimplificationTreeSizeReductionInter, 1231.4ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 130.8ms SsaConstructionTime, 477.6ms SatisfiabilityAnalysisTime, 3820.6ms InterpolantComputationTime, 526 NumberOfCodeBlocks, 526 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 508 ConstructedInterpolants, 0 QuantifiedInterpolants, 3280 SizeOfPredicates, 76 NumberOfNonLiveVariables, 1213 ConjunctsInSsa, 164 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 170/232 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 622]: Loop Invariant [2021-08-26 02:48:28,004 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,004 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,005 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:28,006 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,006 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,006 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((\valid[temp] == 1 && temp == 0) && len <= unknown-#memory_int-unknown[s][s]) && index + 2 <= len) && \valid[head] == 1) && i + 2 <= len) && 2 + unknown-#memory_int-unknown[s][s] <= 2 * len) && \valid[\result] == 1) && index <= 0) && s == head) && \result == 0) && 2 == len) && s == head) && data + 2 <= 2 * len) && len <= data) || ((((((((((((((((\valid[temp] == 1 && temp == 0) && len <= unknown-#memory_int-unknown[s][s]) && index + 2 <= len) && \valid[head] == 1) && 2 + unknown-#memory_int-unknown[s][s] <= 2 * len) && \valid[\result] == 1) && s == 0) && s == head) && \result == 0) && !(#memory_$Pointer$[s][s + 4] == s)) && 2 == len) && s == head) && data + 2 <= 2 * len) && len <= data) && len == i + 1) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) - InvariantResult [Line: 583]: Loop Invariant [2021-08-26 02:48:28,007 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,007 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,008 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,008 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((\valid[temp] == 1 && !(head == #memory_$Pointer$[head][4])) && temp == 0) && \valid[head] == 1) && \valid[\result] == 1) && \result == 0) && 2 == len) && head == 0) && !(\result == #memory_$Pointer$[\result][4])) && \result == 0 - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 599]: Loop Invariant [2021-08-26 02:48:28,009 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,009 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,009 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:28,010 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,011 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,011 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((((\valid[temp] == 1 && (expected + 1) % -2 == 0) && temp == 0) && \result + 2 * ((expected * -1 + 1) / -2) + 1 == 2 * expected) && len <= unknown-#memory_int-unknown[s][s]) && index + 2 <= len) && \valid[head] == 1) && 2 + unknown-#memory_int-unknown[s][s] <= 2 * len) && \valid[\result] == 1) && unknown-#memory_int-unknown[head][head] + 2 * ((expected * -1 + 1) / -2) + 1 == 2 * expected) && s == 0) && index <= 0) && s == head) && \result == 0) && !(#memory_$Pointer$[s][s + 4] == s)) && 2 == len) && s == head) && data + 2 <= 2 * len) && len <= data) && len == i + 1) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) || (((((((((((((((((((\valid[temp] == 1 && unknown-#memory_int-unknown[head][head] <= 2) && 2 <= unknown-#memory_int-unknown[head][head]) && 2 <= \result) && temp == 0) && len <= unknown-#memory_int-unknown[s][s]) && index + 2 <= len) && \valid[head] == 1) && 2 + unknown-#memory_int-unknown[s][s] <= 2 * len) && \valid[\result] == 1) && 2 == expected) && \result <= 2) && index <= 0) && s == head) && \result == 0) && 2 == len) && s == head) && data + 2 <= 2 * len) && len <= data) && i + 2 == len) - InvariantResult [Line: 585]: Loop Invariant [2021-08-26 02:48:28,012 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,012 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((2 == len && 2 == len) || (((((((\valid[temp] == 1 && !(head == #memory_$Pointer$[head][4])) && temp == 0) && \valid[head] == 1) && \valid[\result] == 1) && \result == 0) && 2 == len) && head == 0)) || ((((((\valid[temp] == 1 && temp == 0) && \valid[head] == 1) && \valid[\result] == 1) && 1 <= len) && \result == 0) && 2 == len) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 574]: Loop Invariant Derived loop invariant: (((((\valid[temp] == 1 && temp == 0) && 2 == len) && \valid[\result] == 1) && \result == 0) && 2 == len) || ((((((((\valid[temp] == 1 && temp == 0) && \valid[head] == 1) && \valid[\result] == 1) && !(\result == head)) && 1 <= len) && \result == 0) && 2 == len) && !(head == temp)) - InvariantResult [Line: 600]: Loop Invariant [2021-08-26 02:48:28,014 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,014 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:28,014 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,015 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,015 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,015 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:28,015 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,015 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:28,016 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,016 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,016 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:28,017 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,018 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:28,018 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,018 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,018 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,019 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:28,019 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,019 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:28,019 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,019 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,019 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((((((((\valid[temp] == 1 && (expected + 1) % -2 == 0) && temp == 0) && len <= unknown-#memory_int-unknown[s][s]) && index + 2 <= len) && \valid[head] == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]] <= expected) && 2 + unknown-#memory_int-unknown[s][s] <= 2 * len) && \valid[\result] == 1) && s == 0) && s == head) && \result == 0) && !(#memory_$Pointer$[s][s + 4] == s)) && !(head == #memory_$Pointer$[head][head + 4])) && 2 == len) && s == head) && data + 2 <= 2 * len) && expected <= unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]]) && len <= data) && 1 <= index) && len == i + 1) && index <= 1) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && head == 0) || (((((((((((((((((((\valid[temp] == 1 && (expected + 1) % -2 == 0) && temp == 0) && len <= unknown-#memory_int-unknown[s][s]) && index + 2 <= len) && \valid[head] == 1) && 2 + unknown-#memory_int-unknown[s][s] <= 2 * len) && \valid[\result] == 1) && unknown-#memory_int-unknown[head][head] + 2 * ((expected * -1 + 1) / -2) + 1 == 2 * expected) && s == 0) && index <= 0) && s == head) && \result == 0) && !(#memory_$Pointer$[s][s + 4] == s)) && 2 == len) && s == head) && data + 2 <= 2 * len) && len <= data) && len == i + 1) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1)) || (((((((((((((((((\valid[temp] == 1 && unknown-#memory_int-unknown[head][head] <= 2) && 2 <= unknown-#memory_int-unknown[head][head]) && temp == 0) && len <= unknown-#memory_int-unknown[s][s]) && index + 2 <= len) && \valid[head] == 1) && 2 + unknown-#memory_int-unknown[s][s] <= 2 * len) && \valid[\result] == 1) && 2 == expected) && index <= 0) && s == head) && \result == 0) && 2 == len) && s == head) && data + 2 <= 2 * len) && len <= data) && i + 2 == len) - InvariantResult [Line: 607]: Loop Invariant [2021-08-26 02:48:28,021 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,021 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,021 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,022 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:28,022 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,022 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,022 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,022 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:28,022 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,023 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,023 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,024 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,024 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,024 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,024 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:28,024 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,025 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,025 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,025 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:28,025 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,025 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,026 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((\valid[temp] == 1 && !(head == #memory_$Pointer$[head][4])) && head == #memory_$Pointer$[s][4]) && temp == 0) && index + 2 <= len) && \valid[head] == 1) && data + 1 <= 2 * len) && \valid[\result] == 1) && !(s == #memory_$Pointer$[s][4])) && 2 * len <= data + 1) && s == 0) && \result == 0) && 2 == len) && #memory_$Pointer$[s][4] == head) && head == 0) && !(\result == #memory_$Pointer$[\result][4])) && \result == 0) && len == i + 1) || ((((((((((((((\valid[temp] == 1 && temp == 0) && index + 2 <= len) && \valid[head] == 1) && \valid[\result] == 1) && s == 0) && s == head) && \result == 0) && !(#memory_$Pointer$[s][s + 4] == s)) && 2 == len) && s == head) && data + 2 <= 2 * len) && len <= data) && i + 2 == len) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1)) || ((((((((((((((((((\valid[temp] == 1 && !(head == #memory_$Pointer$[head][4])) && len <= index + 1) && temp == 0) && index <= i) && \valid[head] == 1) && data + 1 <= 2 * len) && \valid[\result] == 1) && 2 * len <= data + 1) && s == head) && \result == 0) && !(#memory_$Pointer$[s][s + 4] == s)) && 2 == len) && s == head) && head == 0) && !(\result == #memory_$Pointer$[\result][4])) && \result == 0) && head == 0) && len == i + 1) - InvariantResult [Line: 618]: Loop Invariant [2021-08-26 02:48:28,027 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,027 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,027 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,027 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,027 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,028 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:28,028 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,028 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,028 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:28,028 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,029 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,029 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:28,029 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:28,030 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,030 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,030 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,030 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,030 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:28,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:28,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,032 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-26 02:48:28,032 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-26 02:48:28,032 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((\valid[temp] == 1 && !(head == #memory_$Pointer$[head][4])) && temp == 0) && \valid[head] == 1) && \valid[\result] == 1) && !(s == #memory_$Pointer$[s][4])) && s == 0) && \result == 0) && 2 == len) && head == 0) && !(\result == #memory_$Pointer$[\result][4])) && \result == 0) && len == i + 1) || ((((((((((((((((\valid[temp] == 1 && temp == 0) && len <= unknown-#memory_int-unknown[s][s]) && index + 2 <= len) && \valid[head] == 1) && i + 2 <= len) && 2 + unknown-#memory_int-unknown[s][s] <= 2 * len) && \valid[\result] == 1) && s == 0) && s == head) && \result == 0) && !(#memory_$Pointer$[s][s + 4] == s)) && 2 == len) && s == head) && data + 2 <= 2 * len) && len <= data) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1)) || (((((((((((((((\valid[temp] == 1 && head == #memory_$Pointer$[s][4]) && temp == 0) && index + 2 <= len) && \valid[head] == 1) && data + 1 <= 2 * len) && \valid[\result] == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] + 1 <= 2 * len) && !(s == #memory_$Pointer$[s][4])) && 2 * len <= data + 1) && s == 0) && \result == 0) && 2 == len) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] + 1) && #memory_$Pointer$[s][4] == head) && i + 2 == len) RESULT: Ultimate proved your program to be correct! [2021-08-26 02:48:28,060 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...