./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf 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/dll2n_update_all.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ff1c7523090f73a9df023efb85afad63615b4167 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-29 09:49:06,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-29 09:49:06,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-29 09:49:07,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-29 09:49:07,030 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-29 09:49:07,030 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-29 09:49:07,031 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-29 09:49:07,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-29 09:49:07,038 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-29 09:49:07,042 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-29 09:49:07,043 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-29 09:49:07,046 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-29 09:49:07,046 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-29 09:49:07,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-29 09:49:07,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-29 09:49:07,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-29 09:49:07,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-29 09:49:07,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-29 09:49:07,056 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-29 09:49:07,060 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-29 09:49:07,061 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-29 09:49:07,062 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-29 09:49:07,064 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-29 09:49:07,064 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-29 09:49:07,069 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-29 09:49:07,069 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-29 09:49:07,070 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-29 09:49:07,071 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-29 09:49:07,071 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-29 09:49:07,072 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-29 09:49:07,072 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-29 09:49:07,073 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-29 09:49:07,074 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-29 09:49:07,074 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-29 09:49:07,075 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-29 09:49:07,076 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-29 09:49:07,076 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-29 09:49:07,076 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-29 09:49:07,077 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-29 09:49:07,078 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-29 09:49:07,078 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-29 09:49:07,079 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-29 09:49:07,111 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-29 09:49:07,111 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-29 09:49:07,112 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-29 09:49:07,112 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-29 09:49:07,114 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-29 09:49:07,114 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-29 09:49:07,114 INFO L138 SettingsManager]: * Use SBE=true [2021-08-29 09:49:07,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-29 09:49:07,115 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-29 09:49:07,115 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-29 09:49:07,115 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-29 09:49:07,116 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-29 09:49:07,116 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-29 09:49:07,116 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-29 09:49:07,116 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-29 09:49:07,116 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-29 09:49:07,116 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-29 09:49:07,117 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-29 09:49:07,117 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-29 09:49:07,117 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-29 09:49:07,117 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-29 09:49:07,117 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-29 09:49:07,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 09:49:07,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-29 09:49:07,118 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-29 09:49:07,118 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-29 09:49:07,118 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-29 09:49:07,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-29 09:49:07,118 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-29 09:49:07,119 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-29 09:49:07,119 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 -> ff1c7523090f73a9df023efb85afad63615b4167 [2021-08-29 09:49:07,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-29 09:49:07,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-29 09:49:07,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-29 09:49:07,431 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-29 09:49:07,431 INFO L275 PluginConnector]: CDTParser initialized [2021-08-29 09:49:07,433 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_update_all.i [2021-08-29 09:49:07,485 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67654ad0a/4da19aec822942e0a70ce3cf761bfbe3/FLAG6b485f9b9 [2021-08-29 09:49:07,885 INFO L306 CDTParser]: Found 1 translation units. [2021-08-29 09:49:07,886 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all.i [2021-08-29 09:49:07,896 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67654ad0a/4da19aec822942e0a70ce3cf761bfbe3/FLAG6b485f9b9 [2021-08-29 09:49:08,290 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67654ad0a/4da19aec822942e0a70ce3cf761bfbe3 [2021-08-29 09:49:08,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-29 09:49:08,294 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-29 09:49:08,296 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-29 09:49:08,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-29 09:49:08,299 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-29 09:49:08,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 09:49:08" (1/1) ... [2021-08-29 09:49:08,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b05c3b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:49:08, skipping insertion in model container [2021-08-29 09:49:08,300 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 09:49:08" (1/1) ... [2021-08-29 09:49:08,305 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-29 09:49:08,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-29 09:49:08,571 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/dll2n_update_all.i[24455,24468] [2021-08-29 09:49:08,575 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 09:49:08,583 INFO L203 MainTranslator]: Completed pre-run [2021-08-29 09:49:08,619 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/dll2n_update_all.i[24455,24468] [2021-08-29 09:49:08,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 09:49:08,640 INFO L208 MainTranslator]: Completed translation [2021-08-29 09:49:08,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:49:08 WrapperNode [2021-08-29 09:49:08,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-29 09:49:08,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-29 09:49:08,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-29 09:49:08,643 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-29 09:49:08,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:49:08" (1/1) ... [2021-08-29 09:49:08,680 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:49:08" (1/1) ... [2021-08-29 09:49:08,698 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-29 09:49:08,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-29 09:49:08,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-29 09:49:08,700 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-29 09:49:08,706 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:49:08" (1/1) ... [2021-08-29 09:49:08,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:49:08" (1/1) ... [2021-08-29 09:49:08,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:49:08" (1/1) ... [2021-08-29 09:49:08,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:49:08" (1/1) ... [2021-08-29 09:49:08,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:49:08" (1/1) ... [2021-08-29 09:49:08,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:49:08" (1/1) ... [2021-08-29 09:49:08,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:49:08" (1/1) ... [2021-08-29 09:49:08,743 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-29 09:49:08,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-29 09:49:08,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-29 09:49:08,746 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-29 09:49:08,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:49:08" (1/1) ... [2021-08-29 09:49:08,752 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 09:49:08,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 09:49:08,773 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-29 09:49:08,793 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-29 09:49:08,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-29 09:49:08,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-29 09:49:08,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-29 09:49:08,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-29 09:49:08,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-29 09:49:08,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-29 09:49:08,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-29 09:49:08,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-29 09:49:08,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-29 09:49:08,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-29 09:49:09,009 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-29 09:49:09,009 INFO L299 CfgBuilder]: Removed 20 assume(true) statements. [2021-08-29 09:49:09,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 09:49:09 BoogieIcfgContainer [2021-08-29 09:49:09,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-29 09:49:09,012 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-29 09:49:09,012 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-29 09:49:09,014 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-29 09:49:09,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 09:49:08" (1/3) ... [2021-08-29 09:49:09,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589c9e31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 09:49:09, skipping insertion in model container [2021-08-29 09:49:09,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:49:08" (2/3) ... [2021-08-29 09:49:09,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589c9e31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 09:49:09, skipping insertion in model container [2021-08-29 09:49:09,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 09:49:09" (3/3) ... [2021-08-29 09:49:09,016 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.i [2021-08-29 09:49:09,019 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-29 09:49:09,019 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-29 09:49:09,051 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-29 09:49:09,055 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-29 09:49:09,055 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-29 09:49:09,065 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 09:49:09,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-29 09:49:09,068 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 09:49:09,069 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 09:49:09,069 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 09:49:09,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 09:49:09,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1608020802, now seen corresponding path program 1 times [2021-08-29 09:49:09,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 09:49:09,079 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125843302] [2021-08-29 09:49:09,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 09:49:09,079 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 09:49:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 09:49:09,209 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-29 09:49:09,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 09:49:09,210 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125843302] [2021-08-29 09:49:09,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125843302] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 09:49:09,210 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 09:49:09,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 09:49:09,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688817768] [2021-08-29 09:49:09,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 09:49:09,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 09:49:09,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 09:49:09,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 09:49:09,238 INFO L87 Difference]: Start difference. First operand has 29 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 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-29 09:49:09,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 09:49:09,334 INFO L93 Difference]: Finished difference Result 56 states and 84 transitions. [2021-08-29 09:49:09,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 09:49:09,337 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-29 09:49:09,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 09:49:09,342 INFO L225 Difference]: With dead ends: 56 [2021-08-29 09:49:09,342 INFO L226 Difference]: Without dead ends: 27 [2021-08-29 09:49:09,344 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.50ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 09:49:09,346 INFO L928 BasicCegarLoop]: 1 mSDtfsCounter, 7 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.94ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 79.46ms IncrementalHoareTripleChecker+Time [2021-08-29 09:49:09,347 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 2 Invalid, 69 Unknown, 0 Unchecked, 0.94ms Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 79.46ms Time] [2021-08-29 09:49:09,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-08-29 09:49:09,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2021-08-29 09:49:09,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 09:49:09,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2021-08-29 09:49:09,368 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 13 [2021-08-29 09:49:09,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 09:49:09,369 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2021-08-29 09:49:09,369 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-29 09:49:09,369 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2021-08-29 09:49:09,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-29 09:49:09,369 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 09:49:09,369 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 09:49:09,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-29 09:49:09,370 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 09:49:09,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 09:49:09,370 INFO L82 PathProgramCache]: Analyzing trace with hash -780239213, now seen corresponding path program 1 times [2021-08-29 09:49:09,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 09:49:09,370 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574898866] [2021-08-29 09:49:09,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 09:49:09,371 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 09:49:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 09:49:09,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 09:49:09,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 09:49:09,431 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574898866] [2021-08-29 09:49:09,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574898866] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 09:49:09,431 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 09:49:09,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 09:49:09,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368933024] [2021-08-29 09:49:09,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 09:49:09,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 09:49:09,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 09:49:09,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 09:49:09,433 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-29 09:49:09,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 09:49:09,485 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2021-08-29 09:49:09,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 09:49:09,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-29 09:49:09,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 09:49:09,486 INFO L225 Difference]: With dead ends: 47 [2021-08-29 09:49:09,486 INFO L226 Difference]: Without dead ends: 27 [2021-08-29 09:49:09,487 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.93ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 09:49:09,488 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.36ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.79ms IncrementalHoareTripleChecker+Time [2021-08-29 09:49:09,488 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 53 Unknown, 0 Unchecked, 0.36ms Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 47.79ms Time] [2021-08-29 09:49:09,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-08-29 09:49:09,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2021-08-29 09:49:09,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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-29 09:49:09,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2021-08-29 09:49:09,491 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 18 [2021-08-29 09:49:09,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 09:49:09,491 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2021-08-29 09:49:09,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-29 09:49:09,491 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2021-08-29 09:49:09,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-29 09:49:09,492 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 09:49:09,492 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 09:49:09,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-29 09:49:09,492 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 09:49:09,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 09:49:09,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1367045227, now seen corresponding path program 1 times [2021-08-29 09:49:09,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 09:49:09,493 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720108459] [2021-08-29 09:49:09,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 09:49:09,493 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 09:49:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 09:49:09,549 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-29 09:49:09,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 09:49:09,550 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720108459] [2021-08-29 09:49:09,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720108459] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 09:49:09,550 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620137068] [2021-08-29 09:49:09,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 09:49:09,550 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 09:49:09,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 09:49:09,551 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-29 09:49:09,565 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-29 09:49:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 09:49:09,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-29 09:49:09,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 09:49:09,738 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-29 09:49:09,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 09:49:09,806 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-29 09:49:09,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620137068] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 09:49:09,807 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 09:49:09,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-08-29 09:49:09,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558427905] [2021-08-29 09:49:09,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 09:49:09,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 09:49:09,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 09:49:09,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-29 09:49:09,809 INFO L87 Difference]: Start difference. First operand 26 states and 31 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-29 09:49:09,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 09:49:09,850 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2021-08-29 09:49:09,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 09:49:09,851 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-29 09:49:09,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 09:49:09,851 INFO L225 Difference]: With dead ends: 43 [2021-08-29 09:49:09,851 INFO L226 Difference]: Without dead ends: 28 [2021-08-29 09:49:09,852 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 11.46ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-29 09:49:09,852 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.50ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.45ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.78ms IncrementalHoareTripleChecker+Time [2021-08-29 09:49:09,853 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 56 Unknown, 0 Unchecked, 0.45ms Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 34.78ms Time] [2021-08-29 09:49:09,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-08-29 09:49:09,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-08-29 09:49:09,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 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-29 09:49:09,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2021-08-29 09:49:09,856 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2021-08-29 09:49:09,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 09:49:09,856 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-08-29 09:49:09,862 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-29 09:49:09,863 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2021-08-29 09:49:09,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-29 09:49:09,863 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 09:49:09,863 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 09:49:09,884 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-29 09:49:10,073 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-29 09:49:10,073 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 09:49:10,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 09:49:10,074 INFO L82 PathProgramCache]: Analyzing trace with hash 980561436, now seen corresponding path program 1 times [2021-08-29 09:49:10,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 09:49:10,074 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957932299] [2021-08-29 09:49:10,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 09:49:10,074 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 09:49:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 09:49:10,136 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-29 09:49:10,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 09:49:10,136 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957932299] [2021-08-29 09:49:10,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957932299] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 09:49:10,136 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 09:49:10,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 09:49:10,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509815476] [2021-08-29 09:49:10,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 09:49:10,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 09:49:10,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 09:49:10,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-29 09:49:10,138 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-29 09:49:10,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 09:49:10,182 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2021-08-29 09:49:10,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 09:49:10,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-29 09:49:10,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 09:49:10,183 INFO L225 Difference]: With dead ends: 49 [2021-08-29 09:49:10,183 INFO L226 Difference]: Without dead ends: 40 [2021-08-29 09:49:10,183 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.29ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-29 09:49:10,184 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.53ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.76ms IncrementalHoareTripleChecker+Time [2021-08-29 09:49:10,184 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 56 Unknown, 0 Unchecked, 0.53ms Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 37.76ms Time] [2021-08-29 09:49:10,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-08-29 09:49:10,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 29. [2021-08-29 09:49:10,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 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-29 09:49:10,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2021-08-29 09:49:10,194 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 23 [2021-08-29 09:49:10,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 09:49:10,194 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2021-08-29 09:49:10,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-29 09:49:10,194 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2021-08-29 09:49:10,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-29 09:49:10,195 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 09:49:10,195 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 09:49:10,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-29 09:49:10,195 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 09:49:10,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 09:49:10,195 INFO L82 PathProgramCache]: Analyzing trace with hash 363329286, now seen corresponding path program 1 times [2021-08-29 09:49:10,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 09:49:10,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689904343] [2021-08-29 09:49:10,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 09:49:10,196 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 09:49:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 09:49:10,301 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-29 09:49:10,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 09:49:10,303 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689904343] [2021-08-29 09:49:10,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689904343] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 09:49:10,303 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565145295] [2021-08-29 09:49:10,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 09:49:10,303 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 09:49:10,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 09:49:10,313 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-29 09:49:10,314 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-29 09:49:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 09:49:10,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-29 09:49:10,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 09:49:10,531 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-29 09:49:10,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 09:49:10,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-29 09:49:10,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565145295] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 09:49:10,596 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 09:49:10,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2021-08-29 09:49:10,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551222385] [2021-08-29 09:49:10,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-29 09:49:10,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 09:49:10,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-29 09:49:10,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-08-29 09:49:10,601 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 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-29 09:49:10,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 09:49:10,698 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2021-08-29 09:49:10,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 09:49:10,699 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 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) Word has length 27 [2021-08-29 09:49:10,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 09:49:10,700 INFO L225 Difference]: With dead ends: 51 [2021-08-29 09:49:10,701 INFO L226 Difference]: Without dead ends: 42 [2021-08-29 09:49:10,707 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 52.32ms TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-08-29 09:49:10,708 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 44 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.48ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 79.66ms IncrementalHoareTripleChecker+Time [2021-08-29 09:49:10,708 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 0 Invalid, 105 Unknown, 0 Unchecked, 2.48ms Time], IncrementalHoareTripleChecker [13 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 79.66ms Time] [2021-08-29 09:49:10,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-08-29 09:49:10,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2021-08-29 09:49:10,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.21875) internal successors, (39), 32 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-29 09:49:10,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2021-08-29 09:49:10,711 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 27 [2021-08-29 09:49:10,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 09:49:10,712 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2021-08-29 09:49:10,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 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-29 09:49:10,712 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2021-08-29 09:49:10,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-29 09:49:10,713 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 09:49:10,713 INFO L513 BasicCegarLoop]: trace histogram [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-29 09:49:10,734 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-29 09:49:10,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 09:49:10,925 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 09:49:10,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 09:49:10,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1570454256, now seen corresponding path program 2 times [2021-08-29 09:49:10,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 09:49:10,926 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261071043] [2021-08-29 09:49:10,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 09:49:10,926 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 09:49:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 09:49:10,968 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-29 09:49:10,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 09:49:10,969 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261071043] [2021-08-29 09:49:10,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261071043] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 09:49:10,969 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956330410] [2021-08-29 09:49:10,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-29 09:49:10,970 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 09:49:10,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 09:49:10,977 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-29 09:49:10,985 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-29 09:49:11,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-29 09:49:11,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 09:49:11,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-29 09:49:11,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 09:49:11,119 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-29 09:49:11,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 09:49:11,167 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-29 09:49:11,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956330410] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 09:49:11,167 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 09:49:11,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2021-08-29 09:49:11,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778845600] [2021-08-29 09:49:11,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-29 09:49:11,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 09:49:11,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-29 09:49:11,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-08-29 09:49:11,177 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 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-29 09:49:11,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 09:49:11,253 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2021-08-29 09:49:11,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 09:49:11,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 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) Word has length 31 [2021-08-29 09:49:11,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 09:49:11,254 INFO L225 Difference]: With dead ends: 55 [2021-08-29 09:49:11,255 INFO L226 Difference]: Without dead ends: 42 [2021-08-29 09:49:11,255 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 15.37ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-08-29 09:49:11,259 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 22 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.64ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 63.11ms IncrementalHoareTripleChecker+Time [2021-08-29 09:49:11,259 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 0 Invalid, 148 Unknown, 0 Unchecked, 2.64ms Time], IncrementalHoareTripleChecker [6 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 63.11ms Time] [2021-08-29 09:49:11,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-08-29 09:49:11,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2021-08-29 09:49:11,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 09:49:11,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2021-08-29 09:49:11,269 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 31 [2021-08-29 09:49:11,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 09:49:11,269 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2021-08-29 09:49:11,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 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-29 09:49:11,270 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2021-08-29 09:49:11,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-29 09:49:11,271 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 09:49:11,271 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 09:49:11,292 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-29 09:49:11,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 09:49:11,474 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 09:49:11,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 09:49:11,474 INFO L82 PathProgramCache]: Analyzing trace with hash -688680177, now seen corresponding path program 1 times [2021-08-29 09:49:11,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 09:49:11,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624511607] [2021-08-29 09:49:11,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 09:49:11,479 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 09:49:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 09:49:11,831 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 09:49:11,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 09:49:11,832 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624511607] [2021-08-29 09:49:11,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624511607] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 09:49:11,832 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044611215] [2021-08-29 09:49:11,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 09:49:11,832 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 09:49:11,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 09:49:11,833 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-29 09:49:11,835 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-29 09:49:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 09:49:11,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 69 conjunts are in the unsatisfiable core [2021-08-29 09:49:11,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 09:49:11,936 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-29 09:49:11,996 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-29 09:49:11,997 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-29 09:49:12,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 09:49:12,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2021-08-29 09:49:12,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-29 09:49:12,087 INFO L354 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2021-08-29 09:49:12,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 38 [2021-08-29 09:49:12,421 INFO L354 Elim1Store]: treesize reduction 63, result has 12.5 percent of original size [2021-08-29 09:49:12,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 37 [2021-08-29 09:49:12,430 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 11 treesize of output 7 [2021-08-29 09:49:12,554 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-29 09:49:12,557 INFO L354 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2021-08-29 09:49:12,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 17 [2021-08-29 09:49:12,620 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-29 09:49:12,621 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 23 treesize of output 22 [2021-08-29 09:49:12,749 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-29 09:49:12,801 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 09:49:12,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 09:49:13,513 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_dll_update_at_~data Int) (ULTIMATE.start_dll_update_at_~head.offset Int)) (<= (select (select (store |c_#memory_int| c_ULTIMATE.start_dll_update_at_~head.base (store (select |c_#memory_int| c_ULTIMATE.start_dll_update_at_~head.base) ULTIMATE.start_dll_update_at_~head.offset ULTIMATE.start_dll_update_at_~data)) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset) c_ULTIMATE.start_main_~len~0)) (forall ((ULTIMATE.start_dll_update_at_~data Int) (ULTIMATE.start_dll_update_at_~head.offset Int)) (<= c_ULTIMATE.start_main_~len~0 (select (select (store |c_#memory_int| c_ULTIMATE.start_dll_update_at_~head.base (store (select |c_#memory_int| c_ULTIMATE.start_dll_update_at_~head.base) ULTIMATE.start_dll_update_at_~head.offset ULTIMATE.start_dll_update_at_~data)) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset)))) is different from false [2021-08-29 09:49:14,257 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_dll_update_at_~data Int) (v_subst_2 Int)) (<= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_dll_update_at_~head.base) (+ c_ULTIMATE.start_dll_update_at_~head.offset 4)))) (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) v_subst_2 ULTIMATE.start_dll_update_at_~data))) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset) c_ULTIMATE.start_main_~len~0)) (forall ((ULTIMATE.start_dll_update_at_~data Int) (v_subst_1 Int)) (<= c_ULTIMATE.start_main_~len~0 (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_dll_update_at_~head.base) (+ c_ULTIMATE.start_dll_update_at_~head.offset 4)))) (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) v_subst_1 ULTIMATE.start_dll_update_at_~data))) c_ULTIMATE.start_main_~s~0.base) c_ULTIMATE.start_main_~s~0.offset)))) is different from false [2021-08-29 09:49:21,049 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-29 09:49:21,050 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-29 09:49:21,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2021-08-29 09:49:21,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356738474] [2021-08-29 09:49:21,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-29 09:49:21,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 09:49:21,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-29 09:49:21,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1419, Unknown=6, NotChecked=154, Total=1722 [2021-08-29 09:49:21,051 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 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-29 09:49:21,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 09:49:21,963 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2021-08-29 09:49:21,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-08-29 09:49:21,980 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 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) Word has length 32 [2021-08-29 09:49:21,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 09:49:21,981 INFO L225 Difference]: With dead ends: 77 [2021-08-29 09:49:21,981 INFO L226 Difference]: Without dead ends: 75 [2021-08-29 09:49:21,982 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1021 ImplicationChecksByTransitivity, 9305.07ms TimeCoverageRelationStatistics Valid=403, Invalid=3259, Unknown=6, NotChecked=238, Total=3906 [2021-08-29 09:49:21,982 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 152 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 286.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.71ms SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 349.00ms IncrementalHoareTripleChecker+Time [2021-08-29 09:49:21,982 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 0 Invalid, 709 Unknown, 0 Unchecked, 4.71ms Time], IncrementalHoareTripleChecker [76 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 349.00ms Time] [2021-08-29 09:49:21,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-08-29 09:49:21,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 49. [2021-08-29 09:49:21,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 09:49:21,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2021-08-29 09:49:21,987 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 32 [2021-08-29 09:49:21,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 09:49:21,988 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2021-08-29 09:49:21,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 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-29 09:49:21,988 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2021-08-29 09:49:21,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-29 09:49:21,988 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 09:49:21,988 INFO L513 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-29 09:49:22,008 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-29 09:49:22,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 09:49:22,206 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 09:49:22,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 09:49:22,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1908545476, now seen corresponding path program 2 times [2021-08-29 09:49:22,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 09:49:22,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334447176] [2021-08-29 09:49:22,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 09:49:22,207 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 09:49:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 09:49:22,243 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-08-29 09:49:22,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 09:49:22,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334447176] [2021-08-29 09:49:22,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334447176] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 09:49:22,244 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 09:49:22,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 09:49:22,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609923458] [2021-08-29 09:49:22,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 09:49:22,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 09:49:22,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 09:49:22,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 09:49:22,245 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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-29 09:49:22,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 09:49:22,297 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2021-08-29 09:49:22,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 09:49:22,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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) Word has length 33 [2021-08-29 09:49:22,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 09:49:22,300 INFO L225 Difference]: With dead ends: 71 [2021-08-29 09:49:22,300 INFO L226 Difference]: Without dead ends: 53 [2021-08-29 09:49:22,300 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.87ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 09:49:22,301 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.61ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.68ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.10ms IncrementalHoareTripleChecker+Time [2021-08-29 09:49:22,301 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 82 Unknown, 0 Unchecked, 0.68ms Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 40.10ms Time] [2021-08-29 09:49:22,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-08-29 09:49:22,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2021-08-29 09:49:22,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 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-29 09:49:22,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2021-08-29 09:49:22,315 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 33 [2021-08-29 09:49:22,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 09:49:22,315 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2021-08-29 09:49:22,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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-29 09:49:22,315 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2021-08-29 09:49:22,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-29 09:49:22,319 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 09:49:22,319 INFO L513 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-29 09:49:22,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-29 09:49:22,319 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 09:49:22,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 09:49:22,320 INFO L82 PathProgramCache]: Analyzing trace with hash -2002370864, now seen corresponding path program 3 times [2021-08-29 09:49:22,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 09:49:22,320 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728551857] [2021-08-29 09:49:22,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 09:49:22,320 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 09:49:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 09:49:22,372 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-29 09:49:22,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 09:49:22,372 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728551857] [2021-08-29 09:49:22,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728551857] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 09:49:22,373 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015789632] [2021-08-29 09:49:22,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-29 09:49:22,373 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 09:49:22,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 09:49:22,381 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-29 09:49:22,382 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-29 09:49:22,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-08-29 09:49:22,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 09:49:22,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-29 09:49:22,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 09:49:22,551 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-29 09:49:22,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 09:49:22,595 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-29 09:49:22,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015789632] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 09:49:22,595 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 09:49:22,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2021-08-29 09:49:22,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495907101] [2021-08-29 09:49:22,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-29 09:49:22,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 09:49:22,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-29 09:49:22,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-29 09:49:22,598 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-29 09:49:22,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 09:49:22,679 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2021-08-29 09:49:22,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-29 09:49:22,679 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-29 09:49:22,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 09:49:22,680 INFO L225 Difference]: With dead ends: 75 [2021-08-29 09:49:22,680 INFO L226 Difference]: Without dead ends: 61 [2021-08-29 09:49:22,680 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 27.15ms TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-08-29 09:49:22,681 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 64 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.55ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 60.44ms IncrementalHoareTripleChecker+Time [2021-08-29 09:49:22,681 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 0 Invalid, 131 Unknown, 0 Unchecked, 0.55ms Time], IncrementalHoareTripleChecker [13 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 60.44ms Time] [2021-08-29 09:49:22,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-08-29 09:49:22,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 45. [2021-08-29 09:49:22,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 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-29 09:49:22,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2021-08-29 09:49:22,685 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 33 [2021-08-29 09:49:22,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 09:49:22,685 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2021-08-29 09:49:22,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-29 09:49:22,685 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2021-08-29 09:49:22,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-29 09:49:22,685 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 09:49:22,685 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 09:49:22,705 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-29 09:49:22,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 09:49:22,893 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 09:49:22,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 09:49:22,893 INFO L82 PathProgramCache]: Analyzing trace with hash 177405100, now seen corresponding path program 1 times [2021-08-29 09:49:22,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 09:49:22,894 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498629585] [2021-08-29 09:49:22,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 09:49:22,894 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 09:49:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 09:49:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-08-29 09:49:22,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 09:49:22,937 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498629585] [2021-08-29 09:49:22,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498629585] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 09:49:22,937 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 09:49:22,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 09:49:22,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138204611] [2021-08-29 09:49:22,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 09:49:22,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 09:49:22,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 09:49:22,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 09:49:22,939 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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-29 09:49:22,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 09:49:22,984 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2021-08-29 09:49:22,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 09:49:22,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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 33 [2021-08-29 09:49:22,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 09:49:22,986 INFO L225 Difference]: With dead ends: 62 [2021-08-29 09:49:22,986 INFO L226 Difference]: Without dead ends: 54 [2021-08-29 09:49:22,986 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.46ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 09:49:22,987 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.31ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.67ms IncrementalHoareTripleChecker+Time [2021-08-29 09:49:22,988 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 82 Unknown, 0 Unchecked, 0.31ms Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 35.67ms Time] [2021-08-29 09:49:22,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-08-29 09:49:22,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2021-08-29 09:49:22,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 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-29 09:49:22,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2021-08-29 09:49:22,999 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 33 [2021-08-29 09:49:22,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 09:49:22,999 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2021-08-29 09:49:22,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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-29 09:49:22,999 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2021-08-29 09:49:23,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-29 09:49:23,000 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 09:49:23,000 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 09:49:23,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-29 09:49:23,001 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 09:49:23,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 09:49:23,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1877284006, now seen corresponding path program 4 times [2021-08-29 09:49:23,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 09:49:23,002 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137790589] [2021-08-29 09:49:23,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 09:49:23,002 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 09:49:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 09:49:23,067 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-29 09:49:23,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 09:49:23,067 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137790589] [2021-08-29 09:49:23,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137790589] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 09:49:23,067 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444662195] [2021-08-29 09:49:23,067 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-29 09:49:23,067 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 09:49:23,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 09:49:23,069 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-29 09:49:23,071 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-29 09:49:23,126 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-29 09:49:23,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 09:49:23,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-29 09:49:23,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 09:49:23,210 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-29 09:49:23,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-29 09:49:23,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444662195] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 09:49:23,210 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-29 09:49:23,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2021-08-29 09:49:23,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965073632] [2021-08-29 09:49:23,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-29 09:49:23,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 09:49:23,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-29 09:49:23,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2021-08-29 09:49:23,211 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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-29 09:49:23,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 09:49:23,261 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2021-08-29 09:49:23,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-29 09:49:23,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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) Word has length 37 [2021-08-29 09:49:23,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 09:49:23,262 INFO L225 Difference]: With dead ends: 57 [2021-08-29 09:49:23,262 INFO L226 Difference]: Without dead ends: 39 [2021-08-29 09:49:23,263 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 40.36ms TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2021-08-29 09:49:23,263 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.39ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.01ms IncrementalHoareTripleChecker+Time [2021-08-29 09:49:23,263 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 89 Unknown, 0 Unchecked, 0.39ms Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 44.01ms Time] [2021-08-29 09:49:23,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-08-29 09:49:23,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-08-29 09:49:23,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 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-29 09:49:23,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2021-08-29 09:49:23,266 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 37 [2021-08-29 09:49:23,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 09:49:23,266 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2021-08-29 09:49:23,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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-29 09:49:23,266 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2021-08-29 09:49:23,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-29 09:49:23,267 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 09:49:23,267 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 09:49:23,286 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-29 09:49:23,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 09:49:23,487 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 09:49:23,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 09:49:23,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1026769210, now seen corresponding path program 1 times [2021-08-29 09:49:23,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 09:49:23,487 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888368318] [2021-08-29 09:49:23,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 09:49:23,487 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 09:49:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 09:49:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-08-29 09:49:23,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 09:49:23,525 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888368318] [2021-08-29 09:49:23,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888368318] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 09:49:23,525 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110656407] [2021-08-29 09:49:23,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 09:49:23,525 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 09:49:23,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 09:49:23,526 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 09:49:23,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-29 09:49:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 09:49:23,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-29 09:49:23,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 09:49:23,638 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-08-29 09:49:23,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 09:49:23,680 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-08-29 09:49:23,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110656407] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 09:49:23,681 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 09:49:23,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2021-08-29 09:49:23,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702044705] [2021-08-29 09:49:23,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-29 09:49:23,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 09:49:23,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-29 09:49:23,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-29 09:49:23,682 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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-29 09:49:23,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 09:49:23,732 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2021-08-29 09:49:23,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 09:49:23,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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 38 [2021-08-29 09:49:23,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 09:49:23,732 INFO L225 Difference]: With dead ends: 45 [2021-08-29 09:49:23,733 INFO L226 Difference]: Without dead ends: 40 [2021-08-29 09:49:23,733 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 12.29ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-08-29 09:49:23,733 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 26 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.45ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.97ms IncrementalHoareTripleChecker+Time [2021-08-29 09:49:23,733 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 0 Invalid, 113 Unknown, 0 Unchecked, 0.45ms Time], IncrementalHoareTripleChecker [9 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 41.97ms Time] [2021-08-29 09:49:23,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-08-29 09:49:23,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-08-29 09:49:23,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 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-29 09:49:23,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2021-08-29 09:49:23,736 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 38 [2021-08-29 09:49:23,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 09:49:23,737 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2021-08-29 09:49:23,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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-29 09:49:23,737 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2021-08-29 09:49:23,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-29 09:49:23,737 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 09:49:23,737 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 09:49:23,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-29 09:49:23,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 09:49:23,938 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 09:49:23,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 09:49:23,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1816728545, now seen corresponding path program 1 times [2021-08-29 09:49:23,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 09:49:23,939 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892977759] [2021-08-29 09:49:23,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 09:49:23,939 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 09:49:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 09:49:24,375 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 09:49:24,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 09:49:24,375 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892977759] [2021-08-29 09:49:24,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892977759] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 09:49:24,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219288352] [2021-08-29 09:49:24,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 09:49:24,376 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 09:49:24,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 09:49:24,384 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 09:49:24,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-29 09:49:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 09:49:24,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 74 conjunts are in the unsatisfiable core [2021-08-29 09:49:24,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 09:49:24,471 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-29 09:49:24,502 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-29 09:49:24,502 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-29 09:49:24,537 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-29 09:49:24,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-08-29 09:49:24,594 INFO L354 Elim1Store]: treesize reduction 80, result has 19.2 percent of original size [2021-08-29 09:49:24,595 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 38 [2021-08-29 09:49:24,865 INFO L354 Elim1Store]: treesize reduction 130, result has 17.7 percent of original size [2021-08-29 09:49:24,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 44 [2021-08-29 09:49:25,127 INFO L354 Elim1Store]: treesize reduction 180, result has 18.2 percent of original size [2021-08-29 09:49:25,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 122 [2021-08-29 09:49:25,132 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 123 treesize of output 113 [2021-08-29 09:49:25,143 INFO L354 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2021-08-29 09:49:25,144 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 113 treesize of output 91 [2021-08-29 09:49:25,388 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-29 09:49:25,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 33 [2021-08-29 09:49:25,391 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 27 treesize of output 15 [2021-08-29 09:49:25,417 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-29 09:49:25,450 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 09:49:25,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 09:49:25,687 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 170 treesize of output 138 [2021-08-29 09:49:25,826 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-29 09:49:25,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 55 [2021-08-29 09:49:25,863 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 41 treesize of output 35 [2021-08-29 09:49:26,316 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_dll_update_at_~head.offset_19 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_dll_update_at_~head.offset_19) (and (<= 0 c_ULTIMATE.start_main_~i~0) (forall ((v_DerPreprocessor_3 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_dll_update_at_~head.offset_19 v_DerPreprocessor_3) (+ c_ULTIMATE.start_main_~s~0.offset 4)) c_ULTIMATE.start_main_~s~0.base))) (<= c_ULTIMATE.start_main_~i~0 0)))) is different from false [2021-08-29 09:49:26,580 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_dll_update_at_~head.offset_19 Int)) (or (forall ((v_DerPreprocessor_3 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res.base|) v_ULTIMATE.start_dll_update_at_~head.offset_19 v_DerPreprocessor_3) (+ |c_ULTIMATE.start_dll_create_#res.offset| 4)) |c_ULTIMATE.start_dll_create_#res.base|))) (< |c_ULTIMATE.start_dll_create_#res.offset| v_ULTIMATE.start_dll_update_at_~head.offset_19))) is different from false [2021-08-29 09:49:26,854 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_3 Int) (v_ULTIMATE.start_dll_update_at_~head.offset_19 Int)) (or (not (= c_ULTIMATE.start_dll_create_~head~0.base (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_dll_create_~head~0.base) v_ULTIMATE.start_dll_update_at_~head.offset_19 v_DerPreprocessor_3) (+ c_ULTIMATE.start_dll_create_~head~0.offset 4)))) (< c_ULTIMATE.start_dll_create_~head~0.offset v_ULTIMATE.start_dll_update_at_~head.offset_19))) is different from false [2021-08-29 09:49:27,134 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_3 Int) (v_ULTIMATE.start_dll_update_at_~head.offset_19 Int)) (or (not (= c_ULTIMATE.start_dll_create_~new_head~0.base (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_dll_create_~new_head~0.base) v_ULTIMATE.start_dll_update_at_~head.offset_19 v_DerPreprocessor_3) (+ c_ULTIMATE.start_dll_create_~new_head~0.offset 4)))) (< c_ULTIMATE.start_dll_create_~new_head~0.offset v_ULTIMATE.start_dll_update_at_~head.offset_19))) is different from false [2021-08-29 09:49:42,938 INFO L354 Elim1Store]: treesize reduction 104, result has 25.7 percent of original size [2021-08-29 09:49:42,938 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 52 [2021-08-29 09:49:42,944 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-29 09:49:42,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 48 [2021-08-29 09:49:42,955 INFO L354 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2021-08-29 09:49:42,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 51 [2021-08-29 09:49:43,033 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-08-29 09:49:43,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219288352] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 09:49:43,034 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 09:49:43,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 22] total 53 [2021-08-29 09:49:43,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34882915] [2021-08-29 09:49:43,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2021-08-29 09:49:43,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 09:49:43,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-08-29 09:49:43,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2174, Unknown=42, NotChecked=388, Total=2756 [2021-08-29 09:49:43,036 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 53 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 53 states have internal predecessors, (102), 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-29 09:49:43,601 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_dll_create_~new_head~0.base)) (.cse0 (+ c_ULTIMATE.start_dll_create_~new_head~0.offset 4))) (let ((.cse2 (select .cse1 .cse0))) (and (= (select |c_#valid| c_ULTIMATE.start_dll_create_~head~0.base) 1) (not (= c_ULTIMATE.start_dll_create_~new_head~0.base (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_dll_create_~head~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_dll_create_~head~0.base) (+ 8 c_ULTIMATE.start_dll_create_~head~0.offset) c_ULTIMATE.start_dll_create_~new_head~0.base)) c_ULTIMATE.start_dll_create_~new_head~0.base) .cse0))) (exists ((ULTIMATE.start_dll_create_~head~0.offset Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_dll_create_~new_head~0.base) (+ c_ULTIMATE.start_dll_create_~new_head~0.offset 4))) (+ 8 ULTIMATE.start_dll_create_~head~0.offset)) c_ULTIMATE.start_dll_create_~new_head~0.base)) (not (= c_ULTIMATE.start_dll_create_~head~0.base c_ULTIMATE.start_dll_create_~new_head~0.base)) (= (select |c_#valid| c_ULTIMATE.start_dll_create_~new_head~0.base) 1) (= (select .cse1 (+ c_ULTIMATE.start_dll_create_~new_head~0.offset 8)) 0) (forall ((v_DerPreprocessor_3 Int) (v_ULTIMATE.start_dll_update_at_~head.offset_19 Int)) (or (not (= c_ULTIMATE.start_dll_create_~new_head~0.base (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_dll_create_~new_head~0.base) v_ULTIMATE.start_dll_update_at_~head.offset_19 v_DerPreprocessor_3) (+ c_ULTIMATE.start_dll_create_~new_head~0.offset 4)))) (< c_ULTIMATE.start_dll_create_~new_head~0.offset v_ULTIMATE.start_dll_update_at_~head.offset_19))) (not (= c_ULTIMATE.start_dll_create_~new_head~0.base .cse2)) (= c_ULTIMATE.start_dll_create_~head~0.base .cse2) (= c_ULTIMATE.start_dll_create_~new_head~0.offset 0)))) is different from false [2021-08-29 09:49:43,895 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_dll_create_~head~0.base))) (and (= (select |c_#valid| c_ULTIMATE.start_dll_create_~head~0.base) 1) (= c_ULTIMATE.start_dll_create_~head~0.offset 0) (forall ((v_DerPreprocessor_3 Int) (v_ULTIMATE.start_dll_update_at_~head.offset_19 Int)) (or (not (= c_ULTIMATE.start_dll_create_~head~0.base (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_dll_create_~head~0.base) v_ULTIMATE.start_dll_update_at_~head.offset_19 v_DerPreprocessor_3) (+ c_ULTIMATE.start_dll_create_~head~0.offset 4)))) (< c_ULTIMATE.start_dll_create_~head~0.offset v_ULTIMATE.start_dll_update_at_~head.offset_19))) (exists ((v_ULTIMATE.start_dll_create_~head~0.offset_14 Int)) (= c_ULTIMATE.start_dll_create_~head~0.base (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_dll_create_~head~0.base) (+ c_ULTIMATE.start_dll_create_~head~0.offset 4))) (+ 8 v_ULTIMATE.start_dll_create_~head~0.offset_14)))) (not (= c_ULTIMATE.start_dll_create_~head~0.base (select .cse0 4))) (not (= c_ULTIMATE.start_dll_create_~head~0.base (select .cse0 (+ c_ULTIMATE.start_dll_create_~head~0.offset 4)))) (= (select .cse0 (+ 8 c_ULTIMATE.start_dll_create_~head~0.offset)) 0))) is different from false [2021-08-29 09:49:44,205 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_dll_create_~head~0.base))) (and (= c_ULTIMATE.start_dll_create_~head~0.offset 0) (forall ((v_DerPreprocessor_3 Int) (v_ULTIMATE.start_dll_update_at_~head.offset_19 Int)) (or (not (= c_ULTIMATE.start_dll_create_~head~0.base (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_dll_create_~head~0.base) v_ULTIMATE.start_dll_update_at_~head.offset_19 v_DerPreprocessor_3) (+ c_ULTIMATE.start_dll_create_~head~0.offset 4)))) (< c_ULTIMATE.start_dll_create_~head~0.offset v_ULTIMATE.start_dll_update_at_~head.offset_19))) (exists ((v_ULTIMATE.start_dll_create_~head~0.offset_14 Int)) (= c_ULTIMATE.start_dll_create_~head~0.base (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_dll_create_~head~0.base) (+ c_ULTIMATE.start_dll_create_~head~0.offset 4))) (+ 8 v_ULTIMATE.start_dll_create_~head~0.offset_14)))) (not (= c_ULTIMATE.start_dll_create_~head~0.base (select .cse0 4))) (not (= c_ULTIMATE.start_dll_create_~head~0.base (select .cse0 (+ c_ULTIMATE.start_dll_create_~head~0.offset 4)))) (= (select .cse0 (+ 8 c_ULTIMATE.start_dll_create_~head~0.offset)) 0))) is different from false [2021-08-29 09:49:44,545 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res.base|))) (and (= |c_ULTIMATE.start_dll_create_#res.offset| 0) (exists ((v_ULTIMATE.start_dll_create_~head~0.offset_14 Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res.base|) (+ |c_ULTIMATE.start_dll_create_#res.offset| 4))) (+ 8 v_ULTIMATE.start_dll_create_~head~0.offset_14)) |c_ULTIMATE.start_dll_create_#res.base|)) (= (select .cse0 (+ 8 |c_ULTIMATE.start_dll_create_#res.offset|)) 0) (forall ((v_ULTIMATE.start_dll_update_at_~head.offset_19 Int)) (or (forall ((v_DerPreprocessor_3 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res.base|) v_ULTIMATE.start_dll_update_at_~head.offset_19 v_DerPreprocessor_3) (+ |c_ULTIMATE.start_dll_create_#res.offset| 4)) |c_ULTIMATE.start_dll_create_#res.base|))) (< |c_ULTIMATE.start_dll_create_#res.offset| v_ULTIMATE.start_dll_update_at_~head.offset_19))) (not (= (select .cse0 4) |c_ULTIMATE.start_dll_create_#res.base|)) (not (= (select .cse0 (+ |c_ULTIMATE.start_dll_create_#res.offset| 4)) |c_ULTIMATE.start_dll_create_#res.base|)))) is different from false [2021-08-29 09:49:44,888 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base))) (and (not (= c_ULTIMATE.start_main_~s~0.base (select .cse0 4))) (forall ((v_ULTIMATE.start_dll_update_at_~head.offset_19 Int)) (or (< c_ULTIMATE.start_main_~s~0.offset v_ULTIMATE.start_dll_update_at_~head.offset_19) (and (<= 0 c_ULTIMATE.start_main_~i~0) (forall ((v_DerPreprocessor_3 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) v_ULTIMATE.start_dll_update_at_~head.offset_19 v_DerPreprocessor_3) (+ c_ULTIMATE.start_main_~s~0.offset 4)) c_ULTIMATE.start_main_~s~0.base))) (<= c_ULTIMATE.start_main_~i~0 0)))) (= c_ULTIMATE.start_main_~s~0.offset 0) (not (= (select .cse0 (+ c_ULTIMATE.start_main_~s~0.offset 4)) c_ULTIMATE.start_main_~s~0.base)) (= c_ULTIMATE.start_main_~i~0 0) (= (select .cse0 (+ c_ULTIMATE.start_main_~s~0.offset 8)) 0) (exists ((v_ULTIMATE.start_dll_create_~head~0.offset_14 Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~s~0.base) (+ c_ULTIMATE.start_main_~s~0.offset 4))) (+ 8 v_ULTIMATE.start_dll_create_~head~0.offset_14)) c_ULTIMATE.start_main_~s~0.base)))) is different from false [2021-08-29 09:49:45,413 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_dll_create_~new_head~0.base)) (.cse0 (+ c_ULTIMATE.start_dll_create_~new_head~0.offset 4))) (let ((.cse2 (select .cse1 .cse0))) (and (not (= c_ULTIMATE.start_dll_create_~new_head~0.base (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_dll_create_~head~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_dll_create_~head~0.base) (+ 8 c_ULTIMATE.start_dll_create_~head~0.offset) c_ULTIMATE.start_dll_create_~new_head~0.base)) c_ULTIMATE.start_dll_create_~new_head~0.base) .cse0))) (exists ((ULTIMATE.start_dll_create_~head~0.offset Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_dll_create_~new_head~0.base) (+ c_ULTIMATE.start_dll_create_~new_head~0.offset 4))) (+ 8 ULTIMATE.start_dll_create_~head~0.offset)) c_ULTIMATE.start_dll_create_~new_head~0.base)) (not (= c_ULTIMATE.start_dll_create_~head~0.base c_ULTIMATE.start_dll_create_~new_head~0.base)) (= (select |c_#valid| c_ULTIMATE.start_dll_create_~new_head~0.base) 1) (= (select .cse1 (+ c_ULTIMATE.start_dll_create_~new_head~0.offset 8)) 0) (forall ((v_DerPreprocessor_3 Int) (v_ULTIMATE.start_dll_update_at_~head.offset_19 Int)) (or (not (= c_ULTIMATE.start_dll_create_~new_head~0.base (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_dll_create_~new_head~0.base) v_ULTIMATE.start_dll_update_at_~head.offset_19 v_DerPreprocessor_3) (+ c_ULTIMATE.start_dll_create_~new_head~0.offset 4)))) (< c_ULTIMATE.start_dll_create_~new_head~0.offset v_ULTIMATE.start_dll_update_at_~head.offset_19))) (not (= c_ULTIMATE.start_dll_create_~new_head~0.base .cse2)) (= c_ULTIMATE.start_dll_create_~head~0.base .cse2) (= c_ULTIMATE.start_dll_create_~new_head~0.offset 0)))) is different from false [2021-08-29 09:49:45,800 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_dll_create_~new_head~0.base)) (.cse1 (+ c_ULTIMATE.start_dll_create_~new_head~0.offset 4))) (let ((.cse0 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_dll_create_~head~0.base)) (.cse3 (select .cse2 .cse1))) (and (= (select |c_#valid| c_ULTIMATE.start_dll_create_~head~0.base) 1) (not (= c_ULTIMATE.start_dll_create_~new_head~0.base (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_dll_create_~head~0.base (store .cse0 (+ 8 c_ULTIMATE.start_dll_create_~head~0.offset) c_ULTIMATE.start_dll_create_~new_head~0.base)) c_ULTIMATE.start_dll_create_~new_head~0.base) .cse1))) (exists ((ULTIMATE.start_dll_create_~head~0.offset Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_dll_create_~new_head~0.base) (+ c_ULTIMATE.start_dll_create_~new_head~0.offset 4))) (+ 8 ULTIMATE.start_dll_create_~head~0.offset)) c_ULTIMATE.start_dll_create_~new_head~0.base)) (= c_ULTIMATE.start_dll_create_~head~0.offset 0) (not (= c_ULTIMATE.start_dll_create_~head~0.base c_ULTIMATE.start_dll_create_~new_head~0.base)) (= (select |c_#valid| c_ULTIMATE.start_dll_create_~new_head~0.base) 1) (= (select .cse2 (+ c_ULTIMATE.start_dll_create_~new_head~0.offset 8)) 0) (not (= c_ULTIMATE.start_dll_create_~head~0.base (select .cse0 4))) (forall ((v_DerPreprocessor_3 Int) (v_ULTIMATE.start_dll_update_at_~head.offset_19 Int)) (or (not (= c_ULTIMATE.start_dll_create_~new_head~0.base (select (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_dll_create_~new_head~0.base) v_ULTIMATE.start_dll_update_at_~head.offset_19 v_DerPreprocessor_3) (+ c_ULTIMATE.start_dll_create_~new_head~0.offset 4)))) (< c_ULTIMATE.start_dll_create_~new_head~0.offset v_ULTIMATE.start_dll_update_at_~head.offset_19))) (not (= c_ULTIMATE.start_dll_create_~new_head~0.base .cse3)) (= c_ULTIMATE.start_dll_create_~head~0.base .cse3) (= c_ULTIMATE.start_dll_create_~new_head~0.offset 0)))) is different from false [2021-08-29 09:49:51,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 09:49:51,759 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2021-08-29 09:49:51,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-08-29 09:49:51,759 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 53 states have internal predecessors, (102), 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-29 09:49:51,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 09:49:51,760 INFO L225 Difference]: With dead ends: 89 [2021-08-29 09:49:51,760 INFO L226 Difference]: Without dead ends: 81 [2021-08-29 09:49:51,762 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 92 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1311 ImplicationChecksByTransitivity, 26054.03ms TimeCoverageRelationStatistics Valid=616, Invalid=6175, Unknown=59, NotChecked=1892, Total=8742 [2021-08-29 09:49:51,763 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 201 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 485.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.16ms SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 790 IncrementalHoareTripleChecker+Unchecked, 565.67ms IncrementalHoareTripleChecker+Time [2021-08-29 09:49:51,763 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 0 Invalid, 2059 Unknown, 0 Unchecked, 6.16ms Time], IncrementalHoareTripleChecker [78 Valid, 1191 Invalid, 0 Unknown, 790 Unchecked, 565.67ms Time] [2021-08-29 09:49:51,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-08-29 09:49:51,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 41. [2021-08-29 09:49:51,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 09:49:51,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2021-08-29 09:49:51,767 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 39 [2021-08-29 09:49:51,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 09:49:51,768 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2021-08-29 09:49:51,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 53 states have internal predecessors, (102), 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-29 09:49:51,768 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2021-08-29 09:49:51,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-29 09:49:51,768 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 09:49:51,769 INFO L513 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, 1] [2021-08-29 09:49:51,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-29 09:49:51,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-08-29 09:49:51,985 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 09:49:51,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 09:49:51,985 INFO L82 PathProgramCache]: Analyzing trace with hash 535664154, now seen corresponding path program 2 times [2021-08-29 09:49:51,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 09:49:51,986 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424150421] [2021-08-29 09:49:51,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 09:49:51,986 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 09:49:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 09:49:52,016 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-08-29 09:49:52,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 09:49:52,016 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424150421] [2021-08-29 09:49:52,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424150421] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-29 09:49:52,016 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168953091] [2021-08-29 09:49:52,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-29 09:49:52,017 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 09:49:52,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 09:49:52,029 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 09:49:52,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-29 09:49:52,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-29 09:49:52,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 09:49:52,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-29 09:49:52,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 09:49:52,157 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-29 09:49:52,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 09:49:52,220 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-29 09:49:52,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168953091] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 09:49:52,220 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-29 09:49:52,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2021-08-29 09:49:52,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72159515] [2021-08-29 09:49:52,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-29 09:49:52,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 09:49:52,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-29 09:49:52,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-29 09:49:52,222 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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-29 09:49:52,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 09:49:52,291 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2021-08-29 09:49:52,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-29 09:49:52,291 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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-29 09:49:52,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 09:49:52,292 INFO L225 Difference]: With dead ends: 41 [2021-08-29 09:49:52,292 INFO L226 Difference]: Without dead ends: 0 [2021-08-29 09:49:52,292 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 31.29ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-08-29 09:49:52,292 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.37ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.34ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.12ms IncrementalHoareTripleChecker+Time [2021-08-29 09:49:52,292 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 104 Unknown, 0 Unchecked, 0.34ms Time], IncrementalHoareTripleChecker [9 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 44.12ms Time] [2021-08-29 09:49:52,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-29 09:49:52,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-29 09:49:52,293 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-29 09:49:52,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-29 09:49:52,293 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2021-08-29 09:49:52,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 09:49:52,293 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-29 09:49:52,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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-29 09:49:52,295 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-29 09:49:52,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-29 09:49:52,297 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-08-29 09:49:52,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-08-29 09:49:52,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-08-29 09:49:52,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-29 09:49:52,503 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 09:49:52,538 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 09:49:52,569 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 09:49:52,570 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 09:49:52,570 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 09:49:52,572 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 09:49:52,585 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 09:49:52,585 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 09:49:52,611 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 09:49:52,614 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 09:49:52,614 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-29 09:49:53,648 INFO L858 garLoopResultBuilder]: For program point L589(lines 589 591) no Hoare annotation was computed. [2021-08-29 09:49:53,648 INFO L858 garLoopResultBuilder]: For program point L589-1(lines 589 591) no Hoare annotation was computed. [2021-08-29 09:49:53,648 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-29 09:49:53,648 INFO L861 garLoopResultBuilder]: At program point L573(line 573) the Hoare annotation is: true [2021-08-29 09:49:53,648 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-29 09:49:53,648 INFO L854 garLoopResultBuilder]: At program point L615(lines 610 616) the Hoare annotation is: (let ((.cse15 (select (select |#memory_int| ULTIMATE.start_dll_get_data_at_~head.base) ULTIMATE.start_dll_get_data_at_~head.offset)) (.cse5 (<= 1 ULTIMATE.start_main_~i~0))) (let ((.cse0 (= (select |#valid| ULTIMATE.start_dll_create_~head~0.base) 1)) (.cse1 (let ((.cse16 (<= ULTIMATE.start_main_~i~0 1)) (.cse17 (= 2 ULTIMATE.start_main_~len~0))) (or (and .cse16 .cse5 .cse17) (and .cse16 .cse17 (= ULTIMATE.start_main_~i~0 0))))) (.cse2 (<= .cse15 ULTIMATE.start_main_~expected~0)) (.cse3 (<= |ULTIMATE.start_dll_get_data_at_#res| ULTIMATE.start_main_~expected~0)) (.cse4 (= (select |#valid| ULTIMATE.start_dll_create_~new_head~0.base) 1)) (.cse7 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~s~0.base) 4)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~s~0.base) 4))) (.cse6 (= ULTIMATE.start_main_~s~0.offset 0)) (.cse8 (<= ULTIMATE.start_main_~expected~0 .cse15)) (.cse9 (<= ULTIMATE.start_main_~expected~0 |ULTIMATE.start_dll_get_data_at_#res|)) (.cse10 (<= ULTIMATE.start_dll_update_at_~index 0)) (.cse11 (= ULTIMATE.start_dll_create_~new_head~0.offset 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (+ ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~len~0) .cse7) .cse8 .cse9 .cse10 .cse11) (let ((.cse13 (+ ULTIMATE.start_main_~len~0 1)) (.cse12 (select (select |#memory_int| ULTIMATE.start_main_~s~0.base) ULTIMATE.start_main_~s~0.offset)) (.cse14 (select (select (store |#memory_int| ULTIMATE.start_dll_update_at_~head.base (store (select |#memory_int| ULTIMATE.start_dll_update_at_~head.base) ULTIMATE.start_dll_update_at_~head.offset ULTIMATE.start_dll_update_at_~data)) ULTIMATE.start_main_~s~0.base) ULTIMATE.start_main_~s~0.offset))) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_dll_get_data_at_~index 0) (<= ULTIMATE.start_main_~len~0 .cse12) (<= .cse13 .cse7) .cse4 (<= .cse7 .cse13) .cse6 .cse8 (<= ULTIMATE.start_main_~len~0 .cse14) (<= .cse12 ULTIMATE.start_main_~len~0) .cse9 (<= .cse14 ULTIMATE.start_main_~len~0) .cse10 .cse11))))) [2021-08-29 09:49:53,648 INFO L858 garLoopResultBuilder]: For program point L633-2(lines 633 638) no Hoare annotation was computed. [2021-08-29 09:49:53,648 INFO L854 garLoopResultBuilder]: At program point L633-3(lines 633 638) the Hoare annotation is: (let ((.cse6 (= ULTIMATE.start_main_~i~0 0)) (.cse11 (<= 1 ULTIMATE.start_main_~i~0))) (let ((.cse0 (= (select |#valid| ULTIMATE.start_dll_create_~head~0.base) 1)) (.cse4 (= (select |#valid| ULTIMATE.start_dll_create_~new_head~0.base) 1)) (.cse5 (= ULTIMATE.start_main_~s~0.offset 0)) (.cse3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~s~0.base) 4)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~s~0.base) 4))) (.cse7 (let ((.cse12 (= 2 ULTIMATE.start_main_~len~0))) (or (and .cse12 .cse6) (and .cse11 .cse12)))) (.cse9 (<= ULTIMATE.start_dll_update_at_~index 0)) (.cse10 (= ULTIMATE.start_dll_create_~new_head~0.offset 0))) (or (let ((.cse2 (+ ULTIMATE.start_main_~len~0 1)) (.cse1 (select (select |#memory_int| ULTIMATE.start_main_~s~0.base) ULTIMATE.start_main_~s~0.offset)) (.cse8 (select (select (store |#memory_int| ULTIMATE.start_dll_update_at_~head.base (store (select |#memory_int| ULTIMATE.start_dll_update_at_~head.base) ULTIMATE.start_dll_update_at_~head.offset ULTIMATE.start_dll_update_at_~data)) ULTIMATE.start_main_~s~0.base) ULTIMATE.start_main_~s~0.offset))) (and .cse0 (<= ULTIMATE.start_main_~len~0 .cse1) (<= .cse2 .cse3) .cse4 (<= .cse3 .cse2) .cse5 .cse6 .cse7 (<= ULTIMATE.start_main_~len~0 .cse8) (<= .cse1 ULTIMATE.start_main_~len~0) (<= .cse8 ULTIMATE.start_main_~len~0) .cse9 .cse10)) (and .cse0 (<= 2 ULTIMATE.start_main_~i~0) .cse4 .cse7 .cse9 .cse10) (and .cse0 .cse4 .cse11 .cse5 (= (+ ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~len~0) .cse3) (<= ULTIMATE.start_dll_get_data_at_~index 0) .cse7 .cse9 .cse10)))) [2021-08-29 09:49:53,649 INFO L858 garLoopResultBuilder]: For program point L633-4(lines 633 638) no Hoare annotation was computed. [2021-08-29 09:49:53,649 INFO L858 garLoopResultBuilder]: For program point L617(lines 1 643) no Hoare annotation was computed. [2021-08-29 09:49:53,649 INFO L861 garLoopResultBuilder]: At program point L642(lines 624 643) the Hoare annotation is: true [2021-08-29 09:49:53,649 INFO L854 garLoopResultBuilder]: At program point L601(lines 585 602) the Hoare annotation is: (and (= |ULTIMATE.start_dll_create_#res.offset| 0) (= (select |#valid| ULTIMATE.start_dll_create_~head~0.base) 1) (= ULTIMATE.start_dll_create_~head~0.offset 0) (= (select |#valid| ULTIMATE.start_dll_create_~new_head~0.base) 1) (not (= ULTIMATE.start_dll_create_~head~0.base (select (select |#memory_$Pointer$.base| ULTIMATE.start_dll_create_~head~0.base) 4))) (= 2 ULTIMATE.start_main_~len~0) (not (= ULTIMATE.start_dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| ULTIMATE.start_dll_create_~new_head~0.base) (+ ULTIMATE.start_dll_create_~new_head~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res.base|) 4) |ULTIMATE.start_dll_create_#res.base|)) (= ULTIMATE.start_dll_create_~new_head~0.offset 0)) [2021-08-29 09:49:53,649 INFO L854 garLoopResultBuilder]: At program point L618-2(lines 618 621) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_dll_create_#res.offset| 0)) (.cse1 (= (select |#valid| ULTIMATE.start_dll_create_~head~0.base) 1)) (.cse2 (= (+ ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~len~0) ULTIMATE.start_dll_update_at_~data)) (.cse3 (= ULTIMATE.start_dll_create_~head~0.offset 0)) (.cse4 (= (select |#valid| ULTIMATE.start_dll_create_~new_head~0.base) 1)) (.cse6 (= ULTIMATE.start_main_~s~0.base ULTIMATE.start_dll_update_at_~head.base)) (.cse7 (= ULTIMATE.start_main_~s~0.offset 0)) (.cse8 (not (= ULTIMATE.start_dll_create_~head~0.base (select (select |#memory_$Pointer$.base| ULTIMATE.start_dll_create_~head~0.base) 4)))) (.cse9 (= 2 ULTIMATE.start_main_~len~0)) (.cse5 (select |#memory_$Pointer$.base| ULTIMATE.start_dll_update_at_~head.base)) (.cse10 (not (= ULTIMATE.start_dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| ULTIMATE.start_dll_create_~new_head~0.base) (+ ULTIMATE.start_dll_create_~new_head~0.offset 4))))) (.cse11 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res.base|) 4) |ULTIMATE.start_dll_create_#res.base|))) (.cse12 (= ULTIMATE.start_dll_create_~new_head~0.offset 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_main_~s~0.offset ULTIMATE.start_dll_update_at_~head.offset) .cse4 (not (= (select .cse5 4) ULTIMATE.start_dll_update_at_~head.base)) .cse6 (= ULTIMATE.start_dll_update_at_~index 0) .cse7 .cse8 .cse9 (= ULTIMATE.start_main_~i~0 0) .cse10 .cse11 .cse12) (let ((.cse13 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~s~0.base) 4)) (.cse14 (select (select (store |#memory_int| ULTIMATE.start_dll_update_at_~head.base (store (select |#memory_int| ULTIMATE.start_dll_update_at_~head.base) ULTIMATE.start_dll_update_at_~head.offset ULTIMATE.start_dll_update_at_~data)) ULTIMATE.start_main_~s~0.base) ULTIMATE.start_main_~s~0.offset))) (and .cse0 .cse1 (<= ULTIMATE.start_main_~i~0 1) .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_main_~i~0) (not (= ULTIMATE.start_main_~s~0.base .cse13)) .cse7 .cse8 (= ULTIMATE.start_dll_update_at_~head.offset (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~s~0.base) 4)) .cse9 .cse10 (= ULTIMATE.start_dll_update_at_~head.base .cse13) (<= ULTIMATE.start_main_~len~0 .cse14) .cse11 (<= .cse14 ULTIMATE.start_main_~len~0) (<= ULTIMATE.start_dll_update_at_~index 0) .cse12)) (let ((.cse16 (+ ULTIMATE.start_main_~len~0 1)) (.cse15 (select (select |#memory_int| ULTIMATE.start_main_~s~0.base) ULTIMATE.start_main_~s~0.offset))) (and .cse0 .cse1 (<= ULTIMATE.start_main_~len~0 .cse15) (= ULTIMATE.start_main_~i~0 ULTIMATE.start_dll_update_at_~index) .cse2 .cse3 .cse4 (<= ULTIMATE.start_dll_update_at_~data .cse16) .cse6 .cse7 .cse8 .cse9 (not (= (select .cse5 (+ ULTIMATE.start_dll_update_at_~head.offset 4)) ULTIMATE.start_main_~s~0.base)) .cse10 (<= .cse16 ULTIMATE.start_dll_update_at_~data) .cse11 (<= .cse15 ULTIMATE.start_main_~len~0) (= ULTIMATE.start_dll_update_at_~head.offset 0) .cse12)))) [2021-08-29 09:49:53,649 INFO L858 garLoopResultBuilder]: For program point L618-3(lines 618 621) no Hoare annotation was computed. [2021-08-29 09:49:53,649 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-29 09:49:53,650 INFO L858 garLoopResultBuilder]: For program point L635(lines 635 637) no Hoare annotation was computed. [2021-08-29 09:49:53,650 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 641) no Hoare annotation was computed. [2021-08-29 09:49:53,650 INFO L854 garLoopResultBuilder]: At program point L611-2(lines 611 614) the Hoare annotation is: (let ((.cse5 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~s~0.base) 4)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~s~0.base) 4))) (.cse12 (<= 1 ULTIMATE.start_main_~i~0)) (.cse18 (select (select |#memory_int| ULTIMATE.start_dll_get_data_at_~head.base) ULTIMATE.start_dll_get_data_at_~head.offset))) (let ((.cse2 (<= .cse18 ULTIMATE.start_main_~expected~0)) (.cse8 (<= ULTIMATE.start_main_~expected~0 .cse18)) (.cse0 (= (select |#valid| ULTIMATE.start_dll_create_~head~0.base) 1)) (.cse1 (let ((.cse16 (<= ULTIMATE.start_main_~i~0 1)) (.cse17 (= 2 ULTIMATE.start_main_~len~0))) (or (and .cse16 .cse12 .cse17) (and .cse16 .cse17 (= ULTIMATE.start_main_~i~0 0))))) (.cse6 (= (select |#valid| ULTIMATE.start_dll_create_~new_head~0.base) 1)) (.cse7 (= ULTIMATE.start_main_~s~0.offset 0)) (.cse13 (= (+ ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~len~0) .cse5)) (.cse10 (<= ULTIMATE.start_dll_update_at_~index 0)) (.cse11 (= ULTIMATE.start_dll_create_~new_head~0.offset 0))) (or (let ((.cse4 (+ ULTIMATE.start_main_~len~0 1)) (.cse3 (select (select |#memory_int| ULTIMATE.start_main_~s~0.base) ULTIMATE.start_main_~s~0.offset)) (.cse9 (select (select (store |#memory_int| ULTIMATE.start_dll_update_at_~head.base (store (select |#memory_int| ULTIMATE.start_dll_update_at_~head.base) ULTIMATE.start_dll_update_at_~head.offset ULTIMATE.start_dll_update_at_~data)) ULTIMATE.start_main_~s~0.base) ULTIMATE.start_main_~s~0.offset))) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_dll_get_data_at_~index 0) (<= ULTIMATE.start_main_~len~0 .cse3) (<= .cse4 .cse5) .cse6 (<= .cse5 .cse4) .cse7 .cse8 (<= ULTIMATE.start_main_~len~0 .cse9) (<= .cse3 ULTIMATE.start_main_~len~0) (<= .cse9 ULTIMATE.start_main_~len~0) .cse10 .cse11)) (and .cse0 .cse1 .cse2 .cse6 .cse12 .cse7 .cse13 (<= ULTIMATE.start_dll_get_data_at_~index 0) .cse8 .cse10 .cse11) (let ((.cse14 (let ((.cse15 (+ 4 ULTIMATE.start_dll_get_data_at_~head.offset))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ULTIMATE.start_dll_get_data_at_~head.base) .cse15)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_dll_get_data_at_~head.base) .cse15))))) (and (<= ULTIMATE.start_dll_get_data_at_~index 1) .cse0 .cse1 (<= .cse14 ULTIMATE.start_main_~expected~0) (<= ULTIMATE.start_main_~expected~0 .cse14) .cse6 (= 0 ULTIMATE.start_dll_get_data_at_~head.offset) .cse12 .cse7 .cse13 (<= 1 ULTIMATE.start_dll_get_data_at_~index) .cse10 .cse11))))) [2021-08-29 09:49:53,650 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-29 09:49:53,650 INFO L858 garLoopResultBuilder]: For program point L611-3(lines 611 614) no Hoare annotation was computed. [2021-08-29 09:49:53,650 INFO L854 garLoopResultBuilder]: At program point L636(lines 624 643) the Hoare annotation is: false [2021-08-29 09:49:53,650 INFO L858 garLoopResultBuilder]: For program point L603(lines 603 609) no Hoare annotation was computed. [2021-08-29 09:49:53,650 INFO L858 garLoopResultBuilder]: For program point L595(lines 595 597) no Hoare annotation was computed. [2021-08-29 09:49:53,650 INFO L858 garLoopResultBuilder]: For program point L595-2(lines 595 597) no Hoare annotation was computed. [2021-08-29 09:49:53,650 INFO L854 garLoopResultBuilder]: At program point L587-2(lines 587 600) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_dll_create_~head~0.offset 0)) (.cse2 (= (select |#valid| ULTIMATE.start_dll_create_~head~0.base) 1)) (.cse3 (= (select |#valid| ULTIMATE.start_dll_create_~new_head~0.base) 1)) (.cse1 (= 2 ULTIMATE.start_main_~len~0)) (.cse4 (= ULTIMATE.start_dll_create_~new_head~0.offset 0))) (or (and (= ULTIMATE.start_dll_create_~len 2) .cse0 .cse1 (= ULTIMATE.start_dll_create_~head~0.base 0)) (and .cse2 .cse0 .cse3 (not (= ULTIMATE.start_dll_create_~head~0.base (select (select |#memory_$Pointer$.base| ULTIMATE.start_dll_create_~head~0.base) 4))) .cse1 (not (= ULTIMATE.start_dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| ULTIMATE.start_dll_create_~new_head~0.base) (+ ULTIMATE.start_dll_create_~new_head~0.offset 4)))) .cse4) (and .cse2 .cse3 .cse1 (<= 1 ULTIMATE.start_dll_create_~len) .cse4))) [2021-08-29 09:49:53,650 INFO L858 garLoopResultBuilder]: For program point L587-3(lines 587 600) no Hoare annotation was computed. [2021-08-29 09:49:53,651 INFO L861 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2021-08-29 09:49:53,651 INFO L854 garLoopResultBuilder]: At program point L629-2(lines 629 632) the Hoare annotation is: (let ((.cse18 (select (select (store |#memory_int| ULTIMATE.start_dll_update_at_~head.base (store (select |#memory_int| ULTIMATE.start_dll_update_at_~head.base) ULTIMATE.start_dll_update_at_~head.offset ULTIMATE.start_dll_update_at_~data)) ULTIMATE.start_main_~s~0.base) ULTIMATE.start_main_~s~0.offset)) (.cse19 (select (select |#memory_int| ULTIMATE.start_main_~s~0.base) ULTIMATE.start_main_~s~0.offset)) (.cse17 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~s~0.base) 4))) (let ((.cse0 (= |ULTIMATE.start_dll_create_#res.offset| 0)) (.cse3 (= ULTIMATE.start_dll_create_~head~0.offset 0)) (.cse5 (not (= ULTIMATE.start_main_~s~0.base .cse17))) (.cse7 (not (= ULTIMATE.start_dll_create_~head~0.base (select (select |#memory_$Pointer$.base| ULTIMATE.start_dll_create_~head~0.base) 4)))) (.cse9 (not (= ULTIMATE.start_dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| ULTIMATE.start_dll_create_~new_head~0.base) (+ ULTIMATE.start_dll_create_~new_head~0.offset 4))))) (.cse11 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res.base|) 4) |ULTIMATE.start_dll_create_#res.base|))) (.cse1 (= (select |#valid| ULTIMATE.start_dll_create_~head~0.base) 1)) (.cse2 (<= ULTIMATE.start_main_~len~0 .cse19)) (.cse4 (= (select |#valid| ULTIMATE.start_dll_create_~new_head~0.base) 1)) (.cse6 (= ULTIMATE.start_main_~s~0.offset 0)) (.cse8 (= 2 ULTIMATE.start_main_~len~0)) (.cse10 (<= ULTIMATE.start_main_~len~0 .cse18)) (.cse12 (<= .cse19 ULTIMATE.start_main_~len~0)) (.cse13 (<= .cse18 ULTIMATE.start_main_~len~0)) (.cse14 (= ULTIMATE.start_dll_create_~new_head~0.offset 0))) (or (and .cse0 .cse1 (<= ULTIMATE.start_main_~i~0 1) .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_main_~i~0) .cse5 (= ULTIMATE.start_dll_update_at_~index 0) .cse6 .cse7 .cse8 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_dll_update_at_~head.base) (+ ULTIMATE.start_dll_update_at_~head.offset 4)) ULTIMATE.start_main_~s~0.base)) .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_dll_update_at_~head.offset 0) .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_main_~i~0 0) .cse9 .cse11 .cse14) (let ((.cse16 (select (select |#memory_int| .cse17) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~s~0.base) 4))) (.cse15 (+ ULTIMATE.start_main_~len~0 1))) (and .cse1 .cse2 (<= 2 ULTIMATE.start_main_~i~0) (<= .cse15 .cse16) .cse4 (<= .cse16 .cse15) .cse6 .cse8 .cse10 .cse12 .cse13 (<= ULTIMATE.start_dll_update_at_~index 0) .cse14))))) [2021-08-29 09:49:53,651 INFO L858 garLoopResultBuilder]: For program point L629-3(lines 629 632) no Hoare annotation was computed. [2021-08-29 09:49:53,654 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-29 09:49:53,659 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,660 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,660 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,660 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,661 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,661 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,665 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,666 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,666 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,666 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,667 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,667 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,669 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,669 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,670 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,670 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,670 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,671 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,671 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,671 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,671 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,672 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,672 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,672 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,674 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,675 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,675 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,675 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,676 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,676 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,676 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,676 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,677 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,677 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,677 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,677 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,679 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,680 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,680 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,681 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,681 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,682 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,682 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,682 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,682 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,684 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,684 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,684 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,684 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,686 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,686 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,686 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,686 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,686 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,687 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,687 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,687 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,687 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,687 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,688 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,688 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,688 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,689 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,690 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,690 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,690 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,690 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,690 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,691 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,692 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,692 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,692 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,692 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,692 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,694 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,694 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,694 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,694 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,694 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,699 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,699 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,700 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,700 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,700 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,700 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,700 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,700 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,702 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,702 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 09:49:53 BoogieIcfgContainer [2021-08-29 09:49:53,704 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-29 09:49:53,704 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-29 09:49:53,704 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-29 09:49:53,705 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-29 09:49:53,705 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 09:49:09" (3/4) ... [2021-08-29 09:49:53,707 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-29 09:49:53,715 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-08-29 09:49:53,716 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-08-29 09:49:53,716 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-29 09:49:53,716 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-29 09:49:53,733 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\result == 0 && \valid[head] == 1) && head == 0) && \valid[new_head] == 1) && !(head == #memory_$Pointer$[head][4])) && 2 == len) && !(new_head == #memory_$Pointer$[new_head][new_head + 4])) && !(#memory_$Pointer$[\result][4] == \result)) && new_head == 0 [2021-08-29 09:49:53,733 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && \valid[head] == 1) && i <= 1) && len <= unknown-#memory_int-unknown[s][s]) && head == 0) && \valid[new_head] == 1) && 1 <= i) && !(s == #memory_$Pointer$[s][4])) && index == 0) && s == 0) && !(head == #memory_$Pointer$[head][4])) && 2 == len) && !(#memory_$Pointer$[head][head + 4] == s)) && !(new_head == #memory_$Pointer$[new_head][new_head + 4])) && len <= unknown-#memory_int-unknown[head := unknown-#memory_int-unknown[head][head := data]][s][s]) && !(#memory_$Pointer$[\result][4] == \result)) && unknown-#memory_int-unknown[s][s] <= len) && head == 0) && unknown-#memory_int-unknown[head := unknown-#memory_int-unknown[head][head := data]][s][s] <= len) && new_head == 0) || (((((((((((\result == 0 && \valid[head] == 1) && head == 0) && \valid[new_head] == 1) && !(s == #memory_$Pointer$[s][4])) && s == 0) && !(head == #memory_$Pointer$[head][4])) && 2 == len) && i == 0) && !(new_head == #memory_$Pointer$[new_head][new_head + 4])) && !(#memory_$Pointer$[\result][4] == \result)) && new_head == 0)) || ((((((((((((\valid[head] == 1 && len <= unknown-#memory_int-unknown[s][s]) && 2 <= i) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && \valid[new_head] == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= len + 1) && s == 0) && 2 == len) && len <= unknown-#memory_int-unknown[head := unknown-#memory_int-unknown[head][head := data]][s][s]) && unknown-#memory_int-unknown[s][s] <= len) && unknown-#memory_int-unknown[head := unknown-#memory_int-unknown[head][head := data]][s][s] <= len) && index <= 0) && new_head == 0) [2021-08-29 09:49:53,733 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((\result == 0 && \valid[head] == 1) && i + len == data) && head == 0) && s == head) && \valid[new_head] == 1) && !(#memory_$Pointer$[head][4] == head)) && s == head) && index == 0) && s == 0) && !(head == #memory_$Pointer$[head][4])) && 2 == len) && i == 0) && !(new_head == #memory_$Pointer$[new_head][new_head + 4])) && !(#memory_$Pointer$[\result][4] == \result)) && new_head == 0) || ((((((((((((((((((\result == 0 && \valid[head] == 1) && i <= 1) && i + len == data) && head == 0) && \valid[new_head] == 1) && 1 <= i) && !(s == #memory_$Pointer$[s][4])) && s == 0) && !(head == #memory_$Pointer$[head][4])) && head == #memory_$Pointer$[s][4]) && 2 == len) && !(new_head == #memory_$Pointer$[new_head][new_head + 4])) && head == #memory_$Pointer$[s][4]) && len <= unknown-#memory_int-unknown[head := unknown-#memory_int-unknown[head][head := data]][s][s]) && !(#memory_$Pointer$[\result][4] == \result)) && unknown-#memory_int-unknown[head := unknown-#memory_int-unknown[head][head := data]][s][s] <= len) && index <= 0) && new_head == 0)) || ((((((((((((((((((\result == 0 && \valid[head] == 1) && len <= unknown-#memory_int-unknown[s][s]) && i == index) && i + len == data) && head == 0) && \valid[new_head] == 1) && data <= len + 1) && s == head) && s == 0) && !(head == #memory_$Pointer$[head][4])) && 2 == len) && !(#memory_$Pointer$[head][head + 4] == s)) && !(new_head == #memory_$Pointer$[new_head][new_head + 4])) && len + 1 <= data) && !(#memory_$Pointer$[\result][4] == \result)) && unknown-#memory_int-unknown[s][s] <= len) && head == 0) && new_head == 0) [2021-08-29 09:49:53,734 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((\valid[head] == 1 && (((i <= 1 && 1 <= i) && 2 == len) || ((i <= 1 && 2 == len) && i == 0))) && unknown-#memory_int-unknown[head][head] <= expected) && \result <= expected) && \valid[new_head] == 1) && 1 <= i) && s == 0) && i + len == unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && expected <= unknown-#memory_int-unknown[head][head]) && expected <= \result) && index <= 0) && new_head == 0) || ((((((((((((((((\valid[head] == 1 && (((i <= 1 && 1 <= i) && 2 == len) || ((i <= 1 && 2 == len) && i == 0))) && unknown-#memory_int-unknown[head][head] <= expected) && \result <= expected) && index == 0) && len <= unknown-#memory_int-unknown[s][s]) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && \valid[new_head] == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= len + 1) && s == 0) && expected <= unknown-#memory_int-unknown[head][head]) && len <= unknown-#memory_int-unknown[head := unknown-#memory_int-unknown[head][head := data]][s][s]) && unknown-#memory_int-unknown[s][s] <= len) && expected <= \result) && unknown-#memory_int-unknown[head := unknown-#memory_int-unknown[head][head := data]][s][s] <= len) && index <= 0) && new_head == 0) [2021-08-29 09:49:53,743 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-29 09:49:53,743 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-29 09:49:53,743 INFO L158 Benchmark]: Toolchain (without parser) took 45449.42ms. Allocated memory was 60.8MB in the beginning and 94.4MB in the end (delta: 33.6MB). Free memory was 37.9MB in the beginning and 35.3MB in the end (delta: 2.6MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. [2021-08-29 09:49:53,744 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 60.8MB. Free memory is still 42.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 09:49:53,744 INFO L158 Benchmark]: CACSL2BoogieTranslator took 345.63ms. Allocated memory is still 60.8MB. Free memory was 37.6MB in the beginning and 36.7MB in the end (delta: 870.7kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-08-29 09:49:53,744 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.36ms. Allocated memory is still 60.8MB. Free memory was 36.7MB in the beginning and 34.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 09:49:53,744 INFO L158 Benchmark]: Boogie Preprocessor took 45.19ms. Allocated memory is still 60.8MB. Free memory was 34.7MB in the beginning and 33.1MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-08-29 09:49:53,744 INFO L158 Benchmark]: RCFGBuilder took 265.01ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 33.1MB in the beginning and 55.3MB in the end (delta: -22.2MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2021-08-29 09:49:53,745 INFO L158 Benchmark]: TraceAbstraction took 44691.84ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 55.0MB in the beginning and 39.5MB in the end (delta: 15.5MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. [2021-08-29 09:49:53,745 INFO L158 Benchmark]: Witness Printer took 38.85ms. Allocated memory is still 94.4MB. Free memory was 39.5MB in the beginning and 35.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-08-29 09:49:53,746 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.17ms. Allocated memory is still 60.8MB. Free memory is still 42.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 345.63ms. Allocated memory is still 60.8MB. Free memory was 37.6MB in the beginning and 36.7MB in the end (delta: 870.7kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.36ms. Allocated memory is still 60.8MB. Free memory was 36.7MB in the beginning and 34.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.19ms. Allocated memory is still 60.8MB. Free memory was 34.7MB in the beginning and 33.1MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 265.01ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 33.1MB in the beginning and 55.3MB in the end (delta: -22.2MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * TraceAbstraction took 44691.84ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 55.0MB in the beginning and 39.5MB in the end (delta: 15.5MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. * Witness Printer took 38.85ms. Allocated memory is still 94.4MB. Free memory was 39.5MB in the beginning and 35.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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$.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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 641]: 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: 44604.25ms, OverallIterations: 14, TraceHistogramMax: 3, EmptinessCheckTime: 15.64ms, AutomataDifference: 10511.97ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 1149.08ms, InitialAbstractionConstructionTime: 6.53ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 633 SdHoareTripleChecker+Valid, 1523.53ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 633 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 1255.60ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 790 IncrementalHoareTripleChecker+Unchecked, 1143 mSDsCounter, 222 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2844 IncrementalHoareTripleChecker+Invalid, 3856 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 222 mSolverCounterUnsat, 1 mSDtfsCounter, 2844 mSolverCounterSat, 21.00ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 696 GetRequests, 472 SyntacticMatches, 13 SemanticMatches, 211 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 35580.39ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=7, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 79.99ms AutomataMinimizationTime, 14 MinimizatonAttempts, 130 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 33 NumberOfFragments, 1472 HoareAnnotationTreeSize, 11 FomulaSimplifications, 30129 FormulaSimplificationTreeSizeReduction, 128.51ms HoareSimplificationTime, 11 FomulaSimplificationsInter, 8767 FormulaSimplificationTreeSizeReductionInter, 1013.12ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 126.75ms SsaConstructionTime, 443.07ms SatisfiabilityAnalysisTime, 20682.27ms InterpolantComputationTime, 678 NumberOfCodeBlocks, 674 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 875 ConstructedInterpolants, 22 QuantifiedInterpolants, 4704 SizeOfPredicates, 54 NumberOfNonLiveVariables, 1475 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 29 InterpolantComputations, 6 PerfectInterpolantSequences, 326/436 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: 633]: Loop Invariant [2021-08-29 09:49:53,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,762 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,762 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((\valid[head] == 1 && len <= unknown-#memory_int-unknown[s][s]) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && \valid[new_head] == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= len + 1) && s == 0) && i == 0) && ((2 == len && i == 0) || (1 <= i && 2 == len))) && len <= unknown-#memory_int-unknown[head := unknown-#memory_int-unknown[head][head := data]][s][s]) && unknown-#memory_int-unknown[s][s] <= len) && unknown-#memory_int-unknown[head := unknown-#memory_int-unknown[head][head := data]][s][s] <= len) && index <= 0) && new_head == 0) || (((((\valid[head] == 1 && 2 <= i) && \valid[new_head] == 1) && ((2 == len && i == 0) || (1 <= i && 2 == len))) && index <= 0) && new_head == 0)) || ((((((((\valid[head] == 1 && \valid[new_head] == 1) && 1 <= i) && s == 0) && i + len == unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && index <= 0) && ((2 == len && i == 0) || (1 <= i && 2 == len))) && index <= 0) && new_head == 0) - InvariantResult [Line: 573]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 611]: Loop Invariant [2021-08-29 09:49:53,762 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,762 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,764 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,764 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,764 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,764 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,764 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((\valid[head] == 1 && (((i <= 1 && 1 <= i) && 2 == len) || ((i <= 1 && 2 == len) && i == 0))) && unknown-#memory_int-unknown[head][head] <= expected) && index == 0) && len <= unknown-#memory_int-unknown[s][s]) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && \valid[new_head] == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= len + 1) && s == 0) && expected <= unknown-#memory_int-unknown[head][head]) && len <= unknown-#memory_int-unknown[head := unknown-#memory_int-unknown[head][head := data]][s][s]) && unknown-#memory_int-unknown[s][s] <= len) && unknown-#memory_int-unknown[head := unknown-#memory_int-unknown[head][head := data]][s][s] <= len) && index <= 0) && new_head == 0) || ((((((((((\valid[head] == 1 && (((i <= 1 && 1 <= i) && 2 == len) || ((i <= 1 && 2 == len) && i == 0))) && unknown-#memory_int-unknown[head][head] <= expected) && \valid[new_head] == 1) && 1 <= i) && s == 0) && i + len == unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && index <= 0) && expected <= unknown-#memory_int-unknown[head][head]) && index <= 0) && new_head == 0)) || ((((((((((((index <= 1 && \valid[head] == 1) && (((i <= 1 && 1 <= i) && 2 == len) || ((i <= 1 && 2 == len) && i == 0))) && unknown-#memory_int-unknown[#memory_$Pointer$[head][4 + head]][#memory_$Pointer$[head][4 + head]] <= expected) && expected <= unknown-#memory_int-unknown[#memory_$Pointer$[head][4 + head]][#memory_$Pointer$[head][4 + head]]) && \valid[new_head] == 1) && 0 == head) && 1 <= i) && s == 0) && i + len == unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && 1 <= index) && index <= 0) && new_head == 0) - InvariantResult [Line: 624]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 587]: Loop Invariant [2021-08-29 09:49:53,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((len == 2 && head == 0) && 2 == len) && head == 0) || ((((((\valid[head] == 1 && head == 0) && \valid[new_head] == 1) && !(head == #memory_$Pointer$[head][4])) && 2 == len) && !(new_head == #memory_$Pointer$[new_head][new_head + 4])) && new_head == 0)) || ((((\valid[head] == 1 && \valid[new_head] == 1) && 2 == len) && 1 <= len) && new_head == 0) - InvariantResult [Line: 629]: Loop Invariant [2021-08-29 09:49:53,767 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,767 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,767 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,767 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,767 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,767 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,767 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,767 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,768 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,768 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,768 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,768 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,768 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,779 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,779 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,779 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,781 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,781 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,781 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,781 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,781 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,781 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((((\result == 0 && \valid[head] == 1) && i <= 1) && len <= unknown-#memory_int-unknown[s][s]) && head == 0) && \valid[new_head] == 1) && 1 <= i) && !(s == #memory_$Pointer$[s][4])) && index == 0) && s == 0) && !(head == #memory_$Pointer$[head][4])) && 2 == len) && !(#memory_$Pointer$[head][head + 4] == s)) && !(new_head == #memory_$Pointer$[new_head][new_head + 4])) && len <= unknown-#memory_int-unknown[head := unknown-#memory_int-unknown[head][head := data]][s][s]) && !(#memory_$Pointer$[\result][4] == \result)) && unknown-#memory_int-unknown[s][s] <= len) && head == 0) && unknown-#memory_int-unknown[head := unknown-#memory_int-unknown[head][head := data]][s][s] <= len) && new_head == 0) || (((((((((((\result == 0 && \valid[head] == 1) && head == 0) && \valid[new_head] == 1) && !(s == #memory_$Pointer$[s][4])) && s == 0) && !(head == #memory_$Pointer$[head][4])) && 2 == len) && i == 0) && !(new_head == #memory_$Pointer$[new_head][new_head + 4])) && !(#memory_$Pointer$[\result][4] == \result)) && new_head == 0)) || ((((((((((((\valid[head] == 1 && len <= unknown-#memory_int-unknown[s][s]) && 2 <= i) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && \valid[new_head] == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= len + 1) && s == 0) && 2 == len) && len <= unknown-#memory_int-unknown[head := unknown-#memory_int-unknown[head][head := data]][s][s]) && unknown-#memory_int-unknown[s][s] <= len) && unknown-#memory_int-unknown[head := unknown-#memory_int-unknown[head][head := data]][s][s] <= len) && index <= 0) && new_head == 0) - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 610]: Loop Invariant [2021-08-29 09:49:53,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,784 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,784 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,784 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,784 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,784 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,784 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((\valid[head] == 1 && (((i <= 1 && 1 <= i) && 2 == len) || ((i <= 1 && 2 == len) && i == 0))) && unknown-#memory_int-unknown[head][head] <= expected) && \result <= expected) && \valid[new_head] == 1) && 1 <= i) && s == 0) && i + len == unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && expected <= unknown-#memory_int-unknown[head][head]) && expected <= \result) && index <= 0) && new_head == 0) || ((((((((((((((((\valid[head] == 1 && (((i <= 1 && 1 <= i) && 2 == len) || ((i <= 1 && 2 == len) && i == 0))) && unknown-#memory_int-unknown[head][head] <= expected) && \result <= expected) && index == 0) && len <= unknown-#memory_int-unknown[s][s]) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && \valid[new_head] == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= len + 1) && s == 0) && expected <= unknown-#memory_int-unknown[head][head]) && len <= unknown-#memory_int-unknown[head := unknown-#memory_int-unknown[head][head := data]][s][s]) && unknown-#memory_int-unknown[s][s] <= len) && expected <= \result) && unknown-#memory_int-unknown[head := unknown-#memory_int-unknown[head][head := data]][s][s] <= len) && index <= 0) && new_head == 0) - InvariantResult [Line: 585]: Loop Invariant [2021-08-29 09:49:53,785 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,785 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,785 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,785 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,785 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,786 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((\result == 0 && \valid[head] == 1) && head == 0) && \valid[new_head] == 1) && !(head == #memory_$Pointer$[head][4])) && 2 == len) && !(new_head == #memory_$Pointer$[new_head][new_head + 4])) && !(#memory_$Pointer$[\result][4] == \result)) && new_head == 0 - InvariantResult [Line: 624]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 618]: Loop Invariant [2021-08-29 09:49:53,786 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,786 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,786 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,786 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,787 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,787 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,787 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,787 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,787 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,787 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,787 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,787 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,789 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,789 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,789 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,790 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,790 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,790 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,790 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,790 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,790 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-29 09:49:53,790 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,790 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,791 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,791 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,791 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,791 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-29 09:49:53,791 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((\result == 0 && \valid[head] == 1) && i + len == data) && head == 0) && s == head) && \valid[new_head] == 1) && !(#memory_$Pointer$[head][4] == head)) && s == head) && index == 0) && s == 0) && !(head == #memory_$Pointer$[head][4])) && 2 == len) && i == 0) && !(new_head == #memory_$Pointer$[new_head][new_head + 4])) && !(#memory_$Pointer$[\result][4] == \result)) && new_head == 0) || ((((((((((((((((((\result == 0 && \valid[head] == 1) && i <= 1) && i + len == data) && head == 0) && \valid[new_head] == 1) && 1 <= i) && !(s == #memory_$Pointer$[s][4])) && s == 0) && !(head == #memory_$Pointer$[head][4])) && head == #memory_$Pointer$[s][4]) && 2 == len) && !(new_head == #memory_$Pointer$[new_head][new_head + 4])) && head == #memory_$Pointer$[s][4]) && len <= unknown-#memory_int-unknown[head := unknown-#memory_int-unknown[head][head := data]][s][s]) && !(#memory_$Pointer$[\result][4] == \result)) && unknown-#memory_int-unknown[head := unknown-#memory_int-unknown[head][head := data]][s][s] <= len) && index <= 0) && new_head == 0)) || ((((((((((((((((((\result == 0 && \valid[head] == 1) && len <= unknown-#memory_int-unknown[s][s]) && i == index) && i + len == data) && head == 0) && \valid[new_head] == 1) && data <= len + 1) && s == head) && s == 0) && !(head == #memory_$Pointer$[head][4])) && 2 == len) && !(#memory_$Pointer$[head][head + 4] == s)) && !(new_head == #memory_$Pointer$[new_head][new_head + 4])) && len + 1 <= data) && !(#memory_$Pointer$[\result][4] == \result)) && unknown-#memory_int-unknown[s][s] <= len) && head == 0) && new_head == 0) RESULT: Ultimate proved your program to be correct! [2021-08-29 09:49:53,802 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...