./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/loop-invgen/SpamAssassin-loop.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 0ad27fb086e75bf8f5b08286d8e766d07abfe44ff39234568924cf55ade7a6d5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 15:35:35,146 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:35:35,148 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:35:35,190 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:35:35,191 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:35:35,192 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:35:35,194 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:35:35,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:35:35,197 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:35:35,201 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:35:35,202 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:35:35,204 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:35:35,204 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:35:35,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:35:35,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:35:35,209 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:35:35,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:35:35,211 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:35:35,212 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:35:35,217 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:35:35,218 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:35:35,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:35:35,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:35:35,220 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:35:35,222 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:35:35,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:35:35,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:35:35,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:35:35,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:35:35,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:35:35,230 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:35:35,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:35:35,232 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:35:35,232 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:35:35,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:35:35,234 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:35:35,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:35:35,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:35:35,235 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:35:35,235 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:35:35,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:35:35,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:35:35,238 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 15:35:35,270 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:35:35,270 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:35:35,271 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:35:35,271 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:35:35,271 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:35:35,272 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:35:35,272 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:35:35,272 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:35:35,272 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:35:35,273 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:35:35,273 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:35:35,274 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 15:35:35,274 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:35:35,274 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:35:35,274 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:35:35,274 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:35:35,274 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:35:35,275 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:35:35,275 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:35:35,275 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:35:35,275 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:35:35,275 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:35:35,275 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:35:35,276 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:35:35,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:35:35,276 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:35:35,276 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:35:35,276 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:35:35,277 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 15:35:35,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 15:35:35,277 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:35:35,277 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:35:35,277 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:35:35,277 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 -> 0ad27fb086e75bf8f5b08286d8e766d07abfe44ff39234568924cf55ade7a6d5 [2022-07-13 15:35:35,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:35:35,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:35:35,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:35:35,539 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:35:35,540 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:35:35,541 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i [2022-07-13 15:35:35,595 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95e6a2aff/881c85d15f0345c9930003600b726368/FLAG0cd48616e [2022-07-13 15:35:35,945 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:35:35,945 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i [2022-07-13 15:35:35,954 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95e6a2aff/881c85d15f0345c9930003600b726368/FLAG0cd48616e [2022-07-13 15:35:36,381 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95e6a2aff/881c85d15f0345c9930003600b726368 [2022-07-13 15:35:36,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:35:36,386 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:35:36,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:35:36,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:35:36,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:35:36,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:35:36" (1/1) ... [2022-07-13 15:35:36,397 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@493ab15c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:35:36, skipping insertion in model container [2022-07-13 15:35:36,397 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:35:36" (1/1) ... [2022-07-13 15:35:36,402 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:35:36,432 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:35:36,621 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i[893,906] [2022-07-13 15:35:36,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:35:36,661 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:35:36,674 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i[893,906] [2022-07-13 15:35:36,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:35:36,691 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:35:36,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:35:36 WrapperNode [2022-07-13 15:35:36,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:35:36,692 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:35:36,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:35:36,693 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:35:36,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:35:36" (1/1) ... [2022-07-13 15:35:36,703 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:35:36" (1/1) ... [2022-07-13 15:35:36,716 INFO L137 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 79 [2022-07-13 15:35:36,717 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:35:36,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:35:36,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:35:36,719 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:35:36,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:35:36" (1/1) ... [2022-07-13 15:35:36,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:35:36" (1/1) ... [2022-07-13 15:35:36,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:35:36" (1/1) ... [2022-07-13 15:35:36,726 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:35:36" (1/1) ... [2022-07-13 15:35:36,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:35:36" (1/1) ... [2022-07-13 15:35:36,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:35:36" (1/1) ... [2022-07-13 15:35:36,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:35:36" (1/1) ... [2022-07-13 15:35:36,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:35:36,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:35:36,734 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:35:36,734 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:35:36,735 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:35:36" (1/1) ... [2022-07-13 15:35:36,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:35:36,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:35:36,757 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 15:35:36,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 15:35:36,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:35:36,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 15:35:36,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:35:36,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:35:36,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 15:35:36,785 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 15:35:36,828 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:35:36,829 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:35:36,954 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:35:36,959 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:35:36,963 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 15:35:36,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:35:36 BoogieIcfgContainer [2022-07-13 15:35:36,969 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:35:36,980 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:35:36,980 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:35:36,983 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:35:36,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:35:36" (1/3) ... [2022-07-13 15:35:36,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b7ad831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:35:36, skipping insertion in model container [2022-07-13 15:35:36,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:35:36" (2/3) ... [2022-07-13 15:35:36,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b7ad831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:35:36, skipping insertion in model container [2022-07-13 15:35:36,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:35:36" (3/3) ... [2022-07-13 15:35:36,988 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2022-07-13 15:35:37,000 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:35:37,011 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 15:35:37,078 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:35:37,085 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@9693d4e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1d2fe87f [2022-07-13 15:35:37,086 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 15:35:37,099 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-13 15:35:37,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 15:35:37,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:35:37,105 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:35:37,105 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:35:37,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:35:37,109 INFO L85 PathProgramCache]: Analyzing trace with hash -667640892, now seen corresponding path program 1 times [2022-07-13 15:35:37,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:35:37,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374944195] [2022-07-13 15:35:37,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:35:37,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:35:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:37,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:35:37,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:35:37,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374944195] [2022-07-13 15:35:37,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374944195] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:35:37,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:35:37,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 15:35:37,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112955330] [2022-07-13 15:35:37,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:35:37,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:35:37,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:35:37,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:35:37,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:35:37,361 INFO L87 Difference]: Start difference. First operand has 38 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:37,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:35:37,481 INFO L93 Difference]: Finished difference Result 79 states and 142 transitions. [2022-07-13 15:35:37,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:35:37,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-13 15:35:37,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:35:37,490 INFO L225 Difference]: With dead ends: 79 [2022-07-13 15:35:37,490 INFO L226 Difference]: Without dead ends: 40 [2022-07-13 15:35:37,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:35:37,496 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 11 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:35:37,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 141 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:35:37,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-13 15:35:37,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2022-07-13 15:35:37,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-13 15:35:37,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2022-07-13 15:35:37,541 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 55 transitions. Word has length 10 [2022-07-13 15:35:37,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:35:37,542 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 55 transitions. [2022-07-13 15:35:37,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:37,542 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 55 transitions. [2022-07-13 15:35:37,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 15:35:37,543 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:35:37,543 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:35:37,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 15:35:37,544 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:35:37,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:35:37,545 INFO L85 PathProgramCache]: Analyzing trace with hash -689596859, now seen corresponding path program 1 times [2022-07-13 15:35:37,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:35:37,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012503387] [2022-07-13 15:35:37,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:35:37,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:35:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:37,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:35:37,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:35:37,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012503387] [2022-07-13 15:35:37,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012503387] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:35:37,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:35:37,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 15:35:37,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078624991] [2022-07-13 15:35:37,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:35:37,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:35:37,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:35:37,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:35:37,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:35:37,591 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:37,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:35:37,675 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2022-07-13 15:35:37,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:35:37,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-13 15:35:37,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:35:37,677 INFO L225 Difference]: With dead ends: 53 [2022-07-13 15:35:37,677 INFO L226 Difference]: Without dead ends: 51 [2022-07-13 15:35:37,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:35:37,679 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 7 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:35:37,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 166 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:35:37,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-13 15:35:37,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2022-07-13 15:35:37,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-07-13 15:35:37,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 63 transitions. [2022-07-13 15:35:37,693 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 63 transitions. Word has length 10 [2022-07-13 15:35:37,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:35:37,693 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 63 transitions. [2022-07-13 15:35:37,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:37,694 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2022-07-13 15:35:37,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 15:35:37,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:35:37,695 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:35:37,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 15:35:37,695 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:35:37,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:35:37,696 INFO L85 PathProgramCache]: Analyzing trace with hash 214778336, now seen corresponding path program 1 times [2022-07-13 15:35:37,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:35:37,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528591785] [2022-07-13 15:35:37,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:35:37,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:35:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:37,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 15:35:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:37,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:35:37,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:35:37,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528591785] [2022-07-13 15:35:37,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528591785] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:35:37,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:35:37,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 15:35:37,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158399532] [2022-07-13 15:35:37,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:35:37,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:35:37,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:35:37,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:35:37,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:35:37,764 INFO L87 Difference]: Start difference. First operand 47 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 15:35:37,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:35:37,840 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2022-07-13 15:35:37,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:35:37,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-07-13 15:35:37,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:35:37,842 INFO L225 Difference]: With dead ends: 53 [2022-07-13 15:35:37,843 INFO L226 Difference]: Without dead ends: 51 [2022-07-13 15:35:37,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:35:37,844 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:35:37,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 107 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:35:37,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-13 15:35:37,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-07-13 15:35:37,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-07-13 15:35:37,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2022-07-13 15:35:37,856 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 15 [2022-07-13 15:35:37,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:35:37,857 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2022-07-13 15:35:37,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 15:35:37,857 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2022-07-13 15:35:37,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 15:35:37,858 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:35:37,858 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:35:37,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 15:35:37,859 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:35:37,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:35:37,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1804674308, now seen corresponding path program 1 times [2022-07-13 15:35:37,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:35:37,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99009110] [2022-07-13 15:35:37,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:35:37,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:35:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:37,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 15:35:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:37,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 15:35:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:37,965 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 15:35:37,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:35:37,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99009110] [2022-07-13 15:35:37,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99009110] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:35:37,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:35:37,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 15:35:37,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991553819] [2022-07-13 15:35:37,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:35:37,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:35:37,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:35:37,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:35:37,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:35:37,970 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 15:35:38,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:35:38,121 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2022-07-13 15:35:38,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 15:35:38,121 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-07-13 15:35:38,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:35:38,124 INFO L225 Difference]: With dead ends: 57 [2022-07-13 15:35:38,125 INFO L226 Difference]: Without dead ends: 55 [2022-07-13 15:35:38,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-13 15:35:38,134 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 17 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:35:38,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 144 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:35:38,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-13 15:35:38,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-07-13 15:35:38,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-07-13 15:35:38,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-07-13 15:35:38,159 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 20 [2022-07-13 15:35:38,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:35:38,159 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2022-07-13 15:35:38,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 15:35:38,160 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-07-13 15:35:38,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-13 15:35:38,162 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:35:38,162 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:35:38,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 15:35:38,163 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:35:38,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:35:38,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1749987360, now seen corresponding path program 1 times [2022-07-13 15:35:38,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:35:38,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654765459] [2022-07-13 15:35:38,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:35:38,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:35:38,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:38,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 15:35:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:38,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 15:35:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:38,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 15:35:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:38,257 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 15:35:38,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:35:38,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654765459] [2022-07-13 15:35:38,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654765459] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:35:38,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:35:38,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 15:35:38,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524124486] [2022-07-13 15:35:38,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:35:38,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:35:38,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:35:38,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:35:38,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:35:38,258 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 15:35:38,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:35:38,332 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2022-07-13 15:35:38,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:35:38,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-07-13 15:35:38,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:35:38,338 INFO L225 Difference]: With dead ends: 62 [2022-07-13 15:35:38,338 INFO L226 Difference]: Without dead ends: 60 [2022-07-13 15:35:38,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:35:38,342 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 9 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:35:38,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 117 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:35:38,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-13 15:35:38,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-07-13 15:35:38,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-07-13 15:35:38,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2022-07-13 15:35:38,359 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 25 [2022-07-13 15:35:38,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:35:38,359 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2022-07-13 15:35:38,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 15:35:38,360 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-07-13 15:35:38,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 15:35:38,361 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:35:38,361 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:35:38,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 15:35:38,361 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:35:38,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:35:38,362 INFO L85 PathProgramCache]: Analyzing trace with hash 158999923, now seen corresponding path program 1 times [2022-07-13 15:35:38,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:35:38,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461812110] [2022-07-13 15:35:38,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:35:38,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:35:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:38,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 15:35:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:38,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 15:35:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:38,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 15:35:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:38,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 15:35:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:38,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 15:35:38,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:38,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 15:35:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:38,487 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-13 15:35:38,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:35:38,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461812110] [2022-07-13 15:35:38,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461812110] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:35:38,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:35:38,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 15:35:38,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466579213] [2022-07-13 15:35:38,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:35:38,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:35:38,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:35:38,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:35:38,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:35:38,491 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-13 15:35:38,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:35:38,601 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2022-07-13 15:35:38,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 15:35:38,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2022-07-13 15:35:38,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:35:38,605 INFO L225 Difference]: With dead ends: 71 [2022-07-13 15:35:38,605 INFO L226 Difference]: Without dead ends: 69 [2022-07-13 15:35:38,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:35:38,607 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 13 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:35:38,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 141 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:35:38,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-13 15:35:38,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2022-07-13 15:35:38,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 17 states have call successors, (17), 8 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-07-13 15:35:38,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2022-07-13 15:35:38,635 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 43 [2022-07-13 15:35:38,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:35:38,635 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2022-07-13 15:35:38,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-13 15:35:38,636 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-07-13 15:35:38,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-13 15:35:38,639 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:35:38,639 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:35:38,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 15:35:38,641 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:35:38,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:35:38,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1329631219, now seen corresponding path program 1 times [2022-07-13 15:35:38,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:35:38,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805149281] [2022-07-13 15:35:38,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:35:38,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:35:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:38,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 15:35:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:38,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 15:35:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:38,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 15:35:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:38,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 15:35:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:38,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 15:35:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:38,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 15:35:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:38,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 15:35:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:38,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 15:35:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:38,734 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-13 15:35:38,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:35:38,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805149281] [2022-07-13 15:35:38,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805149281] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:35:38,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:35:38,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 15:35:38,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609639422] [2022-07-13 15:35:38,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:35:38,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 15:35:38,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:35:38,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 15:35:38,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:35:38,737 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 15:35:38,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:35:38,841 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2022-07-13 15:35:38,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 15:35:38,841 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 53 [2022-07-13 15:35:38,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:35:38,842 INFO L225 Difference]: With dead ends: 71 [2022-07-13 15:35:38,843 INFO L226 Difference]: Without dead ends: 69 [2022-07-13 15:35:38,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-07-13 15:35:38,844 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 20 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:35:38,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 139 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:35:38,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-13 15:35:38,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-07-13 15:35:38,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 40 states have (on average 1.1) internal successors, (44), 41 states have internal predecessors, (44), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-07-13 15:35:38,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2022-07-13 15:35:38,855 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 53 [2022-07-13 15:35:38,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:35:38,856 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2022-07-13 15:35:38,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 15:35:38,856 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2022-07-13 15:35:38,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-13 15:35:38,857 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:35:38,858 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:35:38,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 15:35:38,858 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:35:38,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:35:38,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1418667265, now seen corresponding path program 1 times [2022-07-13 15:35:38,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:35:38,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210402490] [2022-07-13 15:35:38,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:35:38,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:35:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:38,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 15:35:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:38,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 15:35:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:38,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 15:35:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:38,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 15:35:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:38,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 15:35:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:38,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 15:35:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:38,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 15:35:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:38,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 15:35:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:38,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 15:35:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:38,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 15:35:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:35:38,938 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-13 15:35:38,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:35:38,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210402490] [2022-07-13 15:35:38,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210402490] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:35:38,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:35:38,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 15:35:38,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050165322] [2022-07-13 15:35:38,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:35:38,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 15:35:38,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:35:38,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 15:35:38,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 15:35:38,944 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 15:35:39,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:35:39,081 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2022-07-13 15:35:39,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 15:35:39,081 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 64 [2022-07-13 15:35:39,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:35:39,082 INFO L225 Difference]: With dead ends: 69 [2022-07-13 15:35:39,082 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 15:35:39,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-07-13 15:35:39,083 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 17 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:35:39,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 148 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:35:39,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 15:35:39,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 15:35:39,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:35:39,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 15:35:39,084 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2022-07-13 15:35:39,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:35:39,084 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 15:35:39,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 15:35:39,085 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 15:35:39,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 15:35:39,087 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 15:35:39,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 15:35:39,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 15:35:39,365 INFO L895 garLoopResultBuilder]: At program point L35-2(lines 35 64) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-07-13 15:35:39,365 INFO L899 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2022-07-13 15:35:39,365 INFO L899 garLoopResultBuilder]: For program point L60(line 60) no Hoare annotation was computed. [2022-07-13 15:35:39,366 INFO L895 garLoopResultBuilder]: At program point L56(lines 36 63) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-07-13 15:35:39,366 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-07-13 15:35:39,366 INFO L895 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (and (<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-07-13 15:35:39,366 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-07-13 15:35:39,366 INFO L895 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-07-13 15:35:39,366 INFO L895 garLoopResultBuilder]: At program point L40-1(line 40) the Hoare annotation is: (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-07-13 15:35:39,366 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 63) no Hoare annotation was computed. [2022-07-13 15:35:39,366 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 15:35:39,366 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 15:35:39,366 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 15:35:39,366 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-07-13 15:35:39,367 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2022-07-13 15:35:39,367 INFO L899 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2022-07-13 15:35:39,367 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-07-13 15:35:39,367 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-07-13 15:35:39,367 INFO L895 garLoopResultBuilder]: At program point L37-1(line 37) the Hoare annotation is: (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-07-13 15:35:39,367 INFO L902 garLoopResultBuilder]: At program point L66(lines 24 67) the Hoare annotation is: true [2022-07-13 15:35:39,367 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 15:35:39,367 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-07-13 15:35:39,367 INFO L895 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-07-13 15:35:39,367 INFO L895 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-07-13 15:35:39,367 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-07-13 15:35:39,368 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-07-13 15:35:39,368 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 65) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-07-13 15:35:39,368 INFO L899 garLoopResultBuilder]: For program point L34-3(lines 34 65) no Hoare annotation was computed. [2022-07-13 15:35:39,368 INFO L895 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-07-13 15:35:39,368 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-07-13 15:35:39,368 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2022-07-13 15:35:39,368 INFO L899 garLoopResultBuilder]: For program point L39(line 39) no Hoare annotation was computed. [2022-07-13 15:35:39,368 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-07-13 15:35:39,368 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-07-13 15:35:39,368 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-07-13 15:35:39,368 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-07-13 15:35:39,369 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-07-13 15:35:39,369 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-07-13 15:35:39,371 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:35:39,372 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 15:35:39,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 03:35:39 BoogieIcfgContainer [2022-07-13 15:35:39,392 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 15:35:39,392 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 15:35:39,393 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 15:35:39,393 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 15:35:39,393 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:35:36" (3/4) ... [2022-07-13 15:35:39,395 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 15:35:39,400 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-13 15:35:39,404 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-13 15:35:39,405 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-13 15:35:39,405 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 15:35:39,405 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 15:35:39,443 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 15:35:39,443 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 15:35:39,444 INFO L158 Benchmark]: Toolchain (without parser) took 3058.33ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 64.6MB in the beginning and 87.9MB in the end (delta: -23.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 15:35:39,445 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 15:35:39,447 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.34ms. Allocated memory is still 100.7MB. Free memory was 64.5MB in the beginning and 77.2MB in the end (delta: -12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 15:35:39,448 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.02ms. Allocated memory is still 100.7MB. Free memory was 77.2MB in the beginning and 75.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 15:35:39,448 INFO L158 Benchmark]: Boogie Preprocessor took 15.49ms. Allocated memory is still 100.7MB. Free memory was 75.5MB in the beginning and 74.6MB in the end (delta: 962.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:35:39,448 INFO L158 Benchmark]: RCFGBuilder took 234.67ms. Allocated memory is still 100.7MB. Free memory was 74.6MB in the beginning and 63.7MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 15:35:39,449 INFO L158 Benchmark]: TraceAbstraction took 2411.67ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 63.4MB in the beginning and 90.9MB in the end (delta: -27.6MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. [2022-07-13 15:35:39,449 INFO L158 Benchmark]: Witness Printer took 51.20ms. Allocated memory is still 121.6MB. Free memory was 90.9MB in the beginning and 87.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:35:39,451 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.19ms. Allocated memory is still 100.7MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.34ms. Allocated memory is still 100.7MB. Free memory was 64.5MB in the beginning and 77.2MB in the end (delta: -12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.02ms. Allocated memory is still 100.7MB. Free memory was 77.2MB in the beginning and 75.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 15.49ms. Allocated memory is still 100.7MB. Free memory was 75.5MB in the beginning and 74.6MB in the end (delta: 962.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 234.67ms. Allocated memory is still 100.7MB. Free memory was 74.6MB in the beginning and 63.7MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2411.67ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 63.4MB in the beginning and 90.9MB in the end (delta: -27.6MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. * Witness Printer took 51.20ms. Allocated memory is still 121.6MB. Free memory was 90.9MB in the beginning and 87.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 172 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 104 mSDsluCounter, 1103 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 733 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 691 IncrementalHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 370 mSDtfsCounter, 691 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=7, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 52 PreInvPairs, 74 NumberOfFragments, 365 HoareAnnotationTreeSize, 52 FomulaSimplifications, 170 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 532 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 232 ConstructedInterpolants, 0 QuantifiedInterpolants, 512 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 428/428 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((i + 1 <= len && 0 <= j) && 5 + j <= bufsize) && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (0 <= j && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: 0 <= i && limit + 4 <= bufsize RESULT: Ultimate proved your program to be correct! [2022-07-13 15:35:39,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE