./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-sets/test_add-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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/ldv-sets/test_add-2.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 b0bf6ee66b233cfe70507a3d8d55aa219725b8ce14e12bc2fdcf83f18b236eff --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-15 23:55:16,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 23:55:16,928 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 23:55:16,950 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 23:55:16,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 23:55:16,951 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 23:55:16,952 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 23:55:16,954 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 23:55:16,955 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 23:55:16,956 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 23:55:16,956 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 23:55:16,957 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 23:55:16,958 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 23:55:16,958 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 23:55:16,959 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 23:55:16,960 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 23:55:16,961 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 23:55:16,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 23:55:16,963 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 23:55:16,964 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 23:55:16,965 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 23:55:16,966 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 23:55:16,967 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 23:55:16,967 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 23:55:16,969 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 23:55:16,969 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 23:55:16,970 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 23:55:16,970 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 23:55:16,970 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 23:55:16,971 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 23:55:16,972 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 23:55:16,972 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 23:55:16,973 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 23:55:16,973 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 23:55:16,974 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 23:55:16,974 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 23:55:16,975 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 23:55:16,981 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 23:55:16,981 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 23:55:16,982 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 23:55:16,983 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 23:55:16,984 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-15 23:55:17,001 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 23:55:17,001 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 23:55:17,001 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 23:55:17,002 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 23:55:17,002 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 23:55:17,002 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 23:55:17,003 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 23:55:17,003 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 23:55:17,003 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 23:55:17,004 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 23:55:17,004 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 23:55:17,004 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 23:55:17,004 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 23:55:17,004 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 23:55:17,005 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 23:55:17,005 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 23:55:17,005 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 23:55:17,005 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 23:55:17,005 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 23:55:17,005 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 23:55:17,006 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 23:55:17,006 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 23:55:17,006 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 23:55:17,006 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 23:55:17,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 23:55:17,007 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 23:55:17,007 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 23:55:17,013 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 23:55:17,013 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 23:55:17,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 23:55:17,014 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 23:55:17,014 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 23:55:17,014 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 23:55:17,014 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 23:55:17,014 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 -> b0bf6ee66b233cfe70507a3d8d55aa219725b8ce14e12bc2fdcf83f18b236eff [2021-12-15 23:55:17,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 23:55:17,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 23:55:17,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 23:55:17,220 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 23:55:17,222 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 23:55:17,223 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_add-2.i [2021-12-15 23:55:17,279 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2cbd8d02/d54da3dc15c64b4393e57f5fe988cec3/FLAG573c97396 [2021-12-15 23:55:17,727 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 23:55:17,727 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_add-2.i [2021-12-15 23:55:17,737 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2cbd8d02/d54da3dc15c64b4393e57f5fe988cec3/FLAG573c97396 [2021-12-15 23:55:18,054 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2cbd8d02/d54da3dc15c64b4393e57f5fe988cec3 [2021-12-15 23:55:18,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 23:55:18,057 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 23:55:18,061 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 23:55:18,062 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 23:55:18,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 23:55:18,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:55:18" (1/1) ... [2021-12-15 23:55:18,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68107b75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:55:18, skipping insertion in model container [2021-12-15 23:55:18,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:55:18" (1/1) ... [2021-12-15 23:55:18,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 23:55:18,100 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 23:55:18,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_add-2.i[25793,25806] [2021-12-15 23:55:18,369 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 23:55:18,377 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 23:55:18,447 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_add-2.i[25793,25806] [2021-12-15 23:55:18,452 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 23:55:18,469 INFO L208 MainTranslator]: Completed translation [2021-12-15 23:55:18,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:55:18 WrapperNode [2021-12-15 23:55:18,470 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 23:55:18,471 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 23:55:18,472 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 23:55:18,472 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 23:55:18,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:55:18" (1/1) ... [2021-12-15 23:55:18,491 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:55:18" (1/1) ... [2021-12-15 23:55:18,507 INFO L137 Inliner]: procedures = 135, calls = 46, calls flagged for inlining = 11, calls inlined = 7, statements flattened = 55 [2021-12-15 23:55:18,509 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 23:55:18,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 23:55:18,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 23:55:18,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 23:55:18,515 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:55:18" (1/1) ... [2021-12-15 23:55:18,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:55:18" (1/1) ... [2021-12-15 23:55:18,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:55:18" (1/1) ... [2021-12-15 23:55:18,521 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:55:18" (1/1) ... [2021-12-15 23:55:18,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:55:18" (1/1) ... [2021-12-15 23:55:18,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:55:18" (1/1) ... [2021-12-15 23:55:18,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:55:18" (1/1) ... [2021-12-15 23:55:18,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 23:55:18,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 23:55:18,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 23:55:18,543 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 23:55:18,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:55:18" (1/1) ... [2021-12-15 23:55:18,549 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 23:55:18,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:55:18,567 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-12-15 23:55:18,573 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-12-15 23:55:18,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 23:55:18,602 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2021-12-15 23:55:18,602 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2021-12-15 23:55:18,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 23:55:18,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 23:55:18,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 23:55:18,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 23:55:18,602 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2021-12-15 23:55:18,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2021-12-15 23:55:18,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 23:55:18,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-15 23:55:18,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 23:55:18,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 23:55:18,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 23:55:18,729 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 23:55:18,730 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 23:55:18,844 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 23:55:18,848 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 23:55:18,849 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 23:55:18,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:55:18 BoogieIcfgContainer [2021-12-15 23:55:18,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 23:55:18,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 23:55:18,851 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 23:55:18,858 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 23:55:18,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 11:55:18" (1/3) ... [2021-12-15 23:55:18,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b0a9a16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:55:18, skipping insertion in model container [2021-12-15 23:55:18,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:55:18" (2/3) ... [2021-12-15 23:55:18,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b0a9a16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:55:18, skipping insertion in model container [2021-12-15 23:55:18,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:55:18" (3/3) ... [2021-12-15 23:55:18,860 INFO L111 eAbstractionObserver]: Analyzing ICFG test_add-2.i [2021-12-15 23:55:18,865 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 23:55:18,865 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 23:55:18,913 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 23:55:18,917 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-15 23:55:18,917 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 23:55:18,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:55:18,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-15 23:55:18,930 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:55:18,931 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:55:18,931 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:55:18,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:55:18,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1019691704, now seen corresponding path program 1 times [2021-12-15 23:55:18,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:55:18,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112535208] [2021-12-15 23:55:18,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:55:18,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:55:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:19,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-15 23:55:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:19,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-15 23:55:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:19,076 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 23:55:19,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:55:19,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112535208] [2021-12-15 23:55:19,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112535208] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:55:19,078 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:55:19,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 23:55:19,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084348231] [2021-12-15 23:55:19,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:55:19,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-15 23:55:19,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:55:19,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 23:55:19,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 23:55:19,103 INFO L87 Difference]: Start difference. First operand has 31 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:55:19,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:55:19,116 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2021-12-15 23:55:19,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 23:55:19,118 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2021-12-15 23:55:19,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:55:19,122 INFO L225 Difference]: With dead ends: 59 [2021-12-15 23:55:19,122 INFO L226 Difference]: Without dead ends: 27 [2021-12-15 23:55:19,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 23:55:19,129 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:55:19,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:55:19,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-15 23:55:19,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-12-15 23:55:19,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:55:19,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2021-12-15 23:55:19,158 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 20 [2021-12-15 23:55:19,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:55:19,159 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2021-12-15 23:55:19,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:55:19,159 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2021-12-15 23:55:19,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-15 23:55:19,162 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:55:19,162 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:55:19,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 23:55:19,163 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:55:19,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:55:19,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1544963960, now seen corresponding path program 1 times [2021-12-15 23:55:19,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:55:19,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138821900] [2021-12-15 23:55:19,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:55:19,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:55:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:19,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-15 23:55:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:19,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-15 23:55:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:19,240 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 23:55:19,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:55:19,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138821900] [2021-12-15 23:55:19,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138821900] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:55:19,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35448001] [2021-12-15 23:55:19,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:55:19,241 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:55:19,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:55:19,256 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-12-15 23:55:19,261 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-12-15 23:55:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:19,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 23:55:19,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:55:19,412 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:55:19,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 23:55:19,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35448001] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:55:19,412 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 23:55:19,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2021-12-15 23:55:19,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427134186] [2021-12-15 23:55:19,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:55:19,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 23:55:19,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:55:19,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 23:55:19,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 23:55:19,415 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:55:19,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:55:19,434 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2021-12-15 23:55:19,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 23:55:19,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2021-12-15 23:55:19,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:55:19,436 INFO L225 Difference]: With dead ends: 44 [2021-12-15 23:55:19,437 INFO L226 Difference]: Without dead ends: 31 [2021-12-15 23:55:19,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 23:55:19,438 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:55:19,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:55:19,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-15 23:55:19,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-12-15 23:55:19,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-15 23:55:19,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2021-12-15 23:55:19,447 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 20 [2021-12-15 23:55:19,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:55:19,447 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2021-12-15 23:55:19,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:55:19,448 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2021-12-15 23:55:19,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-15 23:55:19,450 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:55:19,450 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:55:19,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-15 23:55:19,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:55:19,664 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:55:19,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:55:19,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1439032465, now seen corresponding path program 1 times [2021-12-15 23:55:19,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:55:19,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288020511] [2021-12-15 23:55:19,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:55:19,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:55:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:19,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-15 23:55:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:19,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-15 23:55:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:19,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 23:55:19,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:55:19,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288020511] [2021-12-15 23:55:19,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288020511] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:55:19,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758830813] [2021-12-15 23:55:19,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:55:19,816 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:55:19,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:55:19,819 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-12-15 23:55:19,821 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-12-15 23:55:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:19,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-15 23:55:19,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:55:20,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:55:20,089 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 23:55:20,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758830813] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:55:20,090 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 23:55:20,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2021-12-15 23:55:20,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563670174] [2021-12-15 23:55:20,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:55:20,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 23:55:20,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:55:20,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 23:55:20,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-15 23:55:20,093 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:55:20,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:55:20,254 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2021-12-15 23:55:20,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 23:55:20,254 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2021-12-15 23:55:20,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:55:20,256 INFO L225 Difference]: With dead ends: 74 [2021-12-15 23:55:20,256 INFO L226 Difference]: Without dead ends: 34 [2021-12-15 23:55:20,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-12-15 23:55:20,260 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 35 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:55:20,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 95 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:55:20,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-15 23:55:20,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2021-12-15 23:55:20,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:55:20,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2021-12-15 23:55:20,272 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 20 [2021-12-15 23:55:20,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:55:20,272 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2021-12-15 23:55:20,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:55:20,273 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2021-12-15 23:55:20,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 23:55:20,273 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:55:20,273 INFO L514 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, 1, 1] [2021-12-15 23:55:20,290 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-12-15 23:55:20,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-12-15 23:55:20,485 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:55:20,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:55:20,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1950106983, now seen corresponding path program 1 times [2021-12-15 23:55:20,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:55:20,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665403781] [2021-12-15 23:55:20,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:55:20,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:55:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:20,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-15 23:55:20,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:20,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-15 23:55:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:20,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-15 23:55:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:20,685 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 23:55:20,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:55:20,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665403781] [2021-12-15 23:55:20,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665403781] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:55:20,685 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:55:20,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-15 23:55:20,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132660510] [2021-12-15 23:55:20,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:55:20,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-15 23:55:20,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:55:20,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-15 23:55:20,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-12-15 23:55:20,687 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:55:21,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:55:21,006 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2021-12-15 23:55:21,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-15 23:55:21,007 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2021-12-15 23:55:21,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:55:21,008 INFO L225 Difference]: With dead ends: 44 [2021-12-15 23:55:21,008 INFO L226 Difference]: Without dead ends: 37 [2021-12-15 23:55:21,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2021-12-15 23:55:21,009 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 97 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 23:55:21,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 69 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 23:55:21,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-15 23:55:21,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2021-12-15 23:55:21,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:55:21,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2021-12-15 23:55:21,013 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2021-12-15 23:55:21,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:55:21,014 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2021-12-15 23:55:21,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:55:21,014 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2021-12-15 23:55:21,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 23:55:21,015 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:55:21,015 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:55:21,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 23:55:21,015 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:55:21,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:55:21,016 INFO L85 PathProgramCache]: Analyzing trace with hash -375503678, now seen corresponding path program 1 times [2021-12-15 23:55:21,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:55:21,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073952126] [2021-12-15 23:55:21,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:55:21,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:55:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:21,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-15 23:55:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:21,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-15 23:55:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:21,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-15 23:55:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:21,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-15 23:55:21,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:55:21,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073952126] [2021-12-15 23:55:21,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073952126] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:55:21,105 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:55:21,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 23:55:21,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528392961] [2021-12-15 23:55:21,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:55:21,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 23:55:21,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:55:21,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 23:55:21,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 23:55:21,107 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-15 23:55:21,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:55:21,155 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2021-12-15 23:55:21,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 23:55:21,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2021-12-15 23:55:21,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:55:21,156 INFO L225 Difference]: With dead ends: 39 [2021-12-15 23:55:21,156 INFO L226 Difference]: Without dead ends: 33 [2021-12-15 23:55:21,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-15 23:55:21,157 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:55:21,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 73 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:55:21,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-15 23:55:21,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-12-15 23:55:21,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:55:21,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2021-12-15 23:55:21,161 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 29 [2021-12-15 23:55:21,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:55:21,161 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2021-12-15 23:55:21,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-15 23:55:21,162 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2021-12-15 23:55:21,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-15 23:55:21,162 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:55:21,162 INFO L514 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, 1, 1, 1, 1, 1] [2021-12-15 23:55:21,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 23:55:21,163 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:55:21,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:55:21,163 INFO L85 PathProgramCache]: Analyzing trace with hash -714160700, now seen corresponding path program 1 times [2021-12-15 23:55:21,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:55:21,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024947232] [2021-12-15 23:55:21,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:55:21,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:55:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:21,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-15 23:55:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:21,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-15 23:55:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:21,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-15 23:55:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:21,786 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 23:55:21,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:55:21,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024947232] [2021-12-15 23:55:21,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024947232] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:55:21,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532948701] [2021-12-15 23:55:21,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:55:21,787 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:55:21,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:55:21,788 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-12-15 23:55:21,789 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-12-15 23:55:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:21,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 132 conjunts are in the unsatisfiable core [2021-12-15 23:55:21,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:55:22,076 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 7 treesize of output 3 [2021-12-15 23:55:22,126 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 23:55:22,127 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-12-15 23:55:22,275 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 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 23:55:22,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 23:55:22,352 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 7 treesize of output 3 [2021-12-15 23:55:22,452 INFO L354 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2021-12-15 23:55:22,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 130 [2021-12-15 23:55:22,459 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 8 treesize of output 7 [2021-12-15 23:55:22,485 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 8 treesize of output 7 [2021-12-15 23:55:22,496 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 8 treesize of output 7 [2021-12-15 23:55:22,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-12-15 23:55:22,603 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-12-15 23:55:22,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 21 [2021-12-15 23:55:22,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-12-15 23:55:22,646 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-15 23:55:22,657 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-12-15 23:55:22,713 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 7 treesize of output 3 [2021-12-15 23:55:22,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-15 23:55:22,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-15 23:55:22,808 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 7 treesize of output 3 [2021-12-15 23:55:22,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:55:22,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-15 23:55:22,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-15 23:55:22,841 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-15 23:55:22,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2021-12-15 23:55:22,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-15 23:55:22,882 INFO L354 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2021-12-15 23:55:22,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2021-12-15 23:55:22,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-15 23:55:22,895 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-15 23:55:23,021 INFO L354 Elim1Store]: treesize reduction 73, result has 3.9 percent of original size [2021-12-15 23:55:23,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 79 [2021-12-15 23:55:23,046 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-15 23:55:23,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 60 [2021-12-15 23:55:23,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:55:23,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 43 [2021-12-15 23:55:23,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:55:23,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:55:23,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 56 [2021-12-15 23:55:23,085 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 102 treesize of output 84 [2021-12-15 23:55:23,098 INFO L354 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2021-12-15 23:55:23,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 84 treesize of output 73 [2021-12-15 23:55:23,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2021-12-15 23:55:23,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-12-15 23:55:23,430 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:55:23,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:55:23,816 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:55:23,817 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 1528 treesize of output 1526 [2021-12-15 23:55:23,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2070 treesize of output 2054 [2021-12-15 23:55:23,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2330 treesize of output 2322 [2021-12-15 23:55:23,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1160 treesize of output 1158 [2021-12-15 23:55:23,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2320 treesize of output 2316 [2021-12-15 23:55:38,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 206 [2021-12-15 23:55:38,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 62 [2021-12-15 23:55:48,804 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_372 (Array Int Int)) (v_ArrVal_370 Int) (v___ldv_list_add_~next.offset_4 Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_374 (Array Int Int)) (v_arrayElimCell_42 Int) (v_ArrVal_379 (Array Int Int)) (v_arrayElimCell_45 Int) (v_ArrVal_378 (Array Int Int)) (v_ArrVal_369 Int)) (let ((.cse5 (= |c_~#s1~0.base| |c_ULTIMATE.start_ldv_list_add_~head#1.base|)) (.cse16 (select (store (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_ldv_list_add_#t~mem6#1.base| v_ArrVal_379))) (store .cse18 |c_ULTIMATE.start_ldv_list_add_~new#1.base| (store (store (select .cse18 |c_ULTIMATE.start_ldv_list_add_~new#1.base|) |c_ULTIMATE.start_ldv_list_add_~new#1.offset| v_ArrVal_370) (+ |c_ULTIMATE.start_ldv_list_add_~new#1.offset| 4) v_ArrVal_369))) |c_ULTIMATE.start_ldv_list_add_~head#1.base| v_ArrVal_375) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ldv_list_add_#t~mem6#1.base| v_ArrVal_378) |c_ULTIMATE.start_ldv_list_add_~new#1.base| v_ArrVal_374) |c_ULTIMATE.start_ldv_list_add_~head#1.base| (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ldv_list_add_#t~mem6#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ldv_list_add_#t~mem6#1.base|) (+ v___ldv_list_add_~next.offset_4 4) |c_ULTIMATE.start_ldv_list_add_~new#1.base|)) |c_ULTIMATE.start_ldv_list_add_~new#1.base| v_ArrVal_372) |c_ULTIMATE.start_ldv_list_add_~head#1.base|) |c_ULTIMATE.start_ldv_list_add_~head#1.offset| |c_ULTIMATE.start_ldv_list_add_~new#1.base|)) |c_~#s1~0.base|) |c_~#s1~0.offset|))) (.cse17 (= |c_~#s1~0.offset| |c_ULTIMATE.start_ldv_list_add_~head#1.offset|))) (let ((.cse2 (and (= (select .cse16 (+ |c_ULTIMATE.start_ldv_list_add_~new#1.offset| (- 4))) |c_ULTIMATE.start_foo_~j~0#1|) .cse17)) (.cse3 (not .cse17)) (.cse7 (not .cse5)) (.cse14 (= |c_~#s1~0.base| |c_ULTIMATE.start_ldv_list_add_~new#1.base|))) (let ((.cse1 (not .cse14)) (.cse0 (and .cse14 (or (and (or .cse2 (and (= (select .cse16 (+ v_arrayElimCell_42 (- 4))) |c_ULTIMATE.start_foo_~j~0#1|) .cse3)) .cse5) (and (= (select .cse16 (+ v_arrayElimCell_45 (- 4))) |c_ULTIMATE.start_foo_~j~0#1|) .cse7)))) (.cse8 (= |c_~#s1~0.base| |c_ULTIMATE.start_ldv_list_add_#t~mem6#1.base|))) (or (and (or .cse0 (and .cse1 (or (and (or .cse2 (and .cse3 (forall ((v_arrayElimCell_43 Int)) (= (select (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_ldv_list_add_#t~mem6#1.base| v_ArrVal_379))) (store .cse4 |c_ULTIMATE.start_ldv_list_add_~new#1.base| (store (store (select .cse4 |c_ULTIMATE.start_ldv_list_add_~new#1.base|) |c_ULTIMATE.start_ldv_list_add_~new#1.offset| v_ArrVal_370) (+ |c_ULTIMATE.start_ldv_list_add_~new#1.offset| 4) v_ArrVal_369))) |c_ULTIMATE.start_ldv_list_add_~head#1.base| v_ArrVal_375) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ldv_list_add_#t~mem6#1.base| v_ArrVal_378) |c_ULTIMATE.start_ldv_list_add_~new#1.base| v_ArrVal_374) |c_ULTIMATE.start_ldv_list_add_~head#1.base| (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ldv_list_add_#t~mem6#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ldv_list_add_#t~mem6#1.base|) (+ v___ldv_list_add_~next.offset_4 4) |c_ULTIMATE.start_ldv_list_add_~new#1.base|)) |c_ULTIMATE.start_ldv_list_add_~new#1.base| v_ArrVal_372) |c_ULTIMATE.start_ldv_list_add_~head#1.base|) |c_ULTIMATE.start_ldv_list_add_~head#1.offset| |c_ULTIMATE.start_ldv_list_add_~new#1.base|)) |c_~#s1~0.base|) |c_~#s1~0.offset|)) (+ v_arrayElimCell_43 (- 4))) |c_ULTIMATE.start_foo_~j~0#1|)))) .cse5) (and (forall ((v_arrayElimCell_44 Int)) (= (select (select (store (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_ldv_list_add_#t~mem6#1.base| v_ArrVal_379))) (store .cse6 |c_ULTIMATE.start_ldv_list_add_~new#1.base| (store (store (select .cse6 |c_ULTIMATE.start_ldv_list_add_~new#1.base|) |c_ULTIMATE.start_ldv_list_add_~new#1.offset| v_ArrVal_370) (+ |c_ULTIMATE.start_ldv_list_add_~new#1.offset| 4) v_ArrVal_369))) |c_ULTIMATE.start_ldv_list_add_~head#1.base| v_ArrVal_375) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ldv_list_add_#t~mem6#1.base| v_ArrVal_378) |c_ULTIMATE.start_ldv_list_add_~new#1.base| v_ArrVal_374) |c_ULTIMATE.start_ldv_list_add_~head#1.base| (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ldv_list_add_#t~mem6#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ldv_list_add_#t~mem6#1.base|) (+ v___ldv_list_add_~next.offset_4 4) |c_ULTIMATE.start_ldv_list_add_~new#1.base|)) |c_ULTIMATE.start_ldv_list_add_~new#1.base| v_ArrVal_372) |c_ULTIMATE.start_ldv_list_add_~head#1.base|) |c_ULTIMATE.start_ldv_list_add_~head#1.offset| |c_ULTIMATE.start_ldv_list_add_~new#1.base|)) |c_~#s1~0.base|) |c_~#s1~0.offset|)) (+ v_arrayElimCell_44 (- 4))) |c_ULTIMATE.start_foo_~j~0#1|)) .cse7)))) .cse8) (and (or (and (forall ((v_arrayElimCell_46 Int)) (let ((.cse11 (select (store (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_ldv_list_add_#t~mem6#1.base| v_ArrVal_379))) (store .cse13 |c_ULTIMATE.start_ldv_list_add_~new#1.base| (store (store (select .cse13 |c_ULTIMATE.start_ldv_list_add_~new#1.base|) |c_ULTIMATE.start_ldv_list_add_~new#1.offset| v_ArrVal_370) (+ |c_ULTIMATE.start_ldv_list_add_~new#1.offset| 4) v_ArrVal_369))) |c_ULTIMATE.start_ldv_list_add_~head#1.base| v_ArrVal_375) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ldv_list_add_#t~mem6#1.base| v_ArrVal_378) |c_ULTIMATE.start_ldv_list_add_~new#1.base| v_ArrVal_374) |c_ULTIMATE.start_ldv_list_add_~head#1.base| (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ldv_list_add_#t~mem6#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ldv_list_add_#t~mem6#1.base|) (+ v___ldv_list_add_~next.offset_4 4) |c_ULTIMATE.start_ldv_list_add_~new#1.base|)) |c_ULTIMATE.start_ldv_list_add_~new#1.base| v_ArrVal_372) |c_ULTIMATE.start_ldv_list_add_~head#1.base|) |c_ULTIMATE.start_ldv_list_add_~head#1.offset| |c_ULTIMATE.start_ldv_list_add_~new#1.base|)) |c_~#s1~0.base|) |c_~#s1~0.offset|)))) (let ((.cse9 (= (select .cse11 (+ v_arrayElimCell_46 (- 4))) |c_ULTIMATE.start_foo_~j~0#1|)) (.cse12 (= |c_~#s1~0.base| |c_ULTIMATE.start_ldv_list_add_~head#1.base|))) (or (and (let ((.cse10 (= |c_~#s1~0.offset| |c_ULTIMATE.start_ldv_list_add_~head#1.offset|))) (or (and .cse9 (not .cse10)) (and (= (select .cse11 (+ |c_ULTIMATE.start_ldv_list_add_~new#1.offset| (- 4))) |c_ULTIMATE.start_foo_~j~0#1|) .cse10))) .cse12) (and .cse9 (not .cse12)))))) .cse1) .cse0) (not .cse8) (or .cse14 (= |c_ULTIMATE.start_ldv_list_add_~head#1.base| |c_~#s1~0.base|) (forall ((v_arrayElimCell_47 Int)) (= (select (select (store (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_ldv_list_add_#t~mem6#1.base| v_ArrVal_379))) (store .cse15 |c_ULTIMATE.start_ldv_list_add_~new#1.base| (store (store (select .cse15 |c_ULTIMATE.start_ldv_list_add_~new#1.base|) |c_ULTIMATE.start_ldv_list_add_~new#1.offset| v_ArrVal_370) (+ |c_ULTIMATE.start_ldv_list_add_~new#1.offset| 4) v_ArrVal_369))) |c_ULTIMATE.start_ldv_list_add_~head#1.base| v_ArrVal_375) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ldv_list_add_#t~mem6#1.base| v_ArrVal_378) |c_ULTIMATE.start_ldv_list_add_~new#1.base| v_ArrVal_374) |c_ULTIMATE.start_ldv_list_add_~head#1.base| (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ldv_list_add_#t~mem6#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ldv_list_add_#t~mem6#1.base|) (+ v___ldv_list_add_~next.offset_4 4) |c_ULTIMATE.start_ldv_list_add_~new#1.base|)) |c_ULTIMATE.start_ldv_list_add_~new#1.base| v_ArrVal_372) |c_ULTIMATE.start_ldv_list_add_~head#1.base|) |c_ULTIMATE.start_ldv_list_add_~head#1.offset| |c_ULTIMATE.start_ldv_list_add_~new#1.base|)) |c_~#s1~0.base|) |c_~#s1~0.offset|)) (+ v_arrayElimCell_47 (- 4))) |c_ULTIMATE.start_foo_~j~0#1|))))))))) is different from false [2021-12-15 23:55:48,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532948701] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:55:48,808 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 23:55:48,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2021-12-15 23:55:48,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530898017] [2021-12-15 23:55:48,808 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 23:55:48,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-15 23:55:48,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:55:48,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-15 23:55:48,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=898, Unknown=1, NotChecked=60, Total=1056 [2021-12-15 23:55:48,809 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 28 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 25 states have internal predecessors, (46), 5 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-15 23:55:49,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:55:49,620 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2021-12-15 23:55:49,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-15 23:55:49,621 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 25 states have internal predecessors, (46), 5 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 32 [2021-12-15 23:55:49,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:55:49,621 INFO L225 Difference]: With dead ends: 35 [2021-12-15 23:55:49,621 INFO L226 Difference]: Without dead ends: 0 [2021-12-15 23:55:49,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=237, Invalid=1746, Unknown=1, NotChecked=86, Total=2070 [2021-12-15 23:55:49,622 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 59 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 23:55:49,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 119 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 254 Invalid, 0 Unknown, 81 Unchecked, 0.2s Time] [2021-12-15 23:55:49,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-15 23:55:49,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-15 23:55:49,623 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-12-15 23:55:49,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-15 23:55:49,624 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2021-12-15 23:55:49,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:55:49,624 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 23:55:49,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 25 states have internal predecessors, (46), 5 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-15 23:55:49,624 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-15 23:55:49,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-15 23:55:49,626 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-15 23:55:49,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-15 23:55:49,827 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-12-15 23:55:49,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-15 23:55:50,151 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-15 23:55:50,151 INFO L854 garLoopResultBuilder]: At program point L605(line 605) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ldv_list_add_~new#1.base|) (+ |ULTIMATE.start_ldv_list_add_~new#1.offset| (- 4))))) (and (= |ULTIMATE.start_ldv_list_add_~head#1.offset| |~#s1~0.offset|) (not (= |ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.base| 0)) (= (select |#valid| 3) 1) (<= .cse0 |ULTIMATE.start_foo_~j~0#1|) (= 4 |ULTIMATE.start_ldv_list_add_~new#1.offset|) (<= |ULTIMATE.start_foo_~j~0#1| |ULTIMATE.start_ldv_set_add_~new#1|) (not (= |~#s1~0.base| |ULTIMATE.start_ldv_list_add_~new#1.base|)) (= 0 |ULTIMATE.start_ldv_successful_malloc_#res#1.offset|) (= |ULTIMATE.start_ldv_set_add_~s#1.offset| |~#s1~0.offset|) (= |~#s1~0.base| |ULTIMATE.start_ldv_set_add_~s#1.base|) (= |ULTIMATE.start_ldv_list_add_#t~mem6#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_ldv_list_add_~head#1.base|) |ULTIMATE.start_ldv_list_add_~head#1.offset|)) (not (= |~#s1~0.base| |ULTIMATE.start_ldv_successful_malloc_#res#1.base|)) (<= |ULTIMATE.start_ldv_set_add_~new#1| |ULTIMATE.start_foo_~j~0#1|) (= 0 |~#s1~0.offset|) (= |ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.offset| 0) (= |ULTIMATE.start_ldv_list_add_~head#1.base| |~#s1~0.base|) (<= |ULTIMATE.start_foo_~j~0#1| .cse0) (not (= 3 |ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|) |ULTIMATE.start_ldv_set_add_~s#1.base|) (= |ULTIMATE.start_ldv_set_add_~s#1.base| 3))) [2021-12-15 23:55:50,151 INFO L858 garLoopResultBuilder]: For program point L605-1(line 605) no Hoare annotation was computed. [2021-12-15 23:55:50,151 INFO L858 garLoopResultBuilder]: For program point L603(lines 603 606) no Hoare annotation was computed. [2021-12-15 23:55:50,151 INFO L854 garLoopResultBuilder]: At program point L667(line 667) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|))) (let ((.cse0 (select (select |#memory_int| .cse1) 0))) (and (= |ULTIMATE.start_ldv_list_add_~head#1.offset| |~#s1~0.offset|) (= 1 (select |#valid| 3)) (= |~#s1~0.base| 3) (<= .cse0 |ULTIMATE.start_foo_~j~0#1|) (not (= |~#s1~0.base| |ULTIMATE.start_ldv_list_add_~new#1.base|)) (= |ULTIMATE.start_ldv_set_add_~s#1.offset| |~#s1~0.offset|) (not (= |~#s1~0.base| .cse1)) (not (= |~#s1~0.base| |ULTIMATE.start_ldv_successful_malloc_#res#1.base|)) (= 0 |~#s1~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|) 4) (= |ULTIMATE.start_ldv_set_add_~s#1.base| |~#s1~0.base|) (= |ULTIMATE.start_ldv_list_add_~head#1.base| |~#s1~0.base|) (not (= 3 |ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.base|)) (<= |ULTIMATE.start_foo_~j~0#1| .cse0)))) [2021-12-15 23:55:50,151 INFO L858 garLoopResultBuilder]: For program point L667-1(line 667) no Hoare annotation was computed. [2021-12-15 23:55:50,151 INFO L858 garLoopResultBuilder]: For program point L667-2(line 667) no Hoare annotation was computed. [2021-12-15 23:55:50,151 INFO L858 garLoopResultBuilder]: For program point L632(lines 632 639) no Hoare annotation was computed. [2021-12-15 23:55:50,152 INFO L858 garLoopResultBuilder]: For program point L667-3(line 667) no Hoare annotation was computed. [2021-12-15 23:55:50,152 INFO L858 garLoopResultBuilder]: For program point L663(lines 663 668) no Hoare annotation was computed. [2021-12-15 23:55:50,152 INFO L858 garLoopResultBuilder]: For program point L564(lines 564 566) no Hoare annotation was computed. [2021-12-15 23:55:50,152 INFO L861 garLoopResultBuilder]: At program point L672(lines 669 673) the Hoare annotation is: true [2021-12-15 23:55:50,152 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-15 23:55:50,152 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-15 23:55:50,152 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-15 23:55:50,152 INFO L854 garLoopResultBuilder]: At program point L633(line 633) the Hoare annotation is: (and (= (select |#valid| 3) 1) (<= |ULTIMATE.start_ldv_set_add_~new#1| |ULTIMATE.start_foo_~j~0#1|) (= 0 |~#s1~0.offset|) (= |~#s1~0.base| 3) (= (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.offset|) (<= |ULTIMATE.start_foo_~j~0#1| |ULTIMATE.start_ldv_set_add_~new#1|) (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|) |ULTIMATE.start_ldv_set_add_~s#1.base|) (= |ULTIMATE.start_ldv_set_add_~s#1.base| 3) (= |ULTIMATE.start_ldv_set_add_~s#1.offset| |~#s1~0.offset|)) [2021-12-15 23:55:50,152 INFO L858 garLoopResultBuilder]: For program point L633-1(line 633) no Hoare annotation was computed. [2021-12-15 23:55:50,152 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 667) no Hoare annotation was computed. [2021-12-15 23:55:50,152 INFO L858 garLoopResultBuilder]: For program point L633-2(lines 633 638) no Hoare annotation was computed. [2021-12-15 23:55:50,152 INFO L858 garLoopResultBuilder]: For program point L565(line 565) no Hoare annotation was computed. [2021-12-15 23:55:50,152 INFO L854 garLoopResultBuilder]: At program point L578(lines 575 579) the Hoare annotation is: (and (not (= |ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.base| 0)) (= (select |#valid| 3) 1) (= (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.offset|) (<= |ULTIMATE.start_foo_~j~0#1| |ULTIMATE.start_ldv_set_add_~new#1|) (= 0 |ULTIMATE.start_ldv_successful_malloc_#res#1.offset|) (= |~#s1~0.base| |ULTIMATE.start_ldv_set_add_~s#1.base|) (= |ULTIMATE.start_ldv_set_add_~s#1.offset| 0) (not (= |~#s1~0.base| |ULTIMATE.start_ldv_successful_malloc_#res#1.base|)) (<= |ULTIMATE.start_ldv_set_add_~new#1| |ULTIMATE.start_foo_~j~0#1|) (= 0 |~#s1~0.offset|) (= |ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.offset| 0) (not (= 3 |ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|) |ULTIMATE.start_ldv_set_add_~s#1.base|) (= |ULTIMATE.start_ldv_set_add_~s#1.base| 3)) [2021-12-15 23:55:50,152 INFO L858 garLoopResultBuilder]: For program point ldv_is_in_setEXIT(lines 650 658) no Hoare annotation was computed. [2021-12-15 23:55:50,152 INFO L861 garLoopResultBuilder]: At program point ldv_is_in_setENTRY(lines 650 658) the Hoare annotation is: true [2021-12-15 23:55:50,152 INFO L858 garLoopResultBuilder]: For program point ldv_is_in_setFINAL(lines 650 658) no Hoare annotation was computed. [2021-12-15 23:55:50,152 INFO L858 garLoopResultBuilder]: For program point L653(lines 653 655) no Hoare annotation was computed. [2021-12-15 23:55:50,152 INFO L858 garLoopResultBuilder]: For program point L652-2(lines 652 656) no Hoare annotation was computed. [2021-12-15 23:55:50,152 INFO L854 garLoopResultBuilder]: At program point L652-3(lines 652 656) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (.cse0 (select |#valid| 3)) (.cse6 (select (select |#memory_$Pointer$.offset| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|)) (.cse11 (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|)) (.cse8 (not (= |~#s1~0.base| 3))) (.cse2 (= |ldv_is_in_set_#in~s.offset| ldv_is_in_set_~s.offset)) (.cse3 (= |ldv_is_in_set_#in~e| ldv_is_in_set_~e)) (.cse5 (+ ldv_is_in_set_~m~1.offset 4)) (.cse4 (select (select |#memory_$Pointer$.base| ldv_is_in_set_~s.base) ldv_is_in_set_~s.offset)) (.cse10 (not (= 0 |~#s1~0.offset|))) (.cse9 (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|))) (and (let ((.cse7 (= |ldv_is_in_set_#in~s.base| ldv_is_in_set_~s.base))) (or (not (= 1 .cse0)) (= |~#s1~0.base| .cse1) (and .cse2 .cse3 (= ldv_is_in_set_~m~1.base .cse4) (= .cse5 .cse6) .cse7) .cse8 (not (= .cse9 4)) .cse10 (and .cse2 (not (= (select (select |#memory_int| .cse11) (+ .cse6 (- 4))) |ldv_is_in_set_#in~e|)) .cse7))) (or (not (= .cse1 |~#s1~0.base|)) (not (= .cse0 1)) (not (= .cse6 |ldv_is_in_set_#in~s.offset|)) (not (= .cse11 |ldv_is_in_set_#in~s.base|)) .cse8 (and .cse2 .cse3 (= .cse5 (select (select |#memory_$Pointer$.offset| ldv_is_in_set_~s.base) ldv_is_in_set_~s.offset)) (= .cse4 ldv_is_in_set_~m~1.base) (= ldv_is_in_set_~s.base |ldv_is_in_set_#in~s.base|)) .cse10 (not (= .cse9 |~#s1~0.offset|))))) [2021-12-15 23:55:50,153 INFO L858 garLoopResultBuilder]: For program point L652-4(lines 652 656) no Hoare annotation was computed. [2021-12-15 23:55:50,153 INFO L854 garLoopResultBuilder]: At program point __ldv_list_addENTRY(lines 589 597) the Hoare annotation is: (or (not (= 1 (select |#valid| 3))) (not (= |~#s1~0.base| 3)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= 0 |~#s1~0.offset|))) [2021-12-15 23:55:50,153 INFO L858 garLoopResultBuilder]: For program point __ldv_list_addFINAL(lines 589 597) no Hoare annotation was computed. [2021-12-15 23:55:50,153 INFO L858 garLoopResultBuilder]: For program point __ldv_list_addEXIT(lines 589 597) no Hoare annotation was computed. [2021-12-15 23:55:50,155 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2021-12-15 23:55:50,156 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-15 23:55:50,162 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-15 23:55:50,163 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-15 23:55:50,163 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-15 23:55:50,163 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-15 23:55:50,163 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-15 23:55:50,163 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-15 23:55:50,164 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-15 23:55:50,164 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-15 23:55:50,164 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-15 23:55:50,164 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-15 23:55:50,164 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-15 23:55:50,165 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-15 23:55:50,169 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-15 23:55:50,169 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-15 23:55:50,169 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-15 23:55:50,169 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-15 23:55:50,170 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-15 23:55:50,170 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-15 23:55:50,170 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-15 23:55:50,170 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-15 23:55:50,170 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-15 23:55:50,170 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-15 23:55:50,171 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-15 23:55:50,171 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-15 23:55:50,172 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-15 23:55:50,173 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-15 23:55:50,173 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-15 23:55:50,173 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-15 23:55:50,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 11:55:50 BoogieIcfgContainer [2021-12-15 23:55:50,174 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-15 23:55:50,175 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 23:55:50,175 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 23:55:50,175 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 23:55:50,175 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:55:18" (3/4) ... [2021-12-15 23:55:50,177 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-15 23:55:50,181 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_is_in_set [2021-12-15 23:55:50,182 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2021-12-15 23:55:50,184 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2021-12-15 23:55:50,184 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-12-15 23:55:50,185 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-15 23:55:50,185 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-15 23:55:50,198 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(1 == \valid[3]) || s1 == #memory_$Pointer$[s1][s1]) || ((((s == s && \old(e) == e) && m == #memory_$Pointer$[s][s]) && m + 4 == #memory_$Pointer$[s][s]) && s == s)) || !(s1 == 3)) || !(#memory_$Pointer$[s1][s1] == 4)) || !(0 == s1)) || ((s == s && !(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + -4] == \old(e))) && s == s)) && (((((((!(#memory_$Pointer$[s1][s1] == s1) || !(\valid[3] == 1)) || !(#memory_$Pointer$[s][s] == s)) || !(#memory_$Pointer$[s][s] == s)) || !(s1 == 3)) || ((((s == s && \old(e) == e) && m + 4 == #memory_$Pointer$[s][s]) && #memory_$Pointer$[s][s] == m) && s == s)) || !(0 == s1)) || !(#memory_$Pointer$[s1][s1] == s1)) [2021-12-15 23:55:50,199 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(ptr == 0) && \valid[3] == 1) && #memory_$Pointer$[s1][s1] == s1) && j <= new) && 0 == \result) && s1 == s) && s == 0) && !(s1 == \result)) && new <= j) && 0 == s1) && ptr == 0) && !(3 == ptr)) && #memory_$Pointer$[s1][s1] == s) && s == 3 [2021-12-15 23:55:50,207 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-15 23:55:50,208 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 23:55:50,208 INFO L158 Benchmark]: Toolchain (without parser) took 32150.85ms. Allocated memory was 96.5MB in the beginning and 209.7MB in the end (delta: 113.2MB). Free memory was 65.6MB in the beginning and 111.4MB in the end (delta: -45.9MB). Peak memory consumption was 67.3MB. Max. memory is 16.1GB. [2021-12-15 23:55:50,208 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory was 53.2MB in the beginning and 53.2MB in the end (delta: 41.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 23:55:50,209 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.37ms. Allocated memory is still 96.5MB. Free memory was 65.4MB in the beginning and 63.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 23:55:50,209 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.33ms. Allocated memory is still 96.5MB. Free memory was 63.5MB in the beginning and 61.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 23:55:50,209 INFO L158 Benchmark]: Boogie Preprocessor took 33.45ms. Allocated memory is still 96.5MB. Free memory was 61.4MB in the beginning and 60.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 23:55:50,210 INFO L158 Benchmark]: RCFGBuilder took 307.13ms. Allocated memory is still 96.5MB. Free memory was 60.0MB in the beginning and 47.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-15 23:55:50,211 INFO L158 Benchmark]: TraceAbstraction took 31322.85ms. Allocated memory was 96.5MB in the beginning and 209.7MB in the end (delta: 113.2MB). Free memory was 47.0MB in the beginning and 115.6MB in the end (delta: -68.6MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. [2021-12-15 23:55:50,211 INFO L158 Benchmark]: Witness Printer took 33.30ms. Allocated memory is still 209.7MB. Free memory was 115.6MB in the beginning and 111.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-15 23:55:50,213 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory was 53.2MB in the beginning and 53.2MB in the end (delta: 41.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.37ms. Allocated memory is still 96.5MB. Free memory was 65.4MB in the beginning and 63.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.33ms. Allocated memory is still 96.5MB. Free memory was 63.5MB in the beginning and 61.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.45ms. Allocated memory is still 96.5MB. Free memory was 61.4MB in the beginning and 60.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 307.13ms. Allocated memory is still 96.5MB. Free memory was 60.0MB in the beginning and 47.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 31322.85ms. Allocated memory was 96.5MB in the beginning and 209.7MB in the end (delta: 113.2MB). Free memory was 47.0MB in the beginning and 115.6MB in the end (delta: -68.6MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. * Witness Printer took 33.30ms. Allocated memory is still 209.7MB. Free memory was 115.6MB in the beginning and 111.4MB 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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 667]: 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 3 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.2s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 199 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 199 mSDsluCounter, 470 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 81 IncrementalHoareTripleChecker+Unchecked, 323 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 507 IncrementalHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 147 mSDtfsCounter, 507 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 97 SyntacticMatches, 5 SemanticMatches, 84 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=4, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 18 PreInvPairs, 24 NumberOfFragments, 436 HoareAnnotationTreeSize, 18 FomulaSimplifications, 92 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 390 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 28.3s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 213 ConstructedInterpolants, 6 QuantifiedInterpolants, 2916 SizeOfPredicates, 59 NumberOfNonLiveVariables, 543 ConjunctsInSsa, 170 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 33/46 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: 652]: Loop Invariant [2021-12-15 23:55:50,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-15 23:55:50,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-15 23:55:50,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-15 23:55:50,229 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-15 23:55:50,229 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-15 23:55:50,229 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-15 23:55:50,229 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-15 23:55:50,229 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-15 23:55:50,229 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-15 23:55:50,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-15 23:55:50,232 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-15 23:55:50,232 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-15 23:55:50,235 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-15 23:55:50,235 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-15 23:55:50,235 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-15 23:55:50,236 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-15 23:55:50,236 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-15 23:55:50,236 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-15 23:55:50,236 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-15 23:55:50,236 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-15 23:55:50,236 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-15 23:55:50,236 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-15 23:55:50,237 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-15 23:55:50,237 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((!(1 == \valid[3]) || s1 == #memory_$Pointer$[s1][s1]) || ((((s == s && \old(e) == e) && m == #memory_$Pointer$[s][s]) && m + 4 == #memory_$Pointer$[s][s]) && s == s)) || !(s1 == 3)) || !(#memory_$Pointer$[s1][s1] == 4)) || !(0 == s1)) || ((s == s && !(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + -4] == \old(e))) && s == s)) && (((((((!(#memory_$Pointer$[s1][s1] == s1) || !(\valid[3] == 1)) || !(#memory_$Pointer$[s][s] == s)) || !(#memory_$Pointer$[s][s] == s)) || !(s1 == 3)) || ((((s == s && \old(e) == e) && m + 4 == #memory_$Pointer$[s][s]) && #memory_$Pointer$[s][s] == m) && s == s)) || !(0 == s1)) || !(#memory_$Pointer$[s1][s1] == s1)) - InvariantResult [Line: 575]: Loop Invariant [2021-12-15 23:55:50,237 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-15 23:55:50,238 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-15 23:55:50,238 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-15 23:55:50,238 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((!(ptr == 0) && \valid[3] == 1) && #memory_$Pointer$[s1][s1] == s1) && j <= new) && 0 == \result) && s1 == s) && s == 0) && !(s1 == \result)) && new <= j) && 0 == s1) && ptr == 0) && !(3 == ptr)) && #memory_$Pointer$[s1][s1] == s) && s == 3 - InvariantResult [Line: 669]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-12-15 23:55:50,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE