./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/rule60_list2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-regression/rule60_list2.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 2ab50e26e6f5e14d4b2965496bdd00ba16261c4e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 02:09:53,129 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 02:09:53,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 02:09:53,167 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 02:09:53,167 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 02:09:53,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 02:09:53,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 02:09:53,177 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 02:09:53,179 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 02:09:53,182 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 02:09:53,183 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 02:09:53,184 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 02:09:53,184 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 02:09:53,186 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 02:09:53,187 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 02:09:53,191 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 02:09:53,192 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 02:09:53,192 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 02:09:53,194 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 02:09:53,199 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 02:09:53,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 02:09:53,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 02:09:53,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 02:09:53,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 02:09:53,207 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 02:09:53,207 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 02:09:53,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 02:09:53,208 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 02:09:53,209 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 02:09:53,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 02:09:53,209 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 02:09:53,210 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 02:09:53,211 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 02:09:53,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 02:09:53,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 02:09:53,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 02:09:53,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 02:09:53,213 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 02:09:53,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 02:09:53,214 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 02:09:53,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 02:09:53,218 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 02:09:53,246 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 02:09:53,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 02:09:53,247 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 02:09:53,247 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 02:09:53,248 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 02:09:53,248 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 02:09:53,248 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 02:09:53,249 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 02:09:53,249 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 02:09:53,249 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 02:09:53,249 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 02:09:53,250 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 02:09:53,250 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 02:09:53,250 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 02:09:53,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 02:09:53,250 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 02:09:53,250 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 02:09:53,250 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 02:09:53,250 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 02:09:53,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 02:09:53,250 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 02:09:53,250 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 02:09:53,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 02:09:53,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 02:09:53,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 02:09:53,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 02:09:53,251 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 02:09:53,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 02:09:53,251 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 02:09:53,251 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 02:09:53,251 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 -> 2ab50e26e6f5e14d4b2965496bdd00ba16261c4e [2021-08-26 02:09:53,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 02:09:53,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 02:09:53,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 02:09:53,535 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 02:09:53,535 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 02:09:53,536 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/rule60_list2.i [2021-08-26 02:09:53,586 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92ca2e707/e595efca817049e799c5d34ce996784e/FLAG6e9567fd4 [2021-08-26 02:09:53,938 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 02:09:53,939 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule60_list2.i [2021-08-26 02:09:53,950 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92ca2e707/e595efca817049e799c5d34ce996784e/FLAG6e9567fd4 [2021-08-26 02:09:54,339 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92ca2e707/e595efca817049e799c5d34ce996784e [2021-08-26 02:09:54,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 02:09:54,341 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 02:09:54,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 02:09:54,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 02:09:54,347 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 02:09:54,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:09:54" (1/1) ... [2021-08-26 02:09:54,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b92ff66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:09:54, skipping insertion in model container [2021-08-26 02:09:54,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:09:54" (1/1) ... [2021-08-26 02:09:54,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 02:09:54,382 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 02:09:54,467 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule60_list2.i[292,305] [2021-08-26 02:09:54,565 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 02:09:54,578 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 02:09:54,587 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule60_list2.i[292,305] [2021-08-26 02:09:54,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 02:09:54,641 INFO L208 MainTranslator]: Completed translation [2021-08-26 02:09:54,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:09:54 WrapperNode [2021-08-26 02:09:54,641 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 02:09:54,642 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 02:09:54,642 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 02:09:54,642 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 02:09:54,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:09:54" (1/1) ... [2021-08-26 02:09:54,656 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:09:54" (1/1) ... [2021-08-26 02:09:54,672 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 02:09:54,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 02:09:54,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 02:09:54,673 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 02:09:54,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:09:54" (1/1) ... [2021-08-26 02:09:54,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:09:54" (1/1) ... [2021-08-26 02:09:54,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:09:54" (1/1) ... [2021-08-26 02:09:54,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:09:54" (1/1) ... [2021-08-26 02:09:54,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:09:54" (1/1) ... [2021-08-26 02:09:54,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:09:54" (1/1) ... [2021-08-26 02:09:54,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:09:54" (1/1) ... [2021-08-26 02:09:54,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 02:09:54,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 02:09:54,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 02:09:54,688 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 02:09:54,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:09:54" (1/1) ... [2021-08-26 02:09:54,696 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 02:09:54,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 02:09:54,710 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 02:09:54,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 02:09:54,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 02:09:54,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-08-26 02:09:54,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 02:09:54,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 02:09:54,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 02:09:55,067 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 02:09:55,067 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2021-08-26 02:09:55,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:09:55 BoogieIcfgContainer [2021-08-26 02:09:55,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 02:09:55,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 02:09:55,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 02:09:55,072 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 02:09:55,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 02:09:54" (1/3) ... [2021-08-26 02:09:55,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17070d71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:09:55, skipping insertion in model container [2021-08-26 02:09:55,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:09:54" (2/3) ... [2021-08-26 02:09:55,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17070d71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:09:55, skipping insertion in model container [2021-08-26 02:09:55,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:09:55" (3/3) ... [2021-08-26 02:09:55,074 INFO L111 eAbstractionObserver]: Analyzing ICFG rule60_list2.i [2021-08-26 02:09:55,077 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 02:09:55,077 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-08-26 02:09:55,105 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 02:09:55,109 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 02:09:55,109 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-08-26 02:09:55,119 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 34 states have (on average 1.5) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:09:55,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-08-26 02:09:55,123 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:09:55,123 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-08-26 02:09:55,124 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 02:09:55,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:09:55,127 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2021-08-26 02:09:55,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:09:55,133 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903110438] [2021-08-26 02:09:55,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:09:55,133 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:09:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:09:55,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:09:55,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:09:55,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903110438] [2021-08-26 02:09:55,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903110438] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:09:55,276 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:09:55,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 02:09:55,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633787568] [2021-08-26 02:09:55,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 02:09:55,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:09:55,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 02:09:55,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 02:09:55,306 INFO L87 Difference]: Start difference. First operand has 40 states, 34 states have (on average 1.5) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:09:55,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:09:55,338 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2021-08-26 02:09:55,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 02:09:55,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-08-26 02:09:55,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:09:55,344 INFO L225 Difference]: With dead ends: 73 [2021-08-26 02:09:55,345 INFO L226 Difference]: Without dead ends: 30 [2021-08-26 02:09:55,347 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 02:09:55,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-08-26 02:09:55,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-08-26 02:09:55,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:09:55,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2021-08-26 02:09:55,370 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 4 [2021-08-26 02:09:55,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:09:55,371 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2021-08-26 02:09:55,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:09:55,372 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2021-08-26 02:09:55,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-26 02:09:55,372 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:09:55,372 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:09:55,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 02:09:55,373 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 02:09:55,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:09:55,376 INFO L82 PathProgramCache]: Analyzing trace with hash 170685048, now seen corresponding path program 1 times [2021-08-26 02:09:55,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:09:55,377 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144646124] [2021-08-26 02:09:55,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:09:55,377 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:09:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:09:55,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:09:55,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:09:55,492 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144646124] [2021-08-26 02:09:55,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144646124] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:09:55,492 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:09:55,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 02:09:55,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984007478] [2021-08-26 02:09:55,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 02:09:55,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:09:55,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 02:09:55,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 02:09:55,494 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:09:55,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:09:55,552 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2021-08-26 02:09:55,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 02:09:55,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-08-26 02:09:55,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:09:55,553 INFO L225 Difference]: With dead ends: 52 [2021-08-26 02:09:55,554 INFO L226 Difference]: Without dead ends: 32 [2021-08-26 02:09:55,554 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 49.9ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-26 02:09:55,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-08-26 02:09:55,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2021-08-26 02:09:55,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:09:55,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2021-08-26 02:09:55,559 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 15 [2021-08-26 02:09:55,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:09:55,560 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2021-08-26 02:09:55,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:09:55,565 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2021-08-26 02:09:55,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-26 02:09:55,565 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:09:55,565 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:09:55,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 02:09:55,566 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 02:09:55,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:09:55,566 INFO L82 PathProgramCache]: Analyzing trace with hash 227943350, now seen corresponding path program 1 times [2021-08-26 02:09:55,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:09:55,566 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544093751] [2021-08-26 02:09:55,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:09:55,566 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:09:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:09:55,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:09:55,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:09:55,657 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544093751] [2021-08-26 02:09:55,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544093751] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:09:55,657 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:09:55,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 02:09:55,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907206327] [2021-08-26 02:09:55,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 02:09:55,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:09:55,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 02:09:55,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 02:09:55,659 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:09:55,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:09:55,681 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2021-08-26 02:09:55,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 02:09:55,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-08-26 02:09:55,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:09:55,682 INFO L225 Difference]: With dead ends: 55 [2021-08-26 02:09:55,682 INFO L226 Difference]: Without dead ends: 30 [2021-08-26 02:09:55,683 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.6ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 02:09:55,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-08-26 02:09:55,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-08-26 02:09:55,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:09:55,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2021-08-26 02:09:55,685 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 15 [2021-08-26 02:09:55,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:09:55,686 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2021-08-26 02:09:55,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:09:55,686 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2021-08-26 02:09:55,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-26 02:09:55,686 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:09:55,687 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:09:55,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 02:09:55,687 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 02:09:55,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:09:55,687 INFO L82 PathProgramCache]: Analyzing trace with hash 929007928, now seen corresponding path program 1 times [2021-08-26 02:09:55,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:09:55,688 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39968092] [2021-08-26 02:09:55,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:09:55,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:09:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:09:55,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:09:55,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:09:55,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39968092] [2021-08-26 02:09:55,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39968092] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:09:55,796 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:09:55,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-26 02:09:55,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915520185] [2021-08-26 02:09:55,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 02:09:55,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:09:55,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 02:09:55,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-08-26 02:09:55,798 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:09:55,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:09:55,920 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2021-08-26 02:09:55,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-26 02:09:55,921 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-08-26 02:09:55,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:09:55,922 INFO L225 Difference]: With dead ends: 42 [2021-08-26 02:09:55,922 INFO L226 Difference]: Without dead ends: 34 [2021-08-26 02:09:55,923 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 76.7ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-08-26 02:09:55,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-08-26 02:09:55,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2021-08-26 02:09:55,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:09:55,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2021-08-26 02:09:55,930 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 15 [2021-08-26 02:09:55,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:09:55,931 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2021-08-26 02:09:55,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:09:55,931 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2021-08-26 02:09:55,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-26 02:09:55,932 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:09:55,932 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:09:55,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 02:09:55,933 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 02:09:55,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:09:55,934 INFO L82 PathProgramCache]: Analyzing trace with hash -93151004, now seen corresponding path program 1 times [2021-08-26 02:09:55,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:09:55,934 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017118420] [2021-08-26 02:09:55,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:09:55,935 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:09:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:09:56,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:09:56,071 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:09:56,071 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017118420] [2021-08-26 02:09:56,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017118420] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:09:56,071 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:09:56,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-26 02:09:56,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732211637] [2021-08-26 02:09:56,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-26 02:09:56,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:09:56,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-26 02:09:56,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-08-26 02:09:56,086 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:09:56,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:09:56,293 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2021-08-26 02:09:56,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 02:09:56,294 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-08-26 02:09:56,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:09:56,296 INFO L225 Difference]: With dead ends: 38 [2021-08-26 02:09:56,296 INFO L226 Difference]: Without dead ends: 36 [2021-08-26 02:09:56,297 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 189.6ms TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-08-26 02:09:56,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-08-26 02:09:56,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2021-08-26 02:09:56,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:09:56,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2021-08-26 02:09:56,307 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 19 [2021-08-26 02:09:56,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:09:56,308 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2021-08-26 02:09:56,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:09:56,308 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2021-08-26 02:09:56,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-26 02:09:56,308 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:09:56,309 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:09:56,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-26 02:09:56,309 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 02:09:56,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:09:56,313 INFO L82 PathProgramCache]: Analyzing trace with hash -93091422, now seen corresponding path program 1 times [2021-08-26 02:09:56,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:09:56,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155380901] [2021-08-26 02:09:56,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:09:56,314 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:09:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:09:56,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:09:56,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:09:56,420 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155380901] [2021-08-26 02:09:56,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155380901] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:09:56,421 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:09:56,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-26 02:09:56,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86002178] [2021-08-26 02:09:56,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 02:09:56,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:09:56,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 02:09:56,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-08-26 02:09:56,427 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:09:56,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:09:56,587 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2021-08-26 02:09:56,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 02:09:56,588 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-08-26 02:09:56,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:09:56,588 INFO L225 Difference]: With dead ends: 32 [2021-08-26 02:09:56,593 INFO L226 Difference]: Without dead ends: 30 [2021-08-26 02:09:56,594 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 135.5ms TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-08-26 02:09:56,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-08-26 02:09:56,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-08-26 02:09:56,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:09:56,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2021-08-26 02:09:56,599 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 19 [2021-08-26 02:09:56,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:09:56,599 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2021-08-26 02:09:56,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:09:56,599 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2021-08-26 02:09:56,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-26 02:09:56,600 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:09:56,600 INFO L512 BasicCegarLoop]: trace histogram [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-08-26 02:09:56,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-26 02:09:56,601 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 02:09:56,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:09:56,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1793070580, now seen corresponding path program 1 times [2021-08-26 02:09:56,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:09:56,605 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706203709] [2021-08-26 02:09:56,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:09:56,605 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:09:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:09:56,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:09:56,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:09:56,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706203709] [2021-08-26 02:09:56,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706203709] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:09:56,686 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:09:56,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-26 02:09:56,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463150053] [2021-08-26 02:09:56,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 02:09:56,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:09:56,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 02:09:56,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-08-26 02:09:56,687 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:09:56,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:09:56,781 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2021-08-26 02:09:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 02:09:56,783 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-08-26 02:09:56,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:09:56,784 INFO L225 Difference]: With dead ends: 34 [2021-08-26 02:09:56,784 INFO L226 Difference]: Without dead ends: 30 [2021-08-26 02:09:56,785 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 80.9ms TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-08-26 02:09:56,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-08-26 02:09:56,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-08-26 02:09:56,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:09:56,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2021-08-26 02:09:56,793 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 25 [2021-08-26 02:09:56,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:09:56,793 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2021-08-26 02:09:56,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:09:56,793 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2021-08-26 02:09:56,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-26 02:09:56,794 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:09:56,794 INFO L512 BasicCegarLoop]: trace histogram [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-08-26 02:09:56,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-26 02:09:56,794 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 02:09:56,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:09:56,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1793130162, now seen corresponding path program 1 times [2021-08-26 02:09:56,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:09:56,795 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498769286] [2021-08-26 02:09:56,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:09:56,795 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:09:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:09:56,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:09:56,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:09:56,897 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498769286] [2021-08-26 02:09:56,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498769286] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:09:56,897 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:09:56,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-26 02:09:56,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519955600] [2021-08-26 02:09:56,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-26 02:09:56,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:09:56,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-26 02:09:56,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-08-26 02:09:56,898 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:09:57,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:09:57,072 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2021-08-26 02:09:57,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 02:09:57,073 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-08-26 02:09:57,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:09:57,076 INFO L225 Difference]: With dead ends: 36 [2021-08-26 02:09:57,076 INFO L226 Difference]: Without dead ends: 26 [2021-08-26 02:09:57,076 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 162.1ms TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-08-26 02:09:57,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-08-26 02:09:57,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-08-26 02:09:57,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:09:57,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2021-08-26 02:09:57,081 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 25 [2021-08-26 02:09:57,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:09:57,081 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2021-08-26 02:09:57,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:09:57,081 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2021-08-26 02:09:57,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-26 02:09:57,082 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:09:57,082 INFO L512 BasicCegarLoop]: trace histogram [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-08-26 02:09:57,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-26 02:09:57,082 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 02:09:57,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:09:57,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1850388464, now seen corresponding path program 1 times [2021-08-26 02:09:57,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:09:57,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239493032] [2021-08-26 02:09:57,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:09:57,083 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:09:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:09:57,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:09:57,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:09:57,271 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239493032] [2021-08-26 02:09:57,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239493032] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:09:57,272 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:09:57,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-26 02:09:57,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854337652] [2021-08-26 02:09:57,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 02:09:57,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:09:57,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 02:09:57,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-08-26 02:09:57,276 INFO L87 Difference]: Start difference. First operand 26 states and 25 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:09:57,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:09:57,498 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2021-08-26 02:09:57,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-26 02:09:57,498 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-08-26 02:09:57,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:09:57,499 INFO L225 Difference]: With dead ends: 26 [2021-08-26 02:09:57,499 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 02:09:57,499 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 237.0ms TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2021-08-26 02:09:57,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 02:09:57,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 02:09:57,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:09:57,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 02:09:57,499 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2021-08-26 02:09:57,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:09:57,500 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 02:09:57,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:09:57,500 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 02:09:57,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 02:09:57,505 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 02:09:57,506 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 02:09:57,506 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 02:09:57,507 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 02:09:57,507 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 02:09:57,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-26 02:09:57,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-26 02:09:57,512 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:09:57,513 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:09:57,524 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:09:57,538 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:09:57,543 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 02:09:57,702 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-08-26 02:09:57,702 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-08-26 02:09:57,703 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-26 02:09:57,703 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-26 02:09:57,703 INFO L857 garLoopResultBuilder]: For program point L540(lines 540 543) no Hoare annotation was computed. [2021-08-26 02:09:57,703 INFO L857 garLoopResultBuilder]: For program point L524(lines 524 525) no Hoare annotation was computed. [2021-08-26 02:09:57,703 INFO L857 garLoopResultBuilder]: For program point L524-1(lines 524 525) no Hoare annotation was computed. [2021-08-26 02:09:57,703 INFO L857 garLoopResultBuilder]: For program point L549(lines 549 554) no Hoare annotation was computed. [2021-08-26 02:09:57,703 INFO L857 garLoopResultBuilder]: For program point L4(lines 1 556) no Hoare annotation was computed. [2021-08-26 02:09:57,703 INFO L857 garLoopResultBuilder]: For program point L549-1(lines 549 554) no Hoare annotation was computed. [2021-08-26 02:09:57,704 INFO L857 garLoopResultBuilder]: For program point L4-1(lines 1 556) no Hoare annotation was computed. [2021-08-26 02:09:57,704 INFO L857 garLoopResultBuilder]: For program point L4-2(lines 1 556) no Hoare annotation was computed. [2021-08-26 02:09:57,704 INFO L857 garLoopResultBuilder]: For program point L4-3(lines 1 556) no Hoare annotation was computed. [2021-08-26 02:09:57,704 INFO L857 garLoopResultBuilder]: For program point L4-4(lines 1 556) no Hoare annotation was computed. [2021-08-26 02:09:57,704 INFO L857 garLoopResultBuilder]: For program point L541(lines 541 542) no Hoare annotation was computed. [2021-08-26 02:09:57,704 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-08-26 02:09:57,706 INFO L853 garLoopResultBuilder]: At program point L526(lines 520 527) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___getMemory_~size 8)) (.cse1 (= |ULTIMATE.start___getMemory_#res.base| 0))) (or (and .cse0 (= |ULTIMATE.start___getMemory_#res.offset| 0) .cse1) (and (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset) .cse0 (= ~elem~0.offset 0) (<= 1 ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset 1) (= ~guard_malloc_counter~0.base 0) .cse1))) [2021-08-26 02:09:57,707 INFO L853 garLoopResultBuilder]: At program point L526-1(lines 520 527) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start___getMemory_#res.base| 0)) (.cse1 (= ULTIMATE.start___getMemory_~size 8)) (.cse0 (= ULTIMATE.start_main_~dev1~0.offset 0))) (or (and (not .cse0) (<= 2 ~guard_malloc_counter~0.offset) .cse1 (<= |ULTIMATE.start___getMemory_#res.offset| 2) (<= (+ ULTIMATE.start_main_~dev1~0.offset 1) |ULTIMATE.start___getMemory_#res.offset|) (= ~elem~0.offset 0) (<= 2 |ULTIMATE.start___getMemory_#res.offset|) (<= ~guard_malloc_counter~0.offset 2) (= ~guard_malloc_counter~0.base 0) .cse2) (and .cse1 (= |ULTIMATE.start___getMemory_#res.offset| 0) .cse2) (and .cse1 (= ULTIMATE.start_main_~dev1~0.base 0) .cse0))) [2021-08-26 02:09:57,707 INFO L857 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2021-08-26 02:09:57,707 INFO L857 garLoopResultBuilder]: For program point L6-1(line 6) no Hoare annotation was computed. [2021-08-26 02:09:57,707 INFO L857 garLoopResultBuilder]: For program point L6-2(line 6) no Hoare annotation was computed. [2021-08-26 02:09:57,707 INFO L857 garLoopResultBuilder]: For program point L6-3(line 6) no Hoare annotation was computed. [2021-08-26 02:09:57,707 INFO L857 garLoopResultBuilder]: For program point L6-4(line 6) no Hoare annotation was computed. [2021-08-26 02:09:57,708 INFO L857 garLoopResultBuilder]: For program point L535(lines 535 539) no Hoare annotation was computed. [2021-08-26 02:09:57,708 INFO L857 garLoopResultBuilder]: For program point L535-1(lines 535 539) no Hoare annotation was computed. [2021-08-26 02:09:57,708 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-26 02:09:57,708 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-08-26 02:09:57,708 INFO L857 garLoopResultBuilder]: For program point L536(line 536) no Hoare annotation was computed. [2021-08-26 02:09:57,708 INFO L857 garLoopResultBuilder]: For program point L536-2(line 536) no Hoare annotation was computed. [2021-08-26 02:09:57,708 INFO L857 garLoopResultBuilder]: For program point L536-4(line 536) no Hoare annotation was computed. [2021-08-26 02:09:57,708 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-26 02:09:57,708 INFO L857 garLoopResultBuilder]: For program point L537(lines 537 538) no Hoare annotation was computed. [2021-08-26 02:09:57,709 INFO L857 garLoopResultBuilder]: For program point L537-2(lines 537 538) no Hoare annotation was computed. [2021-08-26 02:09:57,709 INFO L857 garLoopResultBuilder]: For program point L537-4(lines 537 538) no Hoare annotation was computed. [2021-08-26 02:09:57,709 INFO L853 garLoopResultBuilder]: At program point L529(lines 528 530) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___getMemory_~size 8)) (.cse1 (= |ULTIMATE.start_my_malloc_#res.base| 0)) (.cse2 (= |ULTIMATE.start___getMemory_#res.base| 0))) (or (and (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset) .cse0 (<= |ULTIMATE.start_my_malloc_#res.offset| ~guard_malloc_counter~0.offset) .cse1 (= ~elem~0.offset 0) (<= 1 ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset 1) (= ~guard_malloc_counter~0.base 0) .cse2) (and (= 0 |ULTIMATE.start_my_malloc_#res.offset|) .cse0 (= |ULTIMATE.start___getMemory_#res.offset| 0) .cse1 .cse2))) [2021-08-26 02:09:57,709 INFO L853 garLoopResultBuilder]: At program point L529-1(lines 528 530) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_my_malloc_#res.base| 0)) (.cse2 (= |ULTIMATE.start___getMemory_#res.base| 0)) (.cse0 (= ULTIMATE.start___getMemory_~size 8)) (.cse3 (= ULTIMATE.start_main_~dev1~0.offset 0))) (or (and (= 0 |ULTIMATE.start_my_malloc_#res.offset|) .cse0 (= |ULTIMATE.start___getMemory_#res.offset| 0) .cse1 .cse2) (and (not .cse3) .cse0 (<= |ULTIMATE.start_my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (<= |ULTIMATE.start___getMemory_#res.offset| 2) .cse1 (<= (+ ULTIMATE.start_main_~dev1~0.offset 1) |ULTIMATE.start___getMemory_#res.offset|) (= ~elem~0.offset 0) (<= 2 |ULTIMATE.start_my_malloc_#res.offset|) (<= 2 |ULTIMATE.start___getMemory_#res.offset|) (<= ~guard_malloc_counter~0.offset 2) (= ~guard_malloc_counter~0.base 0) .cse2) (and .cse0 (= ULTIMATE.start_main_~dev1~0.base 0) .cse3))) [2021-08-26 02:09:57,709 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-08-26 02:09:57,709 INFO L853 garLoopResultBuilder]: At program point L555(lines 545 556) the Hoare annotation is: (= ULTIMATE.start___getMemory_~size 8) [2021-08-26 02:09:57,710 INFO L857 garLoopResultBuilder]: For program point L522(line 522) no Hoare annotation was computed. [2021-08-26 02:09:57,710 INFO L857 garLoopResultBuilder]: For program point L522-2(line 522) no Hoare annotation was computed. [2021-08-26 02:09:57,714 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 02:09:57,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 02:09:57 BoogieIcfgContainer [2021-08-26 02:09:57,747 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 02:09:57,748 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 02:09:57,748 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 02:09:57,748 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 02:09:57,748 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:09:55" (3/4) ... [2021-08-26 02:09:57,750 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-26 02:09:57,756 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2021-08-26 02:09:57,757 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-08-26 02:09:57,757 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 02:09:57,757 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 02:09:57,770 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((size == 8 && \result == 0) && \result == 0) || ((((((\result <= guard_malloc_counter && size == 8) && elem == 0) && 1 <= guard_malloc_counter) && guard_malloc_counter <= 1) && guard_malloc_counter == 0) && \result == 0) [2021-08-26 02:09:57,770 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result <= guard_malloc_counter && size == 8) && \result <= guard_malloc_counter) && \result == 0) && elem == 0) && 1 <= guard_malloc_counter) && guard_malloc_counter <= 1) && guard_malloc_counter == 0) && \result == 0) || ((((0 == \result && size == 8) && \result == 0) && \result == 0) && \result == 0) [2021-08-26 02:09:57,771 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(dev1 == 0) && 2 <= guard_malloc_counter) && size == 8) && \result <= 2) && dev1 + 1 <= \result) && elem == 0) && 2 <= \result) && guard_malloc_counter <= 2) && guard_malloc_counter == 0) && \result == 0) || ((size == 8 && \result == 0) && \result == 0)) || ((size == 8 && dev1 == 0) && dev1 == 0) [2021-08-26 02:09:57,771 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == \result && size == 8) && \result == 0) && \result == 0) && \result == 0) || (((((((((((!(dev1 == 0) && size == 8) && \result <= guard_malloc_counter) && \result <= 2) && \result == 0) && dev1 + 1 <= \result) && elem == 0) && 2 <= \result) && 2 <= \result) && guard_malloc_counter <= 2) && guard_malloc_counter == 0) && \result == 0)) || ((size == 8 && dev1 == 0) && dev1 == 0) [2021-08-26 02:09:57,779 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 02:09:57,779 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 02:09:57,780 INFO L168 Benchmark]: Toolchain (without parser) took 3438.36 ms. Allocated memory was 54.5 MB in the beginning and 98.6 MB in the end (delta: 44.0 MB). Free memory was 30.5 MB in the beginning and 75.1 MB in the end (delta: -44.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 02:09:57,780 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 54.5 MB. Free memory was 36.8 MB in the beginning and 36.8 MB in the end (delta: 36.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 02:09:57,780 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.01 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 30.3 MB in the beginning and 44.7 MB in the end (delta: -14.4 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. [2021-08-26 02:09:57,781 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.56 ms. Allocated memory is still 67.1 MB. Free memory was 44.7 MB in the beginning and 42.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 02:09:57,781 INFO L168 Benchmark]: Boogie Preprocessor took 14.52 ms. Allocated memory is still 67.1 MB. Free memory was 42.7 MB in the beginning and 41.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 02:09:57,781 INFO L168 Benchmark]: RCFGBuilder took 380.95 ms. Allocated memory is still 67.1 MB. Free memory was 41.2 MB in the beginning and 42.9 MB in the end (delta: -1.7 MB). Peak memory consumption was 20.3 MB. Max. memory is 16.1 GB. [2021-08-26 02:09:57,781 INFO L168 Benchmark]: TraceAbstraction took 2677.43 ms. Allocated memory was 67.1 MB in the beginning and 98.6 MB in the end (delta: 31.5 MB). Free memory was 42.6 MB in the beginning and 79.3 MB in the end (delta: -36.7 MB). Peak memory consumption was 43.2 MB. Max. memory is 16.1 GB. [2021-08-26 02:09:57,781 INFO L168 Benchmark]: Witness Printer took 31.60 ms. Allocated memory is still 98.6 MB. Free memory was 79.3 MB in the beginning and 75.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-26 02:09:57,782 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.10 ms. Allocated memory is still 54.5 MB. Free memory was 36.8 MB in the beginning and 36.8 MB in the end (delta: 36.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 298.01 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 30.3 MB in the beginning and 44.7 MB in the end (delta: -14.4 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 30.56 ms. Allocated memory is still 67.1 MB. Free memory was 44.7 MB in the beginning and 42.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 14.52 ms. Allocated memory is still 67.1 MB. Free memory was 42.7 MB in the beginning and 41.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 380.95 ms. Allocated memory is still 67.1 MB. Free memory was 41.2 MB in the beginning and 42.9 MB in the end (delta: -1.7 MB). Peak memory consumption was 20.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 2677.43 ms. Allocated memory was 67.1 MB in the beginning and 98.6 MB in the end (delta: 31.5 MB). Free memory was 42.6 MB in the beginning and 79.3 MB in the end (delta: -36.7 MB). Peak memory consumption was 43.2 MB. Max. memory is 16.1 GB. * Witness Printer took 31.60 ms. Allocated memory is still 98.6 MB. Free memory was 79.3 MB in the beginning and 75.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 6]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 6]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 6]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 6]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 6]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 40 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 2609.4ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 10.2ms, AutomataDifference: 1159.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 194.0ms, InitialAbstractionConstructionTime: 7.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 204 SDtfs, 571 SDslu, 480 SDs, 0 SdLazy, 638 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 323.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 956.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 57.6ms AutomataMinimizationTime, 9 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 16 NumberOfFragments, 203 HoareAnnotationTreeSize, 5 FomulaSimplifications, 64 FormulaSimplificationTreeSizeReduction, 36.7ms HoareSimplificationTime, 5 FomulaSimplificationsInter, 17 FormulaSimplificationTreeSizeReductionInter, 152.1ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 30.5ms SsaConstructionTime, 118.1ms SatisfiabilityAnalysisTime, 846.9ms InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 153 ConstructedInterpolants, 0 QuantifiedInterpolants, 782 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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 5 specifications checked. All of them hold - InvariantResult [Line: 545]: Loop Invariant Derived loop invariant: size == 8 - InvariantResult [Line: 520]: Loop Invariant Derived loop invariant: ((size == 8 && \result == 0) && \result == 0) || ((((((\result <= guard_malloc_counter && size == 8) && elem == 0) && 1 <= guard_malloc_counter) && guard_malloc_counter <= 1) && guard_malloc_counter == 0) && \result == 0) - InvariantResult [Line: 520]: Loop Invariant Derived loop invariant: ((((((((((!(dev1 == 0) && 2 <= guard_malloc_counter) && size == 8) && \result <= 2) && dev1 + 1 <= \result) && elem == 0) && 2 <= \result) && guard_malloc_counter <= 2) && guard_malloc_counter == 0) && \result == 0) || ((size == 8 && \result == 0) && \result == 0)) || ((size == 8 && dev1 == 0) && dev1 == 0) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: (((((0 == \result && size == 8) && \result == 0) && \result == 0) && \result == 0) || (((((((((((!(dev1 == 0) && size == 8) && \result <= guard_malloc_counter) && \result <= 2) && \result == 0) && dev1 + 1 <= \result) && elem == 0) && 2 <= \result) && 2 <= \result) && guard_malloc_counter <= 2) && guard_malloc_counter == 0) && \result == 0)) || ((size == 8 && dev1 == 0) && dev1 == 0) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((((((\result <= guard_malloc_counter && size == 8) && \result <= guard_malloc_counter) && \result == 0) && elem == 0) && 1 <= guard_malloc_counter) && guard_malloc_counter <= 1) && guard_malloc_counter == 0) && \result == 0) || ((((0 == \result && size == 8) && \result == 0) && \result == 0) && \result == 0) RESULT: Ultimate proved your program to be correct! [2021-08-26 02:09:57,810 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...