./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Ackermann03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7e1ff0e6 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/Ackermann03.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 c244f72db2906c596b7f122d769fc1464836d7d05d9227ee4269773d59ed10bd --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-15 00:46:07,023 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 00:46:07,025 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 00:46:07,061 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 00:46:07,062 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 00:46:07,064 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 00:46:07,066 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 00:46:07,068 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 00:46:07,070 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 00:46:07,074 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 00:46:07,075 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 00:46:07,076 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 00:46:07,077 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 00:46:07,079 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 00:46:07,080 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 00:46:07,081 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 00:46:07,082 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 00:46:07,083 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 00:46:07,084 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 00:46:07,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 00:46:07,090 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 00:46:07,091 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 00:46:07,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 00:46:07,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 00:46:07,099 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 00:46:07,099 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 00:46:07,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 00:46:07,101 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 00:46:07,101 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 00:46:07,102 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 00:46:07,102 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 00:46:07,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 00:46:07,104 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 00:46:07,105 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 00:46:07,106 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 00:46:07,106 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 00:46:07,107 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 00:46:07,107 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 00:46:07,107 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 00:46:07,108 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 00:46:07,109 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 00:46:07,110 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 00:46:07,138 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 00:46:07,139 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 00:46:07,139 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 00:46:07,139 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 00:46:07,140 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 00:46:07,140 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 00:46:07,141 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 00:46:07,141 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 00:46:07,141 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 00:46:07,141 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 00:46:07,142 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 00:46:07,142 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 00:46:07,142 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 00:46:07,142 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 00:46:07,143 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 00:46:07,143 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 00:46:07,143 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 00:46:07,143 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 00:46:07,143 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 00:46:07,143 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 00:46:07,143 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 00:46:07,144 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 00:46:07,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 00:46:07,144 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 00:46:07,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 00:46:07,144 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 00:46:07,144 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 00:46:07,145 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 00:46:07,145 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 00:46:07,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 00:46:07,145 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 00:46:07,145 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 00:46:07,146 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 00:46:07,146 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 00:46:07,146 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 00:46:07,146 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> c244f72db2906c596b7f122d769fc1464836d7d05d9227ee4269773d59ed10bd [2023-02-15 00:46:07,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 00:46:07,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 00:46:07,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 00:46:07,458 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 00:46:07,458 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 00:46:07,459 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Ackermann03.c [2023-02-15 00:46:08,667 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 00:46:08,805 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 00:46:08,807 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann03.c [2023-02-15 00:46:08,811 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c2053b4d/719674beb2e94fafaba08877bddd50b8/FLAGbbadc0be3 [2023-02-15 00:46:08,825 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c2053b4d/719674beb2e94fafaba08877bddd50b8 [2023-02-15 00:46:08,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 00:46:08,828 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 00:46:08,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 00:46:08,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 00:46:08,833 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 00:46:08,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:46:08" (1/1) ... [2023-02-15 00:46:08,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3451cfc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:46:08, skipping insertion in model container [2023-02-15 00:46:08,835 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:46:08" (1/1) ... [2023-02-15 00:46:08,840 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 00:46:08,853 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 00:46:08,960 WARN L237 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/Ackermann03.c[1168,1181] [2023-02-15 00:46:08,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 00:46:08,971 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 00:46:08,983 WARN L237 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/Ackermann03.c[1168,1181] [2023-02-15 00:46:08,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 00:46:08,992 INFO L208 MainTranslator]: Completed translation [2023-02-15 00:46:08,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:46:08 WrapperNode [2023-02-15 00:46:08,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 00:46:08,993 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 00:46:08,993 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 00:46:08,994 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 00:46:08,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:46:08" (1/1) ... [2023-02-15 00:46:09,003 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:46:08" (1/1) ... [2023-02-15 00:46:09,012 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2023-02-15 00:46:09,012 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 00:46:09,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 00:46:09,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 00:46:09,013 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 00:46:09,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:46:08" (1/1) ... [2023-02-15 00:46:09,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:46:08" (1/1) ... [2023-02-15 00:46:09,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:46:08" (1/1) ... [2023-02-15 00:46:09,019 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:46:08" (1/1) ... [2023-02-15 00:46:09,021 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:46:08" (1/1) ... [2023-02-15 00:46:09,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:46:08" (1/1) ... [2023-02-15 00:46:09,023 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:46:08" (1/1) ... [2023-02-15 00:46:09,023 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:46:08" (1/1) ... [2023-02-15 00:46:09,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 00:46:09,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 00:46:09,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 00:46:09,025 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 00:46:09,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:46:08" (1/1) ... [2023-02-15 00:46:09,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 00:46:09,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 00:46:09,045 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) [2023-02-15 00:46:09,048 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 [2023-02-15 00:46:09,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 00:46:09,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 00:46:09,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 00:46:09,073 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2023-02-15 00:46:09,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2023-02-15 00:46:09,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 00:46:09,118 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 00:46:09,120 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 00:46:09,268 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 00:46:09,272 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 00:46:09,273 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-15 00:46:09,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:46:09 BoogieIcfgContainer [2023-02-15 00:46:09,274 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 00:46:09,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 00:46:09,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 00:46:09,279 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 00:46:09,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 12:46:08" (1/3) ... [2023-02-15 00:46:09,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f362eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:46:09, skipping insertion in model container [2023-02-15 00:46:09,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:46:08" (2/3) ... [2023-02-15 00:46:09,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f362eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:46:09, skipping insertion in model container [2023-02-15 00:46:09,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:46:09" (3/3) ... [2023-02-15 00:46:09,295 INFO L112 eAbstractionObserver]: Analyzing ICFG Ackermann03.c [2023-02-15 00:46:09,325 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 00:46:09,325 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 00:46:09,382 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 00:46:09,387 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7460ecfc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 00:46:09,388 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 00:46:09,391 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 00:46:09,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 00:46:09,397 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:46:09,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:46:09,398 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 00:46:09,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:46:09,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1470704041, now seen corresponding path program 1 times [2023-02-15 00:46:09,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 00:46:09,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623074046] [2023-02-15 00:46:09,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:46:09,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 00:46:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:09,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 00:46:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:09,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:46:09,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 00:46:09,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623074046] [2023-02-15 00:46:09,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623074046] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 00:46:09,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 00:46:09,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 00:46:09,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933230042] [2023-02-15 00:46:09,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:46:09,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 00:46:09,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 00:46:09,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 00:46:09,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 00:46:09,637 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2023-02-15 00:46:09,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:46:09,757 INFO L93 Difference]: Finished difference Result 51 states and 72 transitions. [2023-02-15 00:46:09,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 00:46:09,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 12 [2023-02-15 00:46:09,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:46:09,767 INFO L225 Difference]: With dead ends: 51 [2023-02-15 00:46:09,767 INFO L226 Difference]: Without dead ends: 25 [2023-02-15 00:46:09,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 00:46:09,772 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 00:46:09,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 72 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 00:46:09,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-15 00:46:09,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-02-15 00:46:09,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-15 00:46:09,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-02-15 00:46:09,809 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 12 [2023-02-15 00:46:09,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:46:09,810 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-02-15 00:46:09,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2023-02-15 00:46:09,810 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2023-02-15 00:46:09,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 00:46:09,812 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:46:09,812 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:46:09,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 00:46:09,812 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 00:46:09,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:46:09,813 INFO L85 PathProgramCache]: Analyzing trace with hash 941922339, now seen corresponding path program 1 times [2023-02-15 00:46:09,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 00:46:09,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254408598] [2023-02-15 00:46:09,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:46:09,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 00:46:09,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:09,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 00:46:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:09,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:09,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 00:46:09,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 00:46:09,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254408598] [2023-02-15 00:46:09,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254408598] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 00:46:09,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913634627] [2023-02-15 00:46:09,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:46:09,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 00:46:09,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 00:46:09,943 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) [2023-02-15 00:46:09,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 00:46:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:10,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 00:46:10,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:46:10,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 00:46:10,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:46:10,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 00:46:10,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913634627] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:46:10,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 00:46:10,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-02-15 00:46:10,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876567409] [2023-02-15 00:46:10,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 00:46:10,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 00:46:10,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 00:46:10,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 00:46:10,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-15 00:46:10,210 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 00:46:10,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:46:10,365 INFO L93 Difference]: Finished difference Result 74 states and 126 transitions. [2023-02-15 00:46:10,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 00:46:10,365 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 19 [2023-02-15 00:46:10,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:46:10,371 INFO L225 Difference]: With dead ends: 74 [2023-02-15 00:46:10,371 INFO L226 Difference]: Without dead ends: 50 [2023-02-15 00:46:10,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2023-02-15 00:46:10,373 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 21 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 00:46:10,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 91 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 00:46:10,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-15 00:46:10,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-02-15 00:46:10,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 10 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (27), 12 states have call predecessors, (27), 10 states have call successors, (27) [2023-02-15 00:46:10,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 76 transitions. [2023-02-15 00:46:10,384 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 76 transitions. Word has length 19 [2023-02-15 00:46:10,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:46:10,385 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 76 transitions. [2023-02-15 00:46:10,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 00:46:10,385 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 76 transitions. [2023-02-15 00:46:10,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 00:46:10,387 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:46:10,387 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:46:10,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 00:46:10,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 00:46:10,593 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 00:46:10,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:46:10,593 INFO L85 PathProgramCache]: Analyzing trace with hash -574784801, now seen corresponding path program 1 times [2023-02-15 00:46:10,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 00:46:10,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071333948] [2023-02-15 00:46:10,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:46:10,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 00:46:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:10,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 00:46:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:10,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:10,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:10,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:10,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:10,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:10,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 00:46:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:10,944 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-02-15 00:46:10,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 00:46:10,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071333948] [2023-02-15 00:46:10,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071333948] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 00:46:10,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561138699] [2023-02-15 00:46:10,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:46:10,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 00:46:10,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 00:46:10,959 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) [2023-02-15 00:46:10,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 00:46:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:11,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 00:46:11,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:46:11,077 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-02-15 00:46:11,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:46:11,446 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-02-15 00:46:11,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561138699] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:46:11,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 00:46:11,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2023-02-15 00:46:11,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453253143] [2023-02-15 00:46:11,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 00:46:11,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 00:46:11,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 00:46:11,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 00:46:11,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-02-15 00:46:11,449 INFO L87 Difference]: Start difference. First operand 50 states and 76 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 5 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-15 00:46:11,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:46:11,520 INFO L93 Difference]: Finished difference Result 120 states and 227 transitions. [2023-02-15 00:46:11,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 00:46:11,521 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 5 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 5 states have call successors, (8) Word has length 45 [2023-02-15 00:46:11,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:46:11,522 INFO L225 Difference]: With dead ends: 120 [2023-02-15 00:46:11,522 INFO L226 Difference]: Without dead ends: 53 [2023-02-15 00:46:11,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 96 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2023-02-15 00:46:11,524 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 47 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 00:46:11,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 81 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 00:46:11,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-15 00:46:11,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-02-15 00:46:11,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (28), 11 states have call predecessors, (28), 8 states have call successors, (28) [2023-02-15 00:46:11,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2023-02-15 00:46:11,532 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 45 [2023-02-15 00:46:11,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:46:11,534 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2023-02-15 00:46:11,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 5 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-15 00:46:11,534 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2023-02-15 00:46:11,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-02-15 00:46:11,538 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:46:11,538 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 11, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:46:11,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 00:46:11,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-02-15 00:46:11,743 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 00:46:11,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:46:11,744 INFO L85 PathProgramCache]: Analyzing trace with hash 2049356910, now seen corresponding path program 2 times [2023-02-15 00:46:11,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 00:46:11,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812093509] [2023-02-15 00:46:11,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:46:11,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 00:46:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:11,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 00:46:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:12,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:12,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:12,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:12,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:12,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:12,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:12,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 00:46:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:12,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:12,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:12,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:12,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:12,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-02-15 00:46:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:12,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:12,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:12,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:12,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:12,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:12,300 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 127 proven. 266 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-15 00:46:12,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 00:46:12,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812093509] [2023-02-15 00:46:12,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812093509] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 00:46:12,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974296134] [2023-02-15 00:46:12,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 00:46:12,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 00:46:12,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 00:46:12,302 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) [2023-02-15 00:46:12,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 00:46:12,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 00:46:12,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 00:46:12,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 00:46:12,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:46:12,518 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 360 proven. 86 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2023-02-15 00:46:12,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:46:13,496 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 115 proven. 179 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2023-02-15 00:46:13,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974296134] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:46:13,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 00:46:13,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 15] total 33 [2023-02-15 00:46:13,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132286072] [2023-02-15 00:46:13,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 00:46:13,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-15 00:46:13,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 00:46:13,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-15 00:46:13,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=950, Unknown=0, NotChecked=0, Total=1056 [2023-02-15 00:46:13,502 INFO L87 Difference]: Start difference. First operand 53 states and 76 transitions. Second operand has 33 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 27 states have internal predecessors, (77), 11 states have call successors, (18), 2 states have call predecessors, (18), 15 states have return successors, (33), 19 states have call predecessors, (33), 11 states have call successors, (33) [2023-02-15 00:46:14,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:46:14,186 INFO L93 Difference]: Finished difference Result 126 states and 253 transitions. [2023-02-15 00:46:14,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-15 00:46:14,186 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 27 states have internal predecessors, (77), 11 states have call successors, (18), 2 states have call predecessors, (18), 15 states have return successors, (33), 19 states have call predecessors, (33), 11 states have call successors, (33) Word has length 119 [2023-02-15 00:46:14,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:46:14,188 INFO L225 Difference]: With dead ends: 126 [2023-02-15 00:46:14,188 INFO L226 Difference]: Without dead ends: 78 [2023-02-15 00:46:14,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=587, Invalid=2835, Unknown=0, NotChecked=0, Total=3422 [2023-02-15 00:46:14,190 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 68 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 00:46:14,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 178 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 00:46:14,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-15 00:46:14,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2023-02-15 00:46:14,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 53 states have internal predecessors, (58), 13 states have call successors, (13), 7 states have call predecessors, (13), 11 states have return successors, (46), 16 states have call predecessors, (46), 13 states have call successors, (46) [2023-02-15 00:46:14,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2023-02-15 00:46:14,207 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 117 transitions. Word has length 119 [2023-02-15 00:46:14,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:46:14,209 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 117 transitions. [2023-02-15 00:46:14,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 27 states have internal predecessors, (77), 11 states have call successors, (18), 2 states have call predecessors, (18), 15 states have return successors, (33), 19 states have call predecessors, (33), 11 states have call successors, (33) [2023-02-15 00:46:14,210 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 117 transitions. [2023-02-15 00:46:14,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-02-15 00:46:14,217 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:46:14,217 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 10, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:46:14,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 00:46:14,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 00:46:14,423 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 00:46:14,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:46:14,424 INFO L85 PathProgramCache]: Analyzing trace with hash -270180431, now seen corresponding path program 3 times [2023-02-15 00:46:14,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 00:46:14,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090182194] [2023-02-15 00:46:14,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:46:14,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 00:46:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:14,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 00:46:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:14,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:14,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:14,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:14,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:14,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:14,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:14,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 00:46:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:14,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:14,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:14,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:14,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-02-15 00:46:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:14,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:14,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:14,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:14,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:14,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 00:46:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:14,965 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 249 proven. 113 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2023-02-15 00:46:14,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 00:46:14,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090182194] [2023-02-15 00:46:14,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090182194] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 00:46:14,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465123454] [2023-02-15 00:46:14,966 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 00:46:14,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 00:46:14,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 00:46:14,985 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) [2023-02-15 00:46:14,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 00:46:15,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2023-02-15 00:46:15,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 00:46:15,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-15 00:46:15,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:46:15,220 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 236 proven. 115 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2023-02-15 00:46:15,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:46:16,363 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 252 proven. 113 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2023-02-15 00:46:16,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465123454] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:46:16,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 00:46:16,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 16] total 23 [2023-02-15 00:46:16,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577447351] [2023-02-15 00:46:16,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 00:46:16,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-15 00:46:16,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 00:46:16,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-15 00:46:16,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2023-02-15 00:46:16,365 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 21 states have internal predecessors, (63), 11 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (23), 10 states have call predecessors, (23), 11 states have call successors, (23) [2023-02-15 00:46:16,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:46:16,686 INFO L93 Difference]: Finished difference Result 168 states and 314 transitions. [2023-02-15 00:46:16,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 00:46:16,688 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 21 states have internal predecessors, (63), 11 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (23), 10 states have call predecessors, (23), 11 states have call successors, (23) Word has length 118 [2023-02-15 00:46:16,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:46:16,694 INFO L225 Difference]: With dead ends: 168 [2023-02-15 00:46:16,694 INFO L226 Difference]: Without dead ends: 100 [2023-02-15 00:46:16,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 250 SyntacticMatches, 13 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=365, Invalid=1195, Unknown=0, NotChecked=0, Total=1560 [2023-02-15 00:46:16,699 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 40 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 00:46:16,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 166 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 00:46:16,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-15 00:46:16,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-02-15 00:46:16,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 68 states have internal predecessors, (75), 18 states have call successors, (18), 9 states have call predecessors, (18), 14 states have return successors, (67), 22 states have call predecessors, (67), 18 states have call successors, (67) [2023-02-15 00:46:16,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 160 transitions. [2023-02-15 00:46:16,732 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 160 transitions. Word has length 118 [2023-02-15 00:46:16,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:46:16,733 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 160 transitions. [2023-02-15 00:46:16,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 21 states have internal predecessors, (63), 11 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (23), 10 states have call predecessors, (23), 11 states have call successors, (23) [2023-02-15 00:46:16,734 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 160 transitions. [2023-02-15 00:46:16,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-02-15 00:46:16,742 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:46:16,742 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 12, 9, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:46:16,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 00:46:16,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 00:46:16,950 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 00:46:16,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:46:16,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1294012555, now seen corresponding path program 4 times [2023-02-15 00:46:16,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 00:46:16,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67011991] [2023-02-15 00:46:16,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:46:16,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 00:46:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:17,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 00:46:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:17,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:17,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:17,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:17,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:17,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:17,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:17,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 00:46:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:17,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:17,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:17,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:17,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:17,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 00:46:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:17,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-02-15 00:46:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:17,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:17,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:17,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:17,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:17,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:17,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 00:46:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:17,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-15 00:46:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:17,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 157 proven. 360 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2023-02-15 00:46:17,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 00:46:17,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67011991] [2023-02-15 00:46:17,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67011991] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 00:46:17,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675845196] [2023-02-15 00:46:17,539 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 00:46:17,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 00:46:17,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 00:46:17,540 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) [2023-02-15 00:46:17,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 00:46:17,640 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 00:46:17,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 00:46:17,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-15 00:46:17,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:46:17,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 595 proven. 114 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2023-02-15 00:46:17,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:46:19,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 160 proven. 360 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2023-02-15 00:46:19,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675845196] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:46:19,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 00:46:19,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 17] total 24 [2023-02-15 00:46:19,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18066173] [2023-02-15 00:46:19,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 00:46:19,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-15 00:46:19,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 00:46:19,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-15 00:46:19,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2023-02-15 00:46:19,063 INFO L87 Difference]: Start difference. First operand 100 states and 160 transitions. Second operand has 24 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 21 states have internal predecessors, (71), 12 states have call successors, (18), 2 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 12 states have call successors, (28) [2023-02-15 00:46:19,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:46:19,406 INFO L93 Difference]: Finished difference Result 191 states and 332 transitions. [2023-02-15 00:46:19,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 00:46:19,406 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 21 states have internal predecessors, (71), 12 states have call successors, (18), 2 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 12 states have call successors, (28) Word has length 144 [2023-02-15 00:46:19,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:46:19,408 INFO L225 Difference]: With dead ends: 191 [2023-02-15 00:46:19,408 INFO L226 Difference]: Without dead ends: 100 [2023-02-15 00:46:19,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 310 SyntacticMatches, 13 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=461, Invalid=1519, Unknown=0, NotChecked=0, Total=1980 [2023-02-15 00:46:19,410 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 24 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 00:46:19,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 188 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 00:46:19,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-15 00:46:19,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-02-15 00:46:19,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 68 states have internal predecessors, (75), 18 states have call successors, (18), 9 states have call predecessors, (18), 14 states have return successors, (59), 22 states have call predecessors, (59), 18 states have call successors, (59) [2023-02-15 00:46:19,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 152 transitions. [2023-02-15 00:46:19,418 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 152 transitions. Word has length 144 [2023-02-15 00:46:19,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:46:19,419 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 152 transitions. [2023-02-15 00:46:19,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 21 states have internal predecessors, (71), 12 states have call successors, (18), 2 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 12 states have call successors, (28) [2023-02-15 00:46:19,419 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 152 transitions. [2023-02-15 00:46:19,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-02-15 00:46:19,421 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:46:19,421 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 13, 10, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:46:19,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 00:46:19,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 00:46:19,627 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 00:46:19,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:46:19,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1701842998, now seen corresponding path program 5 times [2023-02-15 00:46:19,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 00:46:19,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110642338] [2023-02-15 00:46:19,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:46:19,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 00:46:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:19,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 00:46:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:20,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:20,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:20,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:20,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:20,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:20,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:20,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 00:46:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:20,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:20,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:20,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:20,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:20,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:20,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 00:46:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:20,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-15 00:46:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:20,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-02-15 00:46:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:20,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:20,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:20,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:20,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:20,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:20,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 00:46:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:20,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-15 00:46:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:20,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 445 proven. 284 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2023-02-15 00:46:20,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 00:46:20,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110642338] [2023-02-15 00:46:20,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110642338] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 00:46:20,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856867365] [2023-02-15 00:46:20,516 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 00:46:20,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 00:46:20,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 00:46:20,533 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) [2023-02-15 00:46:20,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 00:46:20,702 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2023-02-15 00:46:20,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 00:46:20,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-15 00:46:20,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:46:20,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 421 proven. 286 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2023-02-15 00:46:20,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:46:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 467 proven. 286 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2023-02-15 00:46:23,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856867365] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:46:23,655 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 00:46:23,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 27] total 38 [2023-02-15 00:46:23,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505612242] [2023-02-15 00:46:23,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 00:46:23,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-15 00:46:23,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 00:46:23,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-15 00:46:23,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1220, Unknown=0, NotChecked=0, Total=1406 [2023-02-15 00:46:23,657 INFO L87 Difference]: Start difference. First operand 100 states and 152 transitions. Second operand has 38 states, 38 states have (on average 2.210526315789474) internal successors, (84), 32 states have internal predecessors, (84), 16 states have call successors, (19), 1 states have call predecessors, (19), 18 states have return successors, (36), 18 states have call predecessors, (36), 16 states have call successors, (36) [2023-02-15 00:46:24,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:46:24,165 INFO L93 Difference]: Finished difference Result 206 states and 359 transitions. [2023-02-15 00:46:24,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-15 00:46:24,166 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.210526315789474) internal successors, (84), 32 states have internal predecessors, (84), 16 states have call successors, (19), 1 states have call predecessors, (19), 18 states have return successors, (36), 18 states have call predecessors, (36), 16 states have call successors, (36) Word has length 157 [2023-02-15 00:46:24,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:46:24,167 INFO L225 Difference]: With dead ends: 206 [2023-02-15 00:46:24,167 INFO L226 Difference]: Without dead ends: 115 [2023-02-15 00:46:24,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 330 SyntacticMatches, 17 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=799, Invalid=3361, Unknown=0, NotChecked=0, Total=4160 [2023-02-15 00:46:24,172 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 45 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 00:46:24,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 277 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 00:46:24,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-02-15 00:46:24,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-02-15 00:46:24,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 76 states have (on average 1.105263157894737) internal successors, (84), 77 states have internal predecessors, (84), 21 states have call successors, (21), 9 states have call predecessors, (21), 17 states have return successors, (80), 28 states have call predecessors, (80), 21 states have call successors, (80) [2023-02-15 00:46:24,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 185 transitions. [2023-02-15 00:46:24,194 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 185 transitions. Word has length 157 [2023-02-15 00:46:24,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:46:24,194 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 185 transitions. [2023-02-15 00:46:24,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.210526315789474) internal successors, (84), 32 states have internal predecessors, (84), 16 states have call successors, (19), 1 states have call predecessors, (19), 18 states have return successors, (36), 18 states have call predecessors, (36), 16 states have call successors, (36) [2023-02-15 00:46:24,194 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 185 transitions. [2023-02-15 00:46:24,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-02-15 00:46:24,196 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:46:24,196 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 15, 12, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:46:24,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 00:46:24,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 00:46:24,402 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 00:46:24,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:46:24,403 INFO L85 PathProgramCache]: Analyzing trace with hash 332854534, now seen corresponding path program 6 times [2023-02-15 00:46:24,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 00:46:24,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419996019] [2023-02-15 00:46:24,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:46:24,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 00:46:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:24,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 00:46:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:24,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:24,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:24,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:24,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:24,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:24,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:24,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 00:46:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:25,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:25,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:25,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:25,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:25,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:25,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 00:46:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:25,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-15 00:46:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:25,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-02-15 00:46:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:25,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:25,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:25,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:25,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:25,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:25,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:25,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:25,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:25,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 00:46:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:25,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-15 00:46:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:25,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-02-15 00:46:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:25,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-02-15 00:46:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:25,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 600 proven. 156 refuted. 0 times theorem prover too weak. 985 trivial. 0 not checked. [2023-02-15 00:46:25,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 00:46:25,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419996019] [2023-02-15 00:46:25,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419996019] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 00:46:25,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912973851] [2023-02-15 00:46:25,709 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-15 00:46:25,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 00:46:25,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 00:46:25,727 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 00:46:25,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 00:46:25,945 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2023-02-15 00:46:25,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 00:46:25,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 79 conjunts are in the unsatisfiable core [2023-02-15 00:46:25,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:46:26,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 583 proven. 158 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2023-02-15 00:46:26,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:46:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 597 proven. 189 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2023-02-15 00:46:27,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912973851] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:46:27,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 00:46:27,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 33] total 36 [2023-02-15 00:46:27,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409453888] [2023-02-15 00:46:27,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 00:46:27,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-15 00:46:27,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 00:46:27,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-15 00:46:27,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1171, Unknown=0, NotChecked=0, Total=1260 [2023-02-15 00:46:27,460 INFO L87 Difference]: Start difference. First operand 115 states and 185 transitions. Second operand has 36 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 29 states have internal predecessors, (56), 6 states have call successors, (9), 1 states have call predecessors, (9), 14 states have return successors, (22), 13 states have call predecessors, (22), 6 states have call successors, (22) [2023-02-15 00:46:29,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:46:29,356 INFO L93 Difference]: Finished difference Result 237 states and 471 transitions. [2023-02-15 00:46:29,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-02-15 00:46:29,357 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 29 states have internal predecessors, (56), 6 states have call successors, (9), 1 states have call predecessors, (9), 14 states have return successors, (22), 13 states have call predecessors, (22), 6 states have call successors, (22) Word has length 183 [2023-02-15 00:46:29,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:46:29,360 INFO L225 Difference]: With dead ends: 237 [2023-02-15 00:46:29,360 INFO L226 Difference]: Without dead ends: 233 [2023-02-15 00:46:29,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 406 SyntacticMatches, 7 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=582, Invalid=4530, Unknown=0, NotChecked=0, Total=5112 [2023-02-15 00:46:29,362 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 144 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 1856 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 2018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 00:46:29,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 462 Invalid, 2018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1856 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-15 00:46:29,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-02-15 00:46:29,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 187. [2023-02-15 00:46:29,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 122 states have (on average 1.0819672131147542) internal successors, (132), 123 states have internal predecessors, (132), 31 states have call successors, (31), 11 states have call predecessors, (31), 33 states have return successors, (230), 52 states have call predecessors, (230), 31 states have call successors, (230) [2023-02-15 00:46:29,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 393 transitions. [2023-02-15 00:46:29,391 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 393 transitions. Word has length 183 [2023-02-15 00:46:29,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:46:29,391 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 393 transitions. [2023-02-15 00:46:29,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 29 states have internal predecessors, (56), 6 states have call successors, (9), 1 states have call predecessors, (9), 14 states have return successors, (22), 13 states have call predecessors, (22), 6 states have call successors, (22) [2023-02-15 00:46:29,392 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 393 transitions. [2023-02-15 00:46:29,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-02-15 00:46:29,393 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:46:29,393 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 14, 11, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:46:29,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 00:46:29,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 00:46:29,600 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 00:46:29,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:46:29,600 INFO L85 PathProgramCache]: Analyzing trace with hash -860565711, now seen corresponding path program 7 times [2023-02-15 00:46:29,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 00:46:29,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729979963] [2023-02-15 00:46:29,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:46:29,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 00:46:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:29,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 00:46:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:30,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:30,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:30,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:30,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:30,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:30,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:30,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 00:46:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:30,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:30,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:30,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:30,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:30,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:30,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 00:46:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:30,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-15 00:46:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:30,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-02-15 00:46:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:30,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:30,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:30,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:30,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:30,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:30,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:30,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 00:46:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:30,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-15 00:46:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:30,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-02-15 00:46:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:30,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 502 proven. 372 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2023-02-15 00:46:30,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 00:46:30,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729979963] [2023-02-15 00:46:30,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729979963] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 00:46:30,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596035536] [2023-02-15 00:46:30,481 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-15 00:46:30,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 00:46:30,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 00:46:30,505 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 00:46:30,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 00:46:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:30,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-15 00:46:30,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:46:30,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 477 proven. 372 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2023-02-15 00:46:30,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:46:33,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 525 proven. 384 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2023-02-15 00:46:33,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596035536] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:46:33,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 00:46:33,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 28] total 35 [2023-02-15 00:46:33,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549522325] [2023-02-15 00:46:33,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 00:46:33,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-15 00:46:33,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 00:46:33,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-15 00:46:33,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1017, Unknown=0, NotChecked=0, Total=1190 [2023-02-15 00:46:33,598 INFO L87 Difference]: Start difference. First operand 187 states and 393 transitions. Second operand has 35 states, 35 states have (on average 2.4285714285714284) internal successors, (85), 31 states have internal predecessors, (85), 17 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) [2023-02-15 00:46:34,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:46:34,137 INFO L93 Difference]: Finished difference Result 346 states and 797 transitions. [2023-02-15 00:46:34,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-15 00:46:34,138 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.4285714285714284) internal successors, (85), 31 states have internal predecessors, (85), 17 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) Word has length 170 [2023-02-15 00:46:34,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:46:34,141 INFO L225 Difference]: With dead ends: 346 [2023-02-15 00:46:34,141 INFO L226 Difference]: Without dead ends: 168 [2023-02-15 00:46:34,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 358 SyntacticMatches, 23 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=865, Invalid=3295, Unknown=0, NotChecked=0, Total=4160 [2023-02-15 00:46:34,146 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 76 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 00:46:34,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 235 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 00:46:34,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-02-15 00:46:34,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2023-02-15 00:46:34,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 110 states have (on average 1.0818181818181818) internal successors, (119), 111 states have internal predecessors, (119), 27 states have call successors, (27), 10 states have call predecessors, (27), 30 states have return successors, (162), 46 states have call predecessors, (162), 27 states have call successors, (162) [2023-02-15 00:46:34,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 308 transitions. [2023-02-15 00:46:34,160 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 308 transitions. Word has length 170 [2023-02-15 00:46:34,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:46:34,160 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 308 transitions. [2023-02-15 00:46:34,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.4285714285714284) internal successors, (85), 31 states have internal predecessors, (85), 17 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) [2023-02-15 00:46:34,161 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 308 transitions. [2023-02-15 00:46:34,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2023-02-15 00:46:34,163 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:46:34,163 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 16, 13, 12, 12, 12, 12, 12, 12, 12, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:46:34,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-02-15 00:46:34,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-02-15 00:46:34,370 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 00:46:34,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:46:34,371 INFO L85 PathProgramCache]: Analyzing trace with hash 530318069, now seen corresponding path program 8 times [2023-02-15 00:46:34,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 00:46:34,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907220353] [2023-02-15 00:46:34,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:46:34,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 00:46:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:34,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 00:46:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:34,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:34,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:34,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:34,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:34,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:34,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:34,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:34,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 00:46:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:34,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:35,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:35,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:35,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:35,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:35,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 00:46:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:35,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-15 00:46:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:35,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-02-15 00:46:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:35,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:35,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:35,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:35,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:35,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:35,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:35,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:35,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:35,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 00:46:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:35,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-15 00:46:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:35,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-02-15 00:46:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:35,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-02-15 00:46:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:35,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-02-15 00:46:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:35,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 664 proven. 533 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2023-02-15 00:46:35,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 00:46:35,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907220353] [2023-02-15 00:46:35,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907220353] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 00:46:35,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844532543] [2023-02-15 00:46:35,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 00:46:35,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 00:46:35,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 00:46:35,460 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 00:46:35,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 00:46:35,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 00:46:35,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 00:46:35,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-15 00:46:35,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:46:35,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 647 proven. 519 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2023-02-15 00:46:35,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:46:39,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 685 proven. 580 refuted. 0 times theorem prover too weak. 755 trivial. 0 not checked. [2023-02-15 00:46:39,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844532543] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:46:39,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 00:46:39,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 32] total 39 [2023-02-15 00:46:39,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692599445] [2023-02-15 00:46:39,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 00:46:39,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-15 00:46:39,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 00:46:39,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-15 00:46:39,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1280, Unknown=0, NotChecked=0, Total=1482 [2023-02-15 00:46:39,559 INFO L87 Difference]: Start difference. First operand 168 states and 308 transitions. Second operand has 39 states, 39 states have (on average 2.4871794871794872) internal successors, (97), 35 states have internal predecessors, (97), 21 states have call successors, (24), 1 states have call predecessors, (24), 20 states have return successors, (45), 18 states have call predecessors, (45), 21 states have call successors, (45) [2023-02-15 00:46:40,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:46:40,204 INFO L93 Difference]: Finished difference Result 349 states and 744 transitions. [2023-02-15 00:46:40,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-15 00:46:40,204 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.4871794871794872) internal successors, (97), 35 states have internal predecessors, (97), 21 states have call successors, (24), 1 states have call predecessors, (24), 20 states have return successors, (45), 18 states have call predecessors, (45), 21 states have call successors, (45) Word has length 196 [2023-02-15 00:46:40,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:46:40,207 INFO L225 Difference]: With dead ends: 349 [2023-02-15 00:46:40,208 INFO L226 Difference]: Without dead ends: 190 [2023-02-15 00:46:40,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 414 SyntacticMatches, 25 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1333 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=789, Invalid=3243, Unknown=0, NotChecked=0, Total=4032 [2023-02-15 00:46:40,212 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 138 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 00:46:40,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 348 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 00:46:40,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-02-15 00:46:40,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 173. [2023-02-15 00:46:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 113 states have (on average 1.0707964601769913) internal successors, (121), 114 states have internal predecessors, (121), 28 states have call successors, (28), 10 states have call predecessors, (28), 31 states have return successors, (166), 48 states have call predecessors, (166), 28 states have call successors, (166) [2023-02-15 00:46:40,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 315 transitions. [2023-02-15 00:46:40,228 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 315 transitions. Word has length 196 [2023-02-15 00:46:40,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:46:40,228 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 315 transitions. [2023-02-15 00:46:40,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.4871794871794872) internal successors, (97), 35 states have internal predecessors, (97), 21 states have call successors, (24), 1 states have call predecessors, (24), 20 states have return successors, (45), 18 states have call predecessors, (45), 21 states have call successors, (45) [2023-02-15 00:46:40,229 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 315 transitions. [2023-02-15 00:46:40,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-02-15 00:46:40,230 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:46:40,231 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 17, 14, 13, 13, 13, 13, 13, 13, 13, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:46:40,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 00:46:40,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-15 00:46:40,437 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 00:46:40,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:46:40,438 INFO L85 PathProgramCache]: Analyzing trace with hash 660925528, now seen corresponding path program 9 times [2023-02-15 00:46:40,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 00:46:40,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29796641] [2023-02-15 00:46:40,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:46:40,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 00:46:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:40,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 00:46:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:40,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:40,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:40,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:40,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:40,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:40,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:40,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 00:46:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:40,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:41,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:41,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:41,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:41,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:41,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:41,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 00:46:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:41,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-15 00:46:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:41,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-02-15 00:46:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:41,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-02-15 00:46:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:41,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:41,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:41,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:41,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:41,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:41,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:41,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:41,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:41,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 00:46:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:41,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-15 00:46:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:41,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-02-15 00:46:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:41,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-02-15 00:46:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:41,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-02-15 00:46:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:41,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2320 backedges. 267 proven. 793 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2023-02-15 00:46:41,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 00:46:41,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29796641] [2023-02-15 00:46:41,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29796641] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 00:46:41,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455541117] [2023-02-15 00:46:41,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 00:46:41,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 00:46:41,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 00:46:41,127 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 00:46:41,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 00:46:41,416 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2023-02-15 00:46:41,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 00:46:41,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 00:46:41,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:46:41,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2320 backedges. 1340 proven. 196 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2023-02-15 00:46:41,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:46:43,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2320 backedges. 274 proven. 806 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2023-02-15 00:46:43,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455541117] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:46:43,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 00:46:43,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 21] total 28 [2023-02-15 00:46:43,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238327987] [2023-02-15 00:46:43,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 00:46:43,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-15 00:46:43,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 00:46:43,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-15 00:46:43,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2023-02-15 00:46:43,419 INFO L87 Difference]: Start difference. First operand 173 states and 315 transitions. Second operand has 28 states, 28 states have (on average 2.9642857142857144) internal successors, (83), 25 states have internal predecessors, (83), 16 states have call successors, (22), 2 states have call predecessors, (22), 14 states have return successors, (36), 13 states have call predecessors, (36), 16 states have call successors, (36) [2023-02-15 00:46:43,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:46:43,766 INFO L93 Difference]: Finished difference Result 338 states and 689 transitions. [2023-02-15 00:46:43,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 00:46:43,766 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.9642857142857144) internal successors, (83), 25 states have internal predecessors, (83), 16 states have call successors, (22), 2 states have call predecessors, (22), 14 states have return successors, (36), 13 states have call predecessors, (36), 16 states have call successors, (36) Word has length 209 [2023-02-15 00:46:43,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:46:43,781 INFO L225 Difference]: With dead ends: 338 [2023-02-15 00:46:43,781 INFO L226 Difference]: Without dead ends: 174 [2023-02-15 00:46:43,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 456 SyntacticMatches, 15 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=423, Invalid=1557, Unknown=0, NotChecked=0, Total=1980 [2023-02-15 00:46:43,784 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 52 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 00:46:43,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 260 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 00:46:43,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-02-15 00:46:43,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2023-02-15 00:46:43,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 113 states have (on average 1.0707964601769913) internal successors, (121), 114 states have internal predecessors, (121), 28 states have call successors, (28), 10 states have call predecessors, (28), 31 states have return successors, (162), 48 states have call predecessors, (162), 28 states have call successors, (162) [2023-02-15 00:46:43,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 311 transitions. [2023-02-15 00:46:43,796 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 311 transitions. Word has length 209 [2023-02-15 00:46:43,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:46:43,797 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 311 transitions. [2023-02-15 00:46:43,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.9642857142857144) internal successors, (83), 25 states have internal predecessors, (83), 16 states have call successors, (22), 2 states have call predecessors, (22), 14 states have return successors, (36), 13 states have call predecessors, (36), 16 states have call successors, (36) [2023-02-15 00:46:43,797 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 311 transitions. [2023-02-15 00:46:43,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2023-02-15 00:46:43,799 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:46:43,799 INFO L195 NwaCegarLoop]: trace histogram [42, 42, 23, 19, 18, 18, 18, 18, 18, 18, 18, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:46:43,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 00:46:44,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-15 00:46:44,006 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 00:46:44,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:46:44,007 INFO L85 PathProgramCache]: Analyzing trace with hash 471385981, now seen corresponding path program 10 times [2023-02-15 00:46:44,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 00:46:44,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565506207] [2023-02-15 00:46:44,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:46:44,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 00:46:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 00:46:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 00:46:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 00:46:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-15 00:46:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-02-15 00:46:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 00:46:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-15 00:46:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-02-15 00:46:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-02-15 00:46:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-02-15 00:46:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 00:46:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-15 00:46:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-02-15 00:46:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-02-15 00:46:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-02-15 00:46:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:44,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 228 proven. 519 refuted. 0 times theorem prover too weak. 3582 trivial. 0 not checked. [2023-02-15 00:46:44,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 00:46:44,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565506207] [2023-02-15 00:46:44,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565506207] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 00:46:44,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147693347] [2023-02-15 00:46:44,770 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 00:46:44,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 00:46:44,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 00:46:44,772 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 00:46:44,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 00:46:45,163 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 00:46:45,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 00:46:45,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 00:46:45,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:46:45,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 234 proven. 507 refuted. 0 times theorem prover too weak. 3588 trivial. 0 not checked. [2023-02-15 00:46:45,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:46:45,923 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 234 proven. 522 refuted. 0 times theorem prover too weak. 3573 trivial. 0 not checked. [2023-02-15 00:46:45,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147693347] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:46:45,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 00:46:45,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 11] total 15 [2023-02-15 00:46:45,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735314510] [2023-02-15 00:46:45,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 00:46:45,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 00:46:45,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 00:46:45,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 00:46:45,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2023-02-15 00:46:45,926 INFO L87 Difference]: Start difference. First operand 173 states and 311 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (18), 7 states have call predecessors, (18), 11 states have call successors, (18) [2023-02-15 00:46:46,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:46:46,005 INFO L93 Difference]: Finished difference Result 177 states and 314 transitions. [2023-02-15 00:46:46,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 00:46:46,005 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (18), 7 states have call predecessors, (18), 11 states have call successors, (18) Word has length 281 [2023-02-15 00:46:46,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:46:46,010 INFO L225 Difference]: With dead ends: 177 [2023-02-15 00:46:46,012 INFO L226 Difference]: Without dead ends: 173 [2023-02-15 00:46:46,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 657 GetRequests, 634 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2023-02-15 00:46:46,014 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 00:46:46,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 107 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 00:46:46,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-02-15 00:46:46,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 161. [2023-02-15 00:46:46,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 105 states have (on average 1.0761904761904761) internal successors, (113), 106 states have internal predecessors, (113), 28 states have call successors, (28), 10 states have call predecessors, (28), 27 states have return successors, (126), 44 states have call predecessors, (126), 28 states have call successors, (126) [2023-02-15 00:46:46,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 267 transitions. [2023-02-15 00:46:46,024 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 267 transitions. Word has length 281 [2023-02-15 00:46:46,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:46:46,024 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 267 transitions. [2023-02-15 00:46:46,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (18), 7 states have call predecessors, (18), 11 states have call successors, (18) [2023-02-15 00:46:46,025 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 267 transitions. [2023-02-15 00:46:46,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2023-02-15 00:46:46,027 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:46:46,027 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 23, 18, 17, 17, 17, 17, 17, 17, 17, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:46:46,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 00:46:46,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-15 00:46:46,234 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 00:46:46,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:46:46,234 INFO L85 PathProgramCache]: Analyzing trace with hash 582117116, now seen corresponding path program 11 times [2023-02-15 00:46:46,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 00:46:46,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130167568] [2023-02-15 00:46:46,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:46:46,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 00:46:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:46,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 00:46:46,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:46,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:46,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:46,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:46,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:46,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:46,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:46,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:46,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:46,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 00:46:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 00:46:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-15 00:46:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-02-15 00:46:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 00:46:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-15 00:46:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-02-15 00:46:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-02-15 00:46:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 00:46:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-15 00:46:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-02-15 00:46:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-02-15 00:46:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-02-15 00:46:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:47,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4107 backedges. 599 proven. 1333 refuted. 0 times theorem prover too weak. 2175 trivial. 0 not checked. [2023-02-15 00:46:47,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 00:46:47,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130167568] [2023-02-15 00:46:47,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130167568] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 00:46:47,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132970107] [2023-02-15 00:46:47,397 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 00:46:47,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 00:46:47,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 00:46:47,413 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 00:46:47,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 00:46:47,745 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2023-02-15 00:46:47,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 00:46:47,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-15 00:46:47,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:46:47,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4107 backedges. 2428 proven. 401 refuted. 0 times theorem prover too weak. 1278 trivial. 0 not checked. [2023-02-15 00:46:47,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:46:52,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4107 backedges. 700 proven. 1204 refuted. 0 times theorem prover too weak. 2203 trivial. 0 not checked. [2023-02-15 00:46:52,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132970107] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:46:52,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 00:46:52,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22, 29] total 39 [2023-02-15 00:46:52,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329341511] [2023-02-15 00:46:52,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 00:46:52,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-15 00:46:52,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 00:46:52,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-15 00:46:52,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1300, Unknown=0, NotChecked=0, Total=1482 [2023-02-15 00:46:52,767 INFO L87 Difference]: Start difference. First operand 161 states and 267 transitions. Second operand has 39 states, 39 states have (on average 2.58974358974359) internal successors, (101), 34 states have internal predecessors, (101), 20 states have call successors, (26), 2 states have call predecessors, (26), 19 states have return successors, (46), 19 states have call predecessors, (46), 20 states have call successors, (46) [2023-02-15 00:46:53,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:46:53,508 INFO L93 Difference]: Finished difference Result 308 states and 572 transitions. [2023-02-15 00:46:53,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-02-15 00:46:53,512 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.58974358974359) internal successors, (101), 34 states have internal predecessors, (101), 20 states have call successors, (26), 2 states have call predecessors, (26), 19 states have return successors, (46), 19 states have call predecessors, (46), 20 states have call successors, (46) Word has length 275 [2023-02-15 00:46:53,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:46:53,515 INFO L225 Difference]: With dead ends: 308 [2023-02-15 00:46:53,515 INFO L226 Difference]: Without dead ends: 156 [2023-02-15 00:46:53,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 695 GetRequests, 598 SyntacticMatches, 25 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1347 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1096, Invalid=4306, Unknown=0, NotChecked=0, Total=5402 [2023-02-15 00:46:53,519 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 103 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 00:46:53,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 270 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 00:46:53,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-15 00:46:53,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2023-02-15 00:46:53,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 102 states have (on average 1.0784313725490196) internal successors, (110), 103 states have internal predecessors, (110), 27 states have call successors, (27), 10 states have call predecessors, (27), 26 states have return successors, (105), 42 states have call predecessors, (105), 27 states have call successors, (105) [2023-02-15 00:46:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 242 transitions. [2023-02-15 00:46:53,534 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 242 transitions. Word has length 275 [2023-02-15 00:46:53,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:46:53,534 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 242 transitions. [2023-02-15 00:46:53,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.58974358974359) internal successors, (101), 34 states have internal predecessors, (101), 20 states have call successors, (26), 2 states have call predecessors, (26), 19 states have return successors, (46), 19 states have call predecessors, (46), 20 states have call successors, (46) [2023-02-15 00:46:53,535 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 242 transitions. [2023-02-15 00:46:53,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2023-02-15 00:46:53,538 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:46:53,538 INFO L195 NwaCegarLoop]: trace histogram [43, 43, 24, 19, 18, 18, 18, 18, 18, 18, 18, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:46:53,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-15 00:46:53,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-15 00:46:53,746 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 00:46:53,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:46:53,746 INFO L85 PathProgramCache]: Analyzing trace with hash 160073869, now seen corresponding path program 12 times [2023-02-15 00:46:53,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 00:46:53,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649609267] [2023-02-15 00:46:53,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:46:53,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 00:46:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:53,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 00:46:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 00:46:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 00:46:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-15 00:46:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-02-15 00:46:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 00:46:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-15 00:46:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-02-15 00:46:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-02-15 00:46:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2023-02-15 00:46:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 00:46:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 00:46:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 00:46:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-15 00:46:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-02-15 00:46:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-02-15 00:46:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-02-15 00:46:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:46:54,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4530 backedges. 563 proven. 1446 refuted. 0 times theorem prover too weak. 2521 trivial. 0 not checked. [2023-02-15 00:46:54,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 00:46:54,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649609267] [2023-02-15 00:46:54,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649609267] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 00:46:54,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473478106] [2023-02-15 00:46:54,645 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-15 00:46:54,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 00:46:54,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 00:46:54,646 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 00:46:54,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 00:46:55,052 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2023-02-15 00:46:55,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 00:46:55,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 00:46:55,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:46:55,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4530 backedges. 342 proven. 850 refuted. 0 times theorem prover too weak. 3338 trivial. 0 not checked. [2023-02-15 00:46:55,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:46:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4530 backedges. 352 proven. 878 refuted. 0 times theorem prover too weak. 3300 trivial. 0 not checked. [2023-02-15 00:46:56,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473478106] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:46:56,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 00:46:56,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 11] total 17 [2023-02-15 00:46:56,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757794911] [2023-02-15 00:46:56,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 00:46:56,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 00:46:56,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 00:46:56,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 00:46:56,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2023-02-15 00:46:56,693 INFO L87 Difference]: Start difference. First operand 156 states and 242 transitions. Second operand has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 11 states have call successors, (20), 1 states have call predecessors, (20), 8 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2023-02-15 00:46:56,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:46:56,840 INFO L93 Difference]: Finished difference Result 304 states and 532 transitions. [2023-02-15 00:46:56,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 00:46:56,841 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 11 states have call successors, (20), 1 states have call predecessors, (20), 8 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) Word has length 288 [2023-02-15 00:46:56,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:46:56,842 INFO L225 Difference]: With dead ends: 304 [2023-02-15 00:46:56,842 INFO L226 Difference]: Without dead ends: 0 [2023-02-15 00:46:56,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 685 GetRequests, 656 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2023-02-15 00:46:56,844 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 45 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 00:46:56,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 143 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 00:46:56,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-15 00:46:56,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-15 00:46:56,845 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) [2023-02-15 00:46:56,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-15 00:46:56,846 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 288 [2023-02-15 00:46:56,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:46:56,846 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 00:46:56,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 11 states have call successors, (20), 1 states have call predecessors, (20), 8 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2023-02-15 00:46:56,846 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-15 00:46:56,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-15 00:46:56,848 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 00:46:56,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-15 00:46:57,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-15 00:46:57,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-15 00:46:58,371 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-15 00:46:58,371 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-15 00:46:58,371 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 33) no Hoare annotation was computed. [2023-02-15 00:46:58,371 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-15 00:46:58,372 INFO L902 garLoopResultBuilder]: At program point L27(lines 27 47) the Hoare annotation is: true [2023-02-15 00:46:58,372 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 45) no Hoare annotation was computed. [2023-02-15 00:46:58,372 INFO L899 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2023-02-15 00:46:58,372 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 46) no Hoare annotation was computed. [2023-02-15 00:46:58,372 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-15 00:46:58,372 INFO L902 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: true [2023-02-15 00:46:58,372 INFO L899 garLoopResultBuilder]: For program point L41-1(line 41) no Hoare annotation was computed. [2023-02-15 00:46:58,372 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 40) no Hoare annotation was computed. [2023-02-15 00:46:58,373 INFO L899 garLoopResultBuilder]: For program point ackermannEXIT(lines 16 24) no Hoare annotation was computed. [2023-02-15 00:46:58,373 INFO L895 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: (and (or (not (<= 1 |ackermann_#in~n|)) (not (= |ackermann_#in~m| 0)) (not (< |ackermann_#in~n| 2))) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)) [2023-02-15 00:46:58,373 INFO L899 garLoopResultBuilder]: For program point L23-1(line 23) no Hoare annotation was computed. [2023-02-15 00:46:58,373 INFO L895 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: (and (= |ackermann_#in~n| 0) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)) [2023-02-15 00:46:58,378 INFO L895 garLoopResultBuilder]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse5 (<= |ackermann_#t~ret5| 5)) (.cse7 (<= 3 |ackermann_#in~n|)) (.cse9 (<= 2 |ackermann_#in~n|)) (.cse11 (<= 1 |ackermann_#in~m|)) (.cse6 (<= |ackermann_#in~m| 1)) (.cse4 (<= 5 |ackermann_#t~ret5|)) (.cse12 (<= 3 |ackermann_#in~m|)) (.cse13 (<= 2 |ackermann_#in~m|)) (.cse8 (<= 3 |ackermann_#t~ret5|)) (.cse0 (= ackermann_~n |ackermann_#in~n|)) (.cse1 (<= 1 |ackermann_#in~n|)) (.cse2 (= ackermann_~m |ackermann_#in~m|)) (.cse10 (<= |ackermann_#t~ret5| 3)) (.cse3 (<= |ackermann_#in~n| 1))) (and (or (and (<= |ackermann_#t~ret5| 2) .cse0 (<= 2 |ackermann_#t~ret5|) .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse0 (<= 4 |ackermann_#in~n|) .cse2 (<= |ackermann_#in~n| 4)) (not .cse6) (and (<= |ackermann_#in~n| 3) (<= |ackermann_#t~ret5| 4) .cse0 .cse7 .cse2 (<= 4 |ackermann_#t~ret5|)) (and (<= |ackermann_#in~n| 2) .cse8 .cse0 .cse9 .cse2 .cse10) (and .cse4 .cse0 .cse2 (<= 6 |ackermann_#in~n|)) (not .cse11) (and (<= 6 |ackermann_#t~ret5|) .cse0 (<= |ackermann_#t~ret5| 6) .cse2 (<= 5 |ackermann_#in~n|))) (or .cse5 .cse7 .cse12 (not .cse13)) (or (and (= |ackermann_#in~m| 0) .cse0 .cse2) (and .cse4 .cse13 .cse0 .cse9 .cse2) (and .cse11 .cse6) (and .cse4 .cse0 .cse12 .cse1 .cse2) (and .cse13 .cse8 .cse0 (<= ackermann_~m 2) .cse1 .cse2 .cse10 .cse3)))) [2023-02-15 00:46:58,378 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 22) no Hoare annotation was computed. [2023-02-15 00:46:58,378 INFO L899 garLoopResultBuilder]: For program point L21-1(line 21) no Hoare annotation was computed. [2023-02-15 00:46:58,378 INFO L899 garLoopResultBuilder]: For program point L23-3(line 23) no Hoare annotation was computed. [2023-02-15 00:46:58,378 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 19) no Hoare annotation was computed. [2023-02-15 00:46:58,378 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 16 24) the Hoare annotation is: true [2023-02-15 00:46:58,378 INFO L899 garLoopResultBuilder]: For program point ackermannFINAL(lines 16 24) no Hoare annotation was computed. [2023-02-15 00:46:58,381 INFO L445 BasicCegarLoop]: Path program histogram: [12, 1, 1] [2023-02-15 00:46:58,382 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 00:46:58,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 12:46:58 BoogieIcfgContainer [2023-02-15 00:46:58,408 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 00:46:58,408 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 00:46:58,408 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 00:46:58,409 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 00:46:58,409 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:46:09" (3/4) ... [2023-02-15 00:46:58,411 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-15 00:46:58,416 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ackermann [2023-02-15 00:46:58,418 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2023-02-15 00:46:58,419 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-02-15 00:46:58,419 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-15 00:46:58,419 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-15 00:46:58,440 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 00:46:58,441 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 00:46:58,441 INFO L158 Benchmark]: Toolchain (without parser) took 49612.76ms. Allocated memory was 176.2MB in the beginning and 775.9MB in the end (delta: 599.8MB). Free memory was 128.5MB in the beginning and 383.0MB in the end (delta: -254.5MB). Peak memory consumption was 346.9MB. Max. memory is 16.1GB. [2023-02-15 00:46:58,441 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 146.8MB. Free memory was 92.3MB in the beginning and 92.2MB in the end (delta: 178.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 00:46:58,442 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.54ms. Allocated memory is still 176.2MB. Free memory was 128.5MB in the beginning and 118.5MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 00:46:58,442 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.21ms. Allocated memory is still 176.2MB. Free memory was 118.5MB in the beginning and 117.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 00:46:58,442 INFO L158 Benchmark]: Boogie Preprocessor took 11.09ms. Allocated memory is still 176.2MB. Free memory was 117.0MB in the beginning and 115.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 00:46:58,442 INFO L158 Benchmark]: RCFGBuilder took 249.94ms. Allocated memory is still 176.2MB. Free memory was 115.9MB in the beginning and 105.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 00:46:58,443 INFO L158 Benchmark]: TraceAbstraction took 49132.01ms. Allocated memory was 176.2MB in the beginning and 775.9MB in the end (delta: 599.8MB). Free memory was 104.9MB in the beginning and 386.2MB in the end (delta: -281.2MB). Peak memory consumption was 321.7MB. Max. memory is 16.1GB. [2023-02-15 00:46:58,443 INFO L158 Benchmark]: Witness Printer took 32.28ms. Allocated memory is still 775.9MB. Free memory was 386.2MB in the beginning and 383.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 00:46:58,447 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 146.8MB. Free memory was 92.3MB in the beginning and 92.2MB in the end (delta: 178.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 162.54ms. Allocated memory is still 176.2MB. Free memory was 128.5MB in the beginning and 118.5MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.21ms. Allocated memory is still 176.2MB. Free memory was 118.5MB in the beginning and 117.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 11.09ms. Allocated memory is still 176.2MB. Free memory was 117.0MB in the beginning and 115.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 249.94ms. Allocated memory is still 176.2MB. Free memory was 115.9MB in the beginning and 105.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 49132.01ms. Allocated memory was 176.2MB in the beginning and 775.9MB in the end (delta: 599.8MB). Free memory was 104.9MB in the beginning and 386.2MB in the end (delta: -281.2MB). Peak memory consumption was 321.7MB. Max. memory is 16.1GB. * Witness Printer took 32.28ms. Allocated memory is still 775.9MB. Free memory was 386.2MB in the beginning and 383.0MB 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: 45]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.0s, OverallIterations: 14, TraceHistogramMax: 43, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 903 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 840 mSDsluCounter, 2878 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2500 mSDsCounter, 1420 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7108 IncrementalHoareTripleChecker+Invalid, 8528 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1420 mSolverCounterUnsat, 378 mSDtfsCounter, 7108 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5537 GetRequests, 4803 SyntacticMatches, 157 SemanticMatches, 577 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7708 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=187occurred in iteration=8, InterpolantAutomatonStates: 330, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 77 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 938 PreInvPairs, 2505 NumberOfFragments, 237 HoareAnnotationTreeSize, 938 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 15588 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 34.7s InterpolantComputationTime, 4420 NumberOfCodeBlocks, 4197 NumberOfCodeBlocksAsserted, 128 NumberOfCheckSat, 6584 ConstructedInterpolants, 0 QuantifiedInterpolants, 12631 SizeOfPredicates, 117 NumberOfNonLiveVariables, 6042 ConjunctsInSsa, 355 ConjunctsInUnsatCore, 40 InterpolantComputations, 1 PerfectInterpolantSequences, 57260/72621 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: 27]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-02-15 00:46:58,472 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