./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Primes.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Primes.c -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 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 15:10:27,954 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 15:10:27,956 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 15:10:27,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 15:10:27,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 15:10:27,980 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 15:10:27,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 15:10:27,986 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 15:10:27,987 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 15:10:27,987 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 15:10:27,988 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 15:10:27,991 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 15:10:27,992 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 15:10:27,992 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 15:10:27,993 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 15:10:27,995 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 15:10:27,996 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 15:10:27,998 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 15:10:27,999 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 15:10:28,002 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 15:10:28,003 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 15:10:28,007 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 15:10:28,008 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 15:10:28,008 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 15:10:28,010 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 15:10:28,013 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 15:10:28,013 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 15:10:28,014 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 15:10:28,014 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 15:10:28,014 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 15:10:28,015 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 15:10:28,016 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 15:10:28,016 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 15:10:28,017 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 15:10:28,018 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 15:10:28,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 15:10:28,019 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 15:10:28,019 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 15:10:28,019 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 15:10:28,020 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 15:10:28,020 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 15:10:28,021 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 15:10:28,046 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 15:10:28,046 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 15:10:28,047 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 15:10:28,047 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 15:10:28,048 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 15:10:28,048 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 15:10:28,048 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 15:10:28,049 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 15:10:28,049 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 15:10:28,049 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 15:10:28,050 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 15:10:28,050 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 15:10:28,050 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 15:10:28,050 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 15:10:28,050 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 15:10:28,050 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 15:10:28,050 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 15:10:28,051 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 15:10:28,051 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 15:10:28,051 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 15:10:28,051 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 15:10:28,051 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 15:10:28,051 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 15:10:28,051 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 15:10:28,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 15:10:28,052 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 15:10:28,052 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 15:10:28,053 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 15:10:28,053 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 15:10:28,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 15:10:28,053 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 15:10:28,053 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 15:10:28,054 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 15:10:28,054 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 15:10:28,054 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 -> 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e [2021-12-17 15:10:28,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 15:10:28,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 15:10:28,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 15:10:28,272 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 15:10:28,273 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 15:10:28,273 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Primes.c [2021-12-17 15:10:28,322 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eb2d49fb/e08ac4a70e2347b28c8dde569c8221b9/FLAGacf479fca [2021-12-17 15:10:28,687 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 15:10:28,688 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Primes.c [2021-12-17 15:10:28,692 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eb2d49fb/e08ac4a70e2347b28c8dde569c8221b9/FLAGacf479fca [2021-12-17 15:10:28,701 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eb2d49fb/e08ac4a70e2347b28c8dde569c8221b9 [2021-12-17 15:10:28,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 15:10:28,703 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 15:10:28,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 15:10:28,705 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 15:10:28,707 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 15:10:28,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 03:10:28" (1/1) ... [2021-12-17 15:10:28,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a26bbdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:10:28, skipping insertion in model container [2021-12-17 15:10:28,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 03:10:28" (1/1) ... [2021-12-17 15:10:28,712 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 15:10:28,721 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 15:10:28,876 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/recursive/Primes.c[2190,2203] [2021-12-17 15:10:28,878 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 15:10:28,883 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 15:10:28,895 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/recursive/Primes.c[2190,2203] [2021-12-17 15:10:28,896 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 15:10:28,905 INFO L208 MainTranslator]: Completed translation [2021-12-17 15:10:28,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:10:28 WrapperNode [2021-12-17 15:10:28,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 15:10:28,906 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 15:10:28,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 15:10:28,906 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 15:10:28,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:10:28" (1/1) ... [2021-12-17 15:10:28,919 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:10:28" (1/1) ... [2021-12-17 15:10:28,930 INFO L137 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2021-12-17 15:10:28,930 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 15:10:28,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 15:10:28,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 15:10:28,931 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 15:10:28,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:10:28" (1/1) ... [2021-12-17 15:10:28,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:10:28" (1/1) ... [2021-12-17 15:10:28,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:10:28" (1/1) ... [2021-12-17 15:10:28,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:10:28" (1/1) ... [2021-12-17 15:10:28,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:10:28" (1/1) ... [2021-12-17 15:10:28,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:10:28" (1/1) ... [2021-12-17 15:10:28,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:10:28" (1/1) ... [2021-12-17 15:10:28,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 15:10:28,955 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 15:10:28,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 15:10:28,956 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 15:10:28,956 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:10:28" (1/1) ... [2021-12-17 15:10:28,967 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 15:10:28,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:10:28,983 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 15:10:28,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 15:10:29,009 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2021-12-17 15:10:29,010 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2021-12-17 15:10:29,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 15:10:29,010 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2021-12-17 15:10:29,011 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2021-12-17 15:10:29,011 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2021-12-17 15:10:29,013 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2021-12-17 15:10:29,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 15:10:29,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 15:10:29,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 15:10:29,062 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 15:10:29,063 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 15:10:29,171 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 15:10:29,175 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 15:10:29,175 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-17 15:10:29,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 03:10:29 BoogieIcfgContainer [2021-12-17 15:10:29,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 15:10:29,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 15:10:29,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 15:10:29,180 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 15:10:29,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 03:10:28" (1/3) ... [2021-12-17 15:10:29,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@462c4e89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 03:10:29, skipping insertion in model container [2021-12-17 15:10:29,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:10:28" (2/3) ... [2021-12-17 15:10:29,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@462c4e89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 03:10:29, skipping insertion in model container [2021-12-17 15:10:29,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 03:10:29" (3/3) ... [2021-12-17 15:10:29,182 INFO L111 eAbstractionObserver]: Analyzing ICFG Primes.c [2021-12-17 15:10:29,185 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 15:10:29,185 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 15:10:29,240 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 15:10:29,244 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 15:10:29,245 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 15:10:29,258 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 39 states have internal predecessors, (56), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-12-17 15:10:29,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-17 15:10:29,275 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:10:29,276 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:10:29,276 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:10:29,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:10:29,280 INFO L85 PathProgramCache]: Analyzing trace with hash 691245353, now seen corresponding path program 1 times [2021-12-17 15:10:29,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:10:29,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419781212] [2021-12-17 15:10:29,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:10:29,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:10:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:10:29,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:10:29,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419781212] [2021-12-17 15:10:29,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419781212] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:10:29,495 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:10:29,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 15:10:29,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544232967] [2021-12-17 15:10:29,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:10:29,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:10:29,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:10:29,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:10:29,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 15:10:29,525 INFO L87 Difference]: Start difference. First operand has 52 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 39 states have internal predecessors, (56), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 15:10:29,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:10:29,555 INFO L93 Difference]: Finished difference Result 58 states and 80 transitions. [2021-12-17 15:10:29,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:10:29,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-12-17 15:10:29,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:10:29,566 INFO L225 Difference]: With dead ends: 58 [2021-12-17 15:10:29,566 INFO L226 Difference]: Without dead ends: 49 [2021-12-17 15:10:29,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 15:10:29,574 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:10:29,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:10:29,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-12-17 15:10:29,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2021-12-17 15:10:29,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 36 states have internal predecessors, (48), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-12-17 15:10:29,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2021-12-17 15:10:29,601 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 15 [2021-12-17 15:10:29,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:10:29,602 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2021-12-17 15:10:29,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 15:10:29,602 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2021-12-17 15:10:29,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-17 15:10:29,604 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:10:29,604 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:10:29,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 15:10:29,604 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:10:29,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:10:29,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1873142352, now seen corresponding path program 1 times [2021-12-17 15:10:29,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:10:29,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698484406] [2021-12-17 15:10:29,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:10:29,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:10:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 15:10:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:10:29,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:10:29,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698484406] [2021-12-17 15:10:29,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698484406] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:10:29,682 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:10:29,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 15:10:29,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247301796] [2021-12-17 15:10:29,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:10:29,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 15:10:29,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:10:29,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 15:10:29,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:10:29,685 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 15:10:29,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:10:29,729 INFO L93 Difference]: Finished difference Result 71 states and 93 transitions. [2021-12-17 15:10:29,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 15:10:29,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2021-12-17 15:10:29,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:10:29,732 INFO L225 Difference]: With dead ends: 71 [2021-12-17 15:10:29,733 INFO L226 Difference]: Without dead ends: 51 [2021-12-17 15:10:29,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-17 15:10:29,735 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 4 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:10:29,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 367 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:10:29,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-12-17 15:10:29,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-12-17 15:10:29,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2021-12-17 15:10:29,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2021-12-17 15:10:29,748 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 22 [2021-12-17 15:10:29,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:10:29,748 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2021-12-17 15:10:29,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 15:10:29,749 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2021-12-17 15:10:29,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-17 15:10:29,751 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:10:29,751 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:10:29,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 15:10:29,752 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:10:29,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:10:29,752 INFO L85 PathProgramCache]: Analyzing trace with hash 2039437329, now seen corresponding path program 1 times [2021-12-17 15:10:29,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:10:29,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267244668] [2021-12-17 15:10:29,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:10:29,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:10:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:10:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:10:29,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:10:29,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267244668] [2021-12-17 15:10:29,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267244668] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:10:29,813 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:10:29,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 15:10:29,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610943131] [2021-12-17 15:10:29,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:10:29,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 15:10:29,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:10:29,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 15:10:29,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:10:29,815 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 15:10:29,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:10:29,844 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2021-12-17 15:10:29,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 15:10:29,844 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2021-12-17 15:10:29,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:10:29,847 INFO L225 Difference]: With dead ends: 57 [2021-12-17 15:10:29,847 INFO L226 Difference]: Without dead ends: 53 [2021-12-17 15:10:29,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:10:29,848 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 5 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:10:29,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 247 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:10:29,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-17 15:10:29,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-12-17 15:10:29,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 40 states have internal predecessors, (50), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2021-12-17 15:10:29,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2021-12-17 15:10:29,860 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 23 [2021-12-17 15:10:29,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:10:29,861 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2021-12-17 15:10:29,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 15:10:29,861 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2021-12-17 15:10:29,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-17 15:10:29,864 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:10:29,864 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:10:29,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 15:10:29,864 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:10:29,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:10:29,865 INFO L85 PathProgramCache]: Analyzing trace with hash -502167403, now seen corresponding path program 1 times [2021-12-17 15:10:29,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:10:29,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196252475] [2021-12-17 15:10:29,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:10:29,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:10:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:10:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:10:29,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:10:29,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196252475] [2021-12-17 15:10:29,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196252475] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:10:29,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:10:29,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 15:10:29,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180944789] [2021-12-17 15:10:29,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:10:29,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:10:29,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:10:29,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:10:29,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:10:29,936 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 15:10:29,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:10:29,968 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2021-12-17 15:10:29,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 15:10:29,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2021-12-17 15:10:29,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:10:29,969 INFO L225 Difference]: With dead ends: 59 [2021-12-17 15:10:29,969 INFO L226 Difference]: Without dead ends: 55 [2021-12-17 15:10:29,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:10:29,971 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 9 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:10:29,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 210 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:10:29,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-17 15:10:29,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2021-12-17 15:10:29,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 40 states have internal predecessors, (50), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2021-12-17 15:10:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2021-12-17 15:10:29,977 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 24 [2021-12-17 15:10:29,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:10:29,977 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2021-12-17 15:10:29,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 15:10:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2021-12-17 15:10:29,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-17 15:10:29,978 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:10:29,979 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:10:29,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 15:10:29,979 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:10:29,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:10:29,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1717699423, now seen corresponding path program 1 times [2021-12-17 15:10:29,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:10:29,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844544444] [2021-12-17 15:10:29,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:10:29,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:10:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:30,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:30,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:10:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:30,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:10:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:30,053 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 15:10:30,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:10:30,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844544444] [2021-12-17 15:10:30,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844544444] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:10:30,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506159936] [2021-12-17 15:10:30,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:10:30,057 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:10:30,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:10:30,064 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:10:30,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 15:10:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:30,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 15:10:30,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:10:30,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 15:10:30,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 15:10:30,426 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 15:10:30,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506159936] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 15:10:30,427 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 15:10:30,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2021-12-17 15:10:30,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201115451] [2021-12-17 15:10:30,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 15:10:30,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-17 15:10:30,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:10:30,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-17 15:10:30,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-17 15:10:30,430 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-17 15:10:30,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:10:30,533 INFO L93 Difference]: Finished difference Result 68 states and 90 transitions. [2021-12-17 15:10:30,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 15:10:30,534 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 31 [2021-12-17 15:10:30,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:10:30,536 INFO L225 Difference]: With dead ends: 68 [2021-12-17 15:10:30,536 INFO L226 Difference]: Without dead ends: 51 [2021-12-17 15:10:30,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2021-12-17 15:10:30,544 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 36 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:10:30,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 374 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:10:30,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-12-17 15:10:30,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-12-17 15:10:30,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 39 states have internal predecessors, (47), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2021-12-17 15:10:30,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2021-12-17 15:10:30,549 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 31 [2021-12-17 15:10:30,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:10:30,549 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2021-12-17 15:10:30,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-17 15:10:30,549 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2021-12-17 15:10:30,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-17 15:10:30,550 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:10:30,550 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:10:30,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-17 15:10:30,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:10:30,756 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:10:30,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:10:30,756 INFO L85 PathProgramCache]: Analyzing trace with hash 380831863, now seen corresponding path program 1 times [2021-12-17 15:10:30,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:10:30,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319993682] [2021-12-17 15:10:30,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:10:30,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:10:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:30,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:30,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:10:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:30,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:10:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:30,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 15:10:30,879 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:10:30,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319993682] [2021-12-17 15:10:30,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319993682] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:10:30,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334542587] [2021-12-17 15:10:30,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:10:30,879 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:10:30,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:10:30,880 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:10:30,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 15:10:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:30,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-17 15:10:30,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:10:31,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 15:10:31,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 15:10:31,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 15:10:31,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334542587] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 15:10:31,259 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 15:10:31,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2021-12-17 15:10:31,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683786309] [2021-12-17 15:10:31,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 15:10:31,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-17 15:10:31,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:10:31,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-17 15:10:31,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2021-12-17 15:10:31,260 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand has 23 states, 20 states have (on average 2.35) internal successors, (47), 17 states have internal predecessors, (47), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2021-12-17 15:10:31,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:10:31,461 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2021-12-17 15:10:31,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-17 15:10:31,461 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 2.35) internal successors, (47), 17 states have internal predecessors, (47), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 32 [2021-12-17 15:10:31,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:10:31,462 INFO L225 Difference]: With dead ends: 71 [2021-12-17 15:10:31,462 INFO L226 Difference]: Without dead ends: 54 [2021-12-17 15:10:31,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2021-12-17 15:10:31,464 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 71 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 15:10:31,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 443 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 15:10:31,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-12-17 15:10:31,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2021-12-17 15:10:31,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 states have internal predecessors, (44), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2021-12-17 15:10:31,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2021-12-17 15:10:31,468 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 32 [2021-12-17 15:10:31,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:10:31,468 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2021-12-17 15:10:31,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 2.35) internal successors, (47), 17 states have internal predecessors, (47), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2021-12-17 15:10:31,469 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2021-12-17 15:10:31,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-17 15:10:31,470 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:10:31,470 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:10:31,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 15:10:31,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-17 15:10:31,683 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:10:31,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:10:31,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1826216781, now seen corresponding path program 1 times [2021-12-17 15:10:31,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:10:31,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630727659] [2021-12-17 15:10:31,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:10:31,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:10:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:31,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:31,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-17 15:10:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:31,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:10:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:31,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-17 15:10:31,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:10:31,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630727659] [2021-12-17 15:10:31,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630727659] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:10:31,764 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:10:31,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 15:10:31,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129252321] [2021-12-17 15:10:31,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:10:31,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 15:10:31,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:10:31,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 15:10:31,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:10:31,769 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-17 15:10:31,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:10:31,797 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2021-12-17 15:10:31,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 15:10:31,798 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2021-12-17 15:10:31,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:10:31,799 INFO L225 Difference]: With dead ends: 73 [2021-12-17 15:10:31,801 INFO L226 Difference]: Without dead ends: 53 [2021-12-17 15:10:31,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:10:31,802 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 21 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:10:31,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 182 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:10:31,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-17 15:10:31,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2021-12-17 15:10:31,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 states have internal predecessors, (44), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2021-12-17 15:10:31,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2021-12-17 15:10:31,807 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 34 [2021-12-17 15:10:31,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:10:31,808 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2021-12-17 15:10:31,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-17 15:10:31,808 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2021-12-17 15:10:31,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-17 15:10:31,811 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:10:31,811 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:10:31,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-17 15:10:31,811 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:10:31,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:10:31,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1825803044, now seen corresponding path program 1 times [2021-12-17 15:10:31,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:10:31,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614563916] [2021-12-17 15:10:31,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:10:31,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:10:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:31,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:31,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:10:31,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:31,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-17 15:10:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:31,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 15:10:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:31,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:10:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:31,880 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-17 15:10:31,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:10:31,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614563916] [2021-12-17 15:10:31,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614563916] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:10:31,880 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:10:31,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 15:10:31,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143851337] [2021-12-17 15:10:31,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:10:31,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:10:31,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:10:31,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:10:31,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:10:31,882 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-17 15:10:31,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:10:31,907 INFO L93 Difference]: Finished difference Result 104 states and 131 transitions. [2021-12-17 15:10:31,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 15:10:31,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2021-12-17 15:10:31,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:10:31,908 INFO L225 Difference]: With dead ends: 104 [2021-12-17 15:10:31,909 INFO L226 Difference]: Without dead ends: 51 [2021-12-17 15:10:31,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:10:31,913 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 21 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:10:31,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 176 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:10:31,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-12-17 15:10:31,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2021-12-17 15:10:31,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 38 states have internal predecessors, (41), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2021-12-17 15:10:31,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2021-12-17 15:10:31,927 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 52 [2021-12-17 15:10:31,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:10:31,928 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2021-12-17 15:10:31,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-17 15:10:31,928 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2021-12-17 15:10:31,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-12-17 15:10:31,929 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:10:31,930 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:10:31,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-17 15:10:31,930 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:10:31,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:10:31,930 INFO L85 PathProgramCache]: Analyzing trace with hash 654757234, now seen corresponding path program 1 times [2021-12-17 15:10:31,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:10:31,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492722014] [2021-12-17 15:10:31,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:10:31,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:10:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:31,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:31,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:10:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:31,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-17 15:10:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:31,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 15:10:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:31,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:10:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:32,000 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 15:10:32,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:10:32,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492722014] [2021-12-17 15:10:32,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492722014] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:10:32,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448078004] [2021-12-17 15:10:32,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:10:32,001 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:10:32,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:10:32,002 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:10:32,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 15:10:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:32,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-17 15:10:32,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:10:32,110 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 15:10:32,110 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:10:32,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448078004] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:10:32,110 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:10:32,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2021-12-17 15:10:32,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059064859] [2021-12-17 15:10:32,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:10:32,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:10:32,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:10:32,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:10:32,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:10:32,112 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-17 15:10:32,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:10:32,138 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2021-12-17 15:10:32,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 15:10:32,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) Word has length 53 [2021-12-17 15:10:32,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:10:32,139 INFO L225 Difference]: With dead ends: 96 [2021-12-17 15:10:32,139 INFO L226 Difference]: Without dead ends: 51 [2021-12-17 15:10:32,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-17 15:10:32,139 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 14 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:10:32,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 156 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:10:32,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-12-17 15:10:32,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-12-17 15:10:32,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.135135135135135) internal successors, (42), 40 states have internal predecessors, (42), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2021-12-17 15:10:32,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2021-12-17 15:10:32,142 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 53 [2021-12-17 15:10:32,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:10:32,142 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2021-12-17 15:10:32,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-17 15:10:32,142 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2021-12-17 15:10:32,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-17 15:10:32,143 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:10:32,143 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:10:32,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 15:10:32,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:10:32,347 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:10:32,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:10:32,348 INFO L85 PathProgramCache]: Analyzing trace with hash 689204116, now seen corresponding path program 1 times [2021-12-17 15:10:32,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:10:32,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979272737] [2021-12-17 15:10:32,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:10:32,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:10:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:32,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:32,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:10:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:32,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:10:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:32,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-17 15:10:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:32,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-17 15:10:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:32,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:10:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:32,460 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 15:10:32,461 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:10:32,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979272737] [2021-12-17 15:10:32,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979272737] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:10:32,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254695752] [2021-12-17 15:10:32,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:10:32,461 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:10:32,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:10:32,462 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:10:32,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 15:10:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:32,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-17 15:10:32,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:10:32,657 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 15:10:32,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 15:10:32,934 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 15:10:32,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254695752] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 15:10:32,934 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 15:10:32,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2021-12-17 15:10:32,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611076417] [2021-12-17 15:10:32,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 15:10:32,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-17 15:10:32,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:10:32,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-17 15:10:32,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-12-17 15:10:32,936 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 10 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 5 states have call predecessors, (14), 10 states have call successors, (14) [2021-12-17 15:10:33,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:10:33,125 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions. [2021-12-17 15:10:33,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 15:10:33,125 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 10 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 5 states have call predecessors, (14), 10 states have call successors, (14) Word has length 62 [2021-12-17 15:10:33,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:10:33,126 INFO L225 Difference]: With dead ends: 90 [2021-12-17 15:10:33,126 INFO L226 Difference]: Without dead ends: 59 [2021-12-17 15:10:33,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2021-12-17 15:10:33,127 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 88 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 15:10:33,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 307 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 15:10:33,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-12-17 15:10:33,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2021-12-17 15:10:33,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 42 states have internal predecessors, (44), 7 states have call successors, (7), 3 states have call predecessors, (7), 7 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2021-12-17 15:10:33,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2021-12-17 15:10:33,130 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 62 [2021-12-17 15:10:33,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:10:33,130 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2021-12-17 15:10:33,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 10 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 5 states have call predecessors, (14), 10 states have call successors, (14) [2021-12-17 15:10:33,130 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2021-12-17 15:10:33,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-17 15:10:33,131 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:10:33,131 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:10:33,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 15:10:33,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:10:33,335 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:10:33,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:10:33,336 INFO L85 PathProgramCache]: Analyzing trace with hash -729550012, now seen corresponding path program 2 times [2021-12-17 15:10:33,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:10:33,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374907195] [2021-12-17 15:10:33,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:10:33,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:10:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:10:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:10:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:10:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 15:10:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-17 15:10:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:10:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,445 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-17 15:10:33,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:10:33,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374907195] [2021-12-17 15:10:33,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374907195] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:10:33,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305586040] [2021-12-17 15:10:33,446 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 15:10:33,446 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:10:33,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:10:33,447 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:10:33,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 15:10:33,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 15:10:33,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 15:10:33,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-17 15:10:33,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:10:33,711 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-17 15:10:33,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 15:10:34,162 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-17 15:10:34,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305586040] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 15:10:34,162 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 15:10:34,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 22 [2021-12-17 15:10:34,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481371820] [2021-12-17 15:10:34,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 15:10:34,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-17 15:10:34,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:10:34,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-17 15:10:34,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2021-12-17 15:10:34,164 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 22 states, 19 states have (on average 4.947368421052632) internal successors, (94), 22 states have internal predecessors, (94), 12 states have call successors, (15), 2 states have call predecessors, (15), 7 states have return successors, (18), 7 states have call predecessors, (18), 12 states have call successors, (18) [2021-12-17 15:10:34,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:10:34,444 INFO L93 Difference]: Finished difference Result 150 states and 199 transitions. [2021-12-17 15:10:34,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 15:10:34,446 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 4.947368421052632) internal successors, (94), 22 states have internal predecessors, (94), 12 states have call successors, (15), 2 states have call predecessors, (15), 7 states have return successors, (18), 7 states have call predecessors, (18), 12 states have call successors, (18) Word has length 71 [2021-12-17 15:10:34,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:10:34,447 INFO L225 Difference]: With dead ends: 150 [2021-12-17 15:10:34,447 INFO L226 Difference]: Without dead ends: 95 [2021-12-17 15:10:34,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 141 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2021-12-17 15:10:34,448 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 132 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 15:10:34,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 335 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 15:10:34,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-17 15:10:34,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2021-12-17 15:10:34,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 71 states have internal predecessors, (74), 11 states have call successors, (11), 7 states have call predecessors, (11), 12 states have return successors, (32), 12 states have call predecessors, (32), 11 states have call successors, (32) [2021-12-17 15:10:34,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2021-12-17 15:10:34,453 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 117 transitions. Word has length 71 [2021-12-17 15:10:34,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:10:34,453 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 117 transitions. [2021-12-17 15:10:34,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 4.947368421052632) internal successors, (94), 22 states have internal predecessors, (94), 12 states have call successors, (15), 2 states have call predecessors, (15), 7 states have return successors, (18), 7 states have call predecessors, (18), 12 states have call successors, (18) [2021-12-17 15:10:34,454 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2021-12-17 15:10:34,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-12-17 15:10:34,454 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:10:34,454 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:10:34,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-17 15:10:34,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-17 15:10:34,661 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:10:34,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:10:34,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1100264158, now seen corresponding path program 1 times [2021-12-17 15:10:34,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:10:34,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838392400] [2021-12-17 15:10:34,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:10:34,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:10:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:34,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:34,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:10:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:34,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:10:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:34,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:10:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:34,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:34,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:34,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 15:10:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:34,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-17 15:10:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:34,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:10:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:34,722 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-17 15:10:34,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:10:34,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838392400] [2021-12-17 15:10:34,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838392400] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:10:34,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:10:34,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 15:10:34,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092628731] [2021-12-17 15:10:34,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:10:34,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:10:34,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:10:34,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:10:34,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:10:34,725 INFO L87 Difference]: Start difference. First operand 91 states and 117 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-17 15:10:34,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:10:34,752 INFO L93 Difference]: Finished difference Result 178 states and 250 transitions. [2021-12-17 15:10:34,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 15:10:34,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 78 [2021-12-17 15:10:34,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:10:34,753 INFO L225 Difference]: With dead ends: 178 [2021-12-17 15:10:34,753 INFO L226 Difference]: Without dead ends: 91 [2021-12-17 15:10:34,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:10:34,754 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:10:34,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 167 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:10:34,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-17 15:10:34,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-12-17 15:10:34,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 71 states have internal predecessors, (74), 11 states have call successors, (11), 7 states have call predecessors, (11), 12 states have return successors, (30), 12 states have call predecessors, (30), 11 states have call successors, (30) [2021-12-17 15:10:34,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions. [2021-12-17 15:10:34,760 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 78 [2021-12-17 15:10:34,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:10:34,760 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 115 transitions. [2021-12-17 15:10:34,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-17 15:10:34,760 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2021-12-17 15:10:34,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-12-17 15:10:34,761 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:10:34,761 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:10:34,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-17 15:10:34,762 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:10:34,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:10:34,762 INFO L85 PathProgramCache]: Analyzing trace with hash -862294776, now seen corresponding path program 2 times [2021-12-17 15:10:34,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:10:34,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9424744] [2021-12-17 15:10:34,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:10:34,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:10:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:34,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:34,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:10:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:34,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:10:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:34,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:10:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:34,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:34,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 15:10:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:34,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-17 15:10:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:34,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-17 15:10:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:34,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 15:10:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:34,890 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-17 15:10:34,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:10:34,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9424744] [2021-12-17 15:10:34,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9424744] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:10:34,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121665099] [2021-12-17 15:10:34,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 15:10:34,891 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:10:34,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:10:34,895 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:10:34,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-17 15:10:34,948 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 15:10:34,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 15:10:34,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-17 15:10:34,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:10:35,209 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 4 proven. 60 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-17 15:10:35,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 15:10:36,356 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 2 proven. 62 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-17 15:10:36,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121665099] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 15:10:36,357 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 15:10:36,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 25 [2021-12-17 15:10:36,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542355605] [2021-12-17 15:10:36,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 15:10:36,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-17 15:10:36,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:10:36,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-17 15:10:36,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2021-12-17 15:10:36,360 INFO L87 Difference]: Start difference. First operand 91 states and 115 transitions. Second operand has 25 states, 24 states have (on average 5.166666666666667) internal successors, (124), 25 states have internal predecessors, (124), 15 states have call successors, (22), 2 states have call predecessors, (22), 8 states have return successors, (23), 7 states have call predecessors, (23), 15 states have call successors, (23) [2021-12-17 15:10:36,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:10:36,540 INFO L93 Difference]: Finished difference Result 152 states and 206 transitions. [2021-12-17 15:10:36,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 15:10:36,541 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 5.166666666666667) internal successors, (124), 25 states have internal predecessors, (124), 15 states have call successors, (22), 2 states have call predecessors, (22), 8 states have return successors, (23), 7 states have call predecessors, (23), 15 states have call successors, (23) Word has length 87 [2021-12-17 15:10:36,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:10:36,541 INFO L225 Difference]: With dead ends: 152 [2021-12-17 15:10:36,541 INFO L226 Difference]: Without dead ends: 0 [2021-12-17 15:10:36,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=240, Invalid=816, Unknown=0, NotChecked=0, Total=1056 [2021-12-17 15:10:36,542 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 78 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 15:10:36,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 166 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 15:10:36,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-17 15:10:36,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-17 15:10:36,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 15:10:36,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-17 15:10:36,543 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 87 [2021-12-17 15:10:36,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:10:36,543 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-17 15:10:36,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 5.166666666666667) internal successors, (124), 25 states have internal predecessors, (124), 15 states have call successors, (22), 2 states have call predecessors, (22), 8 states have return successors, (23), 7 states have call predecessors, (23), 15 states have call successors, (23) [2021-12-17 15:10:36,544 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-17 15:10:36,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-17 15:10:36,546 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 15:10:36,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-17 15:10:36,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:10:36,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-17 15:10:36,922 INFO L854 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: (and (= |multiple_of_#in~m| multiple_of_~m) (<= |multiple_of_#in~m| 0)) [2021-12-17 15:10:36,922 INFO L858 garLoopResultBuilder]: For program point L32(lines 32 34) no Hoare annotation was computed. [2021-12-17 15:10:36,922 INFO L858 garLoopResultBuilder]: For program point L33-1(line 33) no Hoare annotation was computed. [2021-12-17 15:10:36,922 INFO L858 garLoopResultBuilder]: For program point multiple_ofFINAL(lines 31 45) no Hoare annotation was computed. [2021-12-17 15:10:36,922 INFO L854 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (and (= |multiple_of_#in~m| multiple_of_~m) (< 0 multiple_of_~n) (= |multiple_of_#in~n| multiple_of_~n)) [2021-12-17 15:10:36,922 INFO L858 garLoopResultBuilder]: For program point L44-1(line 44) no Hoare annotation was computed. [2021-12-17 15:10:36,922 INFO L861 garLoopResultBuilder]: At program point multiple_ofENTRY(lines 31 45) the Hoare annotation is: true [2021-12-17 15:10:36,922 INFO L858 garLoopResultBuilder]: For program point L41(lines 41 43) no Hoare annotation was computed. [2021-12-17 15:10:36,923 INFO L858 garLoopResultBuilder]: For program point L38(lines 38 40) no Hoare annotation was computed. [2021-12-17 15:10:36,923 INFO L854 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (and (= |multiple_of_#in~m| multiple_of_~m) (<= (+ multiple_of_~n 1) 0) (= |multiple_of_#in~n| multiple_of_~n)) [2021-12-17 15:10:36,923 INFO L858 garLoopResultBuilder]: For program point multiple_ofEXIT(lines 31 45) no Hoare annotation was computed. [2021-12-17 15:10:36,923 INFO L858 garLoopResultBuilder]: For program point L35(lines 35 37) no Hoare annotation was computed. [2021-12-17 15:10:36,923 INFO L858 garLoopResultBuilder]: For program point L36-1(line 36) no Hoare annotation was computed. [2021-12-17 15:10:36,923 INFO L861 garLoopResultBuilder]: At program point multENTRY(lines 17 28) the Hoare annotation is: true [2021-12-17 15:10:36,923 INFO L854 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (= |mult_#in~m| mult_~m) (< 1 mult_~m) (= |mult_#in~n| mult_~n)) [2021-12-17 15:10:36,923 INFO L858 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2021-12-17 15:10:36,923 INFO L858 garLoopResultBuilder]: For program point L24(lines 24 26) no Hoare annotation was computed. [2021-12-17 15:10:36,924 INFO L858 garLoopResultBuilder]: For program point L21(lines 21 23) no Hoare annotation was computed. [2021-12-17 15:10:36,924 INFO L854 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (and (<= |mult_#in~m| 0) (= |mult_#in~m| mult_~m)) [2021-12-17 15:10:36,924 INFO L858 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2021-12-17 15:10:36,924 INFO L858 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2021-12-17 15:10:36,924 INFO L858 garLoopResultBuilder]: For program point multFINAL(lines 17 28) no Hoare annotation was computed. [2021-12-17 15:10:36,924 INFO L858 garLoopResultBuilder]: For program point multEXIT(lines 17 28) no Hoare annotation was computed. [2021-12-17 15:10:36,924 INFO L858 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2021-12-17 15:10:36,924 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-17 15:10:36,924 INFO L854 garLoopResultBuilder]: At program point L97-1(line 97) the Hoare annotation is: (and (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_is_prime_~n#1|) (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 2)) [2021-12-17 15:10:36,924 INFO L858 garLoopResultBuilder]: For program point L97-2(line 97) no Hoare annotation was computed. [2021-12-17 15:10:36,925 INFO L858 garLoopResultBuilder]: For program point L97-4(lines 97 101) no Hoare annotation was computed. [2021-12-17 15:10:36,925 INFO L858 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2021-12-17 15:10:36,925 INFO L858 garLoopResultBuilder]: For program point L85(lines 85 89) no Hoare annotation was computed. [2021-12-17 15:10:36,925 INFO L861 garLoopResultBuilder]: At program point L100(lines 76 102) the Hoare annotation is: true [2021-12-17 15:10:36,925 INFO L858 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2021-12-17 15:10:36,925 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-17 15:10:36,925 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-17 15:10:36,925 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-17 15:10:36,925 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 98) no Hoare annotation was computed. [2021-12-17 15:10:36,925 INFO L854 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (and (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_is_prime_~n#1|) (<= 1 |ULTIMATE.start_main_~n~0#1|)) [2021-12-17 15:10:36,926 INFO L858 garLoopResultBuilder]: For program point L53-1(line 53) no Hoare annotation was computed. [2021-12-17 15:10:36,926 INFO L854 garLoopResultBuilder]: At program point L53-2(lines 52 54) the Hoare annotation is: (or (= |ULTIMATE.start_is_prime_#res#1| 0) (and (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_is_prime_~n#1|) (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| 2))) [2021-12-17 15:10:36,926 INFO L858 garLoopResultBuilder]: For program point L78(lines 78 82) no Hoare annotation was computed. [2021-12-17 15:10:36,926 INFO L858 garLoopResultBuilder]: For program point L65(lines 65 72) no Hoare annotation was computed. [2021-12-17 15:10:36,926 INFO L858 garLoopResultBuilder]: For program point is_prime_EXIT(lines 57 74) no Hoare annotation was computed. [2021-12-17 15:10:36,926 INFO L858 garLoopResultBuilder]: For program point L64(lines 64 73) no Hoare annotation was computed. [2021-12-17 15:10:36,926 INFO L858 garLoopResultBuilder]: For program point L61(lines 61 63) no Hoare annotation was computed. [2021-12-17 15:10:36,926 INFO L858 garLoopResultBuilder]: For program point is_prime_FINAL(lines 57 74) no Hoare annotation was computed. [2021-12-17 15:10:36,926 INFO L861 garLoopResultBuilder]: At program point is_prime_ENTRY(lines 57 74) the Hoare annotation is: true [2021-12-17 15:10:36,927 INFO L858 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2021-12-17 15:10:36,927 INFO L854 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (and (= |is_prime__#in~m| is_prime__~m) (= |is_prime__#in~n| is_prime__~n) (or (and (<= is_prime__~n is_prime__~m) (< 2 is_prime__~n)) (<= |is_prime__#in~m| (div |is_prime__#in~n| 2))) (<= 2 is_prime__~m)) [2021-12-17 15:10:36,927 INFO L858 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2021-12-17 15:10:36,927 INFO L854 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: (and (= |is_prime__#in~m| is_prime__~m) (= |is_prime__#in~n| is_prime__~n) (<= 2 is_prime__~m) (< 2 is_prime__~n)) [2021-12-17 15:10:36,927 INFO L858 garLoopResultBuilder]: For program point L68-1(line 68) no Hoare annotation was computed. [2021-12-17 15:10:36,927 INFO L858 garLoopResultBuilder]: For program point L68-2(lines 68 70) no Hoare annotation was computed. [2021-12-17 15:10:36,929 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:10:36,930 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 15:10:36,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 03:10:36 BoogieIcfgContainer [2021-12-17 15:10:36,938 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 15:10:36,939 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 15:10:36,939 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 15:10:36,939 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 15:10:36,939 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 03:10:29" (3/4) ... [2021-12-17 15:10:36,941 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-17 15:10:36,945 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure multiple_of [2021-12-17 15:10:36,945 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure mult [2021-12-17 15:10:36,945 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_prime_ [2021-12-17 15:10:36,951 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2021-12-17 15:10:36,951 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-12-17 15:10:36,951 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-17 15:10:36,952 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-17 15:10:36,967 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \result == 0 || ((n == n && 1 <= n) && n <= 2) [2021-12-17 15:10:36,982 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 15:10:36,982 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 15:10:36,982 INFO L158 Benchmark]: Toolchain (without parser) took 8278.93ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 53.5MB in the beginning and 43.7MB in the end (delta: 9.8MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. [2021-12-17 15:10:36,983 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 86.0MB. Free memory is still 42.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 15:10:36,983 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.32ms. Allocated memory is still 86.0MB. Free memory was 53.2MB in the beginning and 61.9MB in the end (delta: -8.7MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2021-12-17 15:10:36,983 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.18ms. Allocated memory is still 86.0MB. Free memory was 61.9MB in the beginning and 60.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 15:10:36,983 INFO L158 Benchmark]: Boogie Preprocessor took 24.05ms. Allocated memory is still 86.0MB. Free memory was 60.2MB in the beginning and 59.3MB in the end (delta: 810.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 15:10:36,984 INFO L158 Benchmark]: RCFGBuilder took 221.23ms. Allocated memory is still 86.0MB. Free memory was 59.0MB in the beginning and 47.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-17 15:10:36,984 INFO L158 Benchmark]: TraceAbstraction took 7760.97ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 47.2MB in the beginning and 46.9MB in the end (delta: 350.0kB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2021-12-17 15:10:36,984 INFO L158 Benchmark]: Witness Printer took 43.14ms. Allocated memory is still 125.8MB. Free memory was 46.9MB in the beginning and 43.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 15:10:36,988 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 86.0MB. Free memory is still 42.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.32ms. Allocated memory is still 86.0MB. Free memory was 53.2MB in the beginning and 61.9MB in the end (delta: -8.7MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.18ms. Allocated memory is still 86.0MB. Free memory was 61.9MB in the beginning and 60.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.05ms. Allocated memory is still 86.0MB. Free memory was 60.2MB in the beginning and 59.3MB in the end (delta: 810.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 221.23ms. Allocated memory is still 86.0MB. Free memory was 59.0MB in the beginning and 47.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7760.97ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 47.2MB in the beginning and 46.9MB in the end (delta: 350.0kB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. * Witness Printer took 43.14ms. Allocated memory is still 125.8MB. Free memory was 46.9MB in the beginning and 43.7MB 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: 98]: 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 4 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 528 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 489 mSDsluCounter, 3268 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2601 mSDsCounter, 242 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1198 IncrementalHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 242 mSolverCounterUnsat, 667 mSDtfsCounter, 1198 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 863 GetRequests, 689 SyntacticMatches, 5 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=11, InterpolantAutomatonStates: 106, 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, 13 MinimizatonAttempts, 18 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 207 PreInvPairs, 248 NumberOfFragments, 117 HoareAnnotationTreeSize, 207 FomulaSimplifications, 195 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 348 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 920 NumberOfCodeBlocks, 920 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1179 ConstructedInterpolants, 0 QuantifiedInterpolants, 2987 SizeOfPredicates, 33 NumberOfNonLiveVariables, 1038 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 24 InterpolantComputations, 8 PerfectInterpolantSequences, 287/540 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: 52]: Loop Invariant Derived loop invariant: \result == 0 || ((n == n && 1 <= n) && n <= 2) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-12-17 15:10:37,013 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