./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c 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/nla-digbench-scaling/hard2_valuebound1.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 45ff7b74faf4250f77b788e07275d725ea3dbcc73af0b2b0d64dcf5aa7f7b78a --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 02:06:44,146 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 02:06:44,147 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 02:06:44,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 02:06:44,175 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 02:06:44,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 02:06:44,181 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 02:06:44,183 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 02:06:44,184 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 02:06:44,187 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 02:06:44,189 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 02:06:44,190 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 02:06:44,190 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 02:06:44,192 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 02:06:44,194 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 02:06:44,195 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 02:06:44,196 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 02:06:44,197 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 02:06:44,198 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 02:06:44,202 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 02:06:44,202 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 02:06:44,203 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 02:06:44,204 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 02:06:44,205 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 02:06:44,211 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 02:06:44,211 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 02:06:44,212 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 02:06:44,213 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 02:06:44,213 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 02:06:44,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 02:06:44,214 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 02:06:44,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 02:06:44,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 02:06:44,217 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 02:06:44,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 02:06:44,219 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 02:06:44,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 02:06:44,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 02:06:44,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 02:06:44,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 02:06:44,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 02:06:44,223 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 02:06:44,247 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 02:06:44,248 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 02:06:44,248 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 02:06:44,248 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 02:06:44,249 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 02:06:44,250 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 02:06:44,250 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 02:06:44,250 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 02:06:44,250 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 02:06:44,251 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 02:06:44,251 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 02:06:44,251 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 02:06:44,251 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 02:06:44,252 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 02:06:44,252 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 02:06:44,252 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 02:06:44,252 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 02:06:44,252 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 02:06:44,252 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 02:06:44,253 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 02:06:44,253 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 02:06:44,253 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 02:06:44,253 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 02:06:44,253 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 02:06:44,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:06:44,253 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 02:06:44,254 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 02:06:44,254 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 02:06:44,254 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 02:06:44,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 02:06:44,254 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 02:06:44,255 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 02:06:44,255 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 02:06:44,255 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 02:06:44,255 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 02:06:44,255 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 -> 45ff7b74faf4250f77b788e07275d725ea3dbcc73af0b2b0d64dcf5aa7f7b78a [2023-02-17 02:06:44,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 02:06:44,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 02:06:44,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 02:06:44,472 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 02:06:44,473 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 02:06:44,473 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound1.c [2023-02-17 02:06:45,427 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 02:06:45,537 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 02:06:45,537 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound1.c [2023-02-17 02:06:45,541 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7e33960/66dd0525064e4ac9be6925fc221ce153/FLAG56fc13e3c [2023-02-17 02:06:45,975 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7e33960/66dd0525064e4ac9be6925fc221ce153 [2023-02-17 02:06:45,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 02:06:45,978 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 02:06:45,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 02:06:45,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 02:06:45,982 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 02:06:45,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:06:45" (1/1) ... [2023-02-17 02:06:45,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c1591df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:06:45, skipping insertion in model container [2023-02-17 02:06:45,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:06:45" (1/1) ... [2023-02-17 02:06:45,990 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 02:06:46,005 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 02:06:46,097 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/nla-digbench-scaling/hard2_valuebound1.c[526,539] [2023-02-17 02:06:46,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:06:46,114 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 02:06:46,121 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/nla-digbench-scaling/hard2_valuebound1.c[526,539] [2023-02-17 02:06:46,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:06:46,137 INFO L208 MainTranslator]: Completed translation [2023-02-17 02:06:46,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:06:46 WrapperNode [2023-02-17 02:06:46,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 02:06:46,138 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 02:06:46,138 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 02:06:46,138 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 02:06:46,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:06:46" (1/1) ... [2023-02-17 02:06:46,148 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:06:46" (1/1) ... [2023-02-17 02:06:46,162 INFO L138 Inliner]: procedures = 14, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2023-02-17 02:06:46,163 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 02:06:46,163 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 02:06:46,163 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 02:06:46,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 02:06:46,169 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:06:46" (1/1) ... [2023-02-17 02:06:46,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:06:46" (1/1) ... [2023-02-17 02:06:46,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:06:46" (1/1) ... [2023-02-17 02:06:46,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:06:46" (1/1) ... [2023-02-17 02:06:46,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:06:46" (1/1) ... [2023-02-17 02:06:46,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:06:46" (1/1) ... [2023-02-17 02:06:46,189 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:06:46" (1/1) ... [2023-02-17 02:06:46,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:06:46" (1/1) ... [2023-02-17 02:06:46,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 02:06:46,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 02:06:46,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 02:06:46,195 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 02:06:46,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:06:46" (1/1) ... [2023-02-17 02:06:46,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:06:46,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:06:46,217 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-17 02:06:46,236 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-17 02:06:46,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 02:06:46,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 02:06:46,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 02:06:46,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 02:06:46,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-17 02:06:46,247 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-17 02:06:46,289 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 02:06:46,290 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 02:06:46,419 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 02:06:46,423 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 02:06:46,423 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-17 02:06:46,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:06:46 BoogieIcfgContainer [2023-02-17 02:06:46,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 02:06:46,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 02:06:46,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 02:06:46,428 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 02:06:46,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 02:06:45" (1/3) ... [2023-02-17 02:06:46,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58cadabd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:06:46, skipping insertion in model container [2023-02-17 02:06:46,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:06:46" (2/3) ... [2023-02-17 02:06:46,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58cadabd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:06:46, skipping insertion in model container [2023-02-17 02:06:46,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:06:46" (3/3) ... [2023-02-17 02:06:46,431 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2_valuebound1.c [2023-02-17 02:06:46,442 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 02:06:46,442 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 02:06:46,481 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 02:06:46,486 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;@4ea31990, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 02:06:46,487 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 02:06:46,489 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 02:06:46,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 02:06:46,495 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:06:46,495 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:06:46,496 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:06:46,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:06:46,500 INFO L85 PathProgramCache]: Analyzing trace with hash -586848446, now seen corresponding path program 1 times [2023-02-17 02:06:46,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:06:46,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692723534] [2023-02-17 02:06:46,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:06:46,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:06:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:06:46,624 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-17 02:06:46,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:06:46,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692723534] [2023-02-17 02:06:46,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692723534] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:06:46,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:06:46,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 02:06:46,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693766486] [2023-02-17 02:06:46,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:06:46,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 02:06:46,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:06:46,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 02:06:46,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 02:06:46,657 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 02:06:46,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:06:46,674 INFO L93 Difference]: Finished difference Result 49 states and 83 transitions. [2023-02-17 02:06:46,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 02:06:46,676 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-17 02:06:46,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:06:46,683 INFO L225 Difference]: With dead ends: 49 [2023-02-17 02:06:46,683 INFO L226 Difference]: Without dead ends: 22 [2023-02-17 02:06:46,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 02:06:46,688 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:06:46,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:06:46,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-17 02:06:46,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-17 02:06:46,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 02:06:46,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2023-02-17 02:06:46,714 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 9 [2023-02-17 02:06:46,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:06:46,715 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2023-02-17 02:06:46,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 02:06:46,716 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2023-02-17 02:06:46,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 02:06:46,717 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:06:46,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:06:46,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 02:06:46,717 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:06:46,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:06:46,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1188158916, now seen corresponding path program 1 times [2023-02-17 02:06:46,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:06:46,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145493036] [2023-02-17 02:06:46,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:06:46,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:06:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:06:46,843 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-17 02:06:46,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:06:46,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145493036] [2023-02-17 02:06:46,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145493036] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:06:46,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:06:46,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:06:46,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650152617] [2023-02-17 02:06:46,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:06:46,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:06:46,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:06:46,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:06:46,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:06:46,859 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 02:06:46,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:06:46,922 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2023-02-17 02:06:46,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:06:46,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-17 02:06:46,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:06:46,923 INFO L225 Difference]: With dead ends: 35 [2023-02-17 02:06:46,923 INFO L226 Difference]: Without dead ends: 33 [2023-02-17 02:06:46,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-17 02:06:46,925 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 12 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:06:46,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 92 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:06:46,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-17 02:06:46,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2023-02-17 02:06:46,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 02:06:46,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2023-02-17 02:06:46,933 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2023-02-17 02:06:46,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:06:46,934 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2023-02-17 02:06:46,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 02:06:46,934 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2023-02-17 02:06:46,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-17 02:06:46,934 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:06:46,935 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:06:46,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 02:06:46,935 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:06:46,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:06:46,936 INFO L85 PathProgramCache]: Analyzing trace with hash -697944935, now seen corresponding path program 1 times [2023-02-17 02:06:46,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:06:46,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53798697] [2023-02-17 02:06:46,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:06:46,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:06:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:06:46,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 02:06:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:06:47,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:06:47,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:06:47,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53798697] [2023-02-17 02:06:47,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53798697] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:06:47,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:06:47,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:06:47,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196901637] [2023-02-17 02:06:47,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:06:47,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:06:47,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:06:47,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:06:47,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:06:47,021 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:06:47,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:06:47,075 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2023-02-17 02:06:47,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:06:47,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-02-17 02:06:47,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:06:47,078 INFO L225 Difference]: With dead ends: 39 [2023-02-17 02:06:47,078 INFO L226 Difference]: Without dead ends: 37 [2023-02-17 02:06:47,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:06:47,079 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:06:47,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 88 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:06:47,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-17 02:06:47,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2023-02-17 02:06:47,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 02:06:47,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-02-17 02:06:47,088 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 14 [2023-02-17 02:06:47,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:06:47,088 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-02-17 02:06:47,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 02:06:47,089 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-02-17 02:06:47,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 02:06:47,090 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:06:47,090 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:06:47,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 02:06:47,090 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:06:47,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:06:47,092 INFO L85 PathProgramCache]: Analyzing trace with hash 262992548, now seen corresponding path program 1 times [2023-02-17 02:06:47,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:06:47,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532898356] [2023-02-17 02:06:47,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:06:47,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:06:47,106 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:06:47,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1073511555] [2023-02-17 02:06:47,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:06:47,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:06:47,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:06:47,123 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-17 02:06:47,124 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-17 02:06:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:06:47,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 02:06:47,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:06:47,267 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 02:06:47,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:06:47,361 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 02:06:47,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:06:47,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532898356] [2023-02-17 02:06:47,361 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:06:47,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073511555] [2023-02-17 02:06:47,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073511555] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:06:47,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:06:47,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-17 02:06:47,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302807902] [2023-02-17 02:06:47,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:06:47,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 02:06:47,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:06:47,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 02:06:47,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-17 02:06:47,363 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 02:06:47,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:06:47,828 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2023-02-17 02:06:47,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 02:06:47,829 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2023-02-17 02:06:47,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:06:47,830 INFO L225 Difference]: With dead ends: 65 [2023-02-17 02:06:47,830 INFO L226 Difference]: Without dead ends: 51 [2023-02-17 02:06:47,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-17 02:06:47,832 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 26 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 02:06:47,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 60 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 02:06:47,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-17 02:06:47,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-02-17 02:06:47,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 33 states have internal predecessors, (35), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-02-17 02:06:47,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2023-02-17 02:06:47,841 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 19 [2023-02-17 02:06:47,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:06:47,841 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2023-02-17 02:06:47,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 02:06:47,841 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2023-02-17 02:06:47,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 02:06:47,842 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:06:47,842 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:06:47,861 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-17 02:06:48,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:06:48,048 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:06:48,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:06:48,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1807142342, now seen corresponding path program 1 times [2023-02-17 02:06:48,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:06:48,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076322571] [2023-02-17 02:06:48,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:06:48,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:06:48,063 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:06:48,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [516531620] [2023-02-17 02:06:48,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:06:48,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:06:48,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:06:48,072 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-17 02:06:48,074 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-17 02:06:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:06:48,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 02:06:48,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:06:48,180 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 02:06:48,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:06:48,253 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 02:06:48,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:06:48,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076322571] [2023-02-17 02:06:48,254 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:06:48,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516531620] [2023-02-17 02:06:48,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516531620] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:06:48,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:06:48,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2023-02-17 02:06:48,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702638496] [2023-02-17 02:06:48,255 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:06:48,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 02:06:48,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:06:48,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 02:06:48,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-17 02:06:48,257 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-17 02:06:48,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:06:48,391 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2023-02-17 02:06:48,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 02:06:48,391 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 26 [2023-02-17 02:06:48,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:06:48,392 INFO L225 Difference]: With dead ends: 66 [2023-02-17 02:06:48,392 INFO L226 Difference]: Without dead ends: 59 [2023-02-17 02:06:48,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-02-17 02:06:48,394 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:06:48,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 80 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:06:48,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-17 02:06:48,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2023-02-17 02:06:48,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 39 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-17 02:06:48,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2023-02-17 02:06:48,403 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 26 [2023-02-17 02:06:48,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:06:48,403 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2023-02-17 02:06:48,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-17 02:06:48,404 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2023-02-17 02:06:48,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-17 02:06:48,405 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:06:48,405 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:06:48,423 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-17 02:06:48,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:06:48,610 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:06:48,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:06:48,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1034157389, now seen corresponding path program 1 times [2023-02-17 02:06:48,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:06:48,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650621556] [2023-02-17 02:06:48,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:06:48,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:06:48,620 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:06:48,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1071632625] [2023-02-17 02:06:48,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:06:48,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:06:48,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:06:48,622 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-17 02:06:48,624 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-17 02:06:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:06:48,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-17 02:06:48,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:06:48,748 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-02-17 02:06:48,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:06:48,945 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-02-17 02:06:48,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:06:48,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650621556] [2023-02-17 02:06:48,945 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:06:48,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071632625] [2023-02-17 02:06:48,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071632625] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:06:48,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:06:48,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-02-17 02:06:48,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822680429] [2023-02-17 02:06:48,949 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:06:48,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-17 02:06:48,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:06:48,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-17 02:06:48,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-02-17 02:06:48,952 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2023-02-17 02:06:50,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:06:50,247 INFO L93 Difference]: Finished difference Result 142 states and 193 transitions. [2023-02-17 02:06:50,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 02:06:50,248 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 56 [2023-02-17 02:06:50,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:06:50,249 INFO L225 Difference]: With dead ends: 142 [2023-02-17 02:06:50,250 INFO L226 Difference]: Without dead ends: 111 [2023-02-17 02:06:50,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-02-17 02:06:50,251 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 48 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:06:50,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 94 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-17 02:06:50,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-17 02:06:50,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2023-02-17 02:06:50,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 64 states have (on average 1.203125) internal successors, (77), 71 states have internal predecessors, (77), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (30), 24 states have call predecessors, (30), 30 states have call successors, (30) [2023-02-17 02:06:50,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 138 transitions. [2023-02-17 02:06:50,292 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 138 transitions. Word has length 56 [2023-02-17 02:06:50,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:06:50,294 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 138 transitions. [2023-02-17 02:06:50,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2023-02-17 02:06:50,295 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 138 transitions. [2023-02-17 02:06:50,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-17 02:06:50,300 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:06:50,300 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:06:50,307 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-17 02:06:50,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:06:50,506 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:06:50,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:06:50,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1199454569, now seen corresponding path program 1 times [2023-02-17 02:06:50,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:06:50,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282682717] [2023-02-17 02:06:50,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:06:50,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:06:50,513 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:06:50,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [394190414] [2023-02-17 02:06:50,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:06:50,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:06:50,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:06:50,515 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-17 02:06:50,517 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-17 02:06:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:06:50,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-17 02:06:50,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:06:50,615 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 22 proven. 34 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-17 02:06:50,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:06:50,778 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 22 proven. 34 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-17 02:06:50,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:06:50,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282682717] [2023-02-17 02:06:50,778 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:06:50,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394190414] [2023-02-17 02:06:50,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394190414] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:06:50,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:06:50,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-02-17 02:06:50,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091538453] [2023-02-17 02:06:50,780 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:06:50,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 02:06:50,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:06:50,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 02:06:50,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-02-17 02:06:50,783 INFO L87 Difference]: Start difference. First operand 106 states and 138 transitions. Second operand has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2023-02-17 02:06:51,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:06:51,438 INFO L93 Difference]: Finished difference Result 161 states and 210 transitions. [2023-02-17 02:06:51,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 02:06:51,439 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) Word has length 67 [2023-02-17 02:06:51,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:06:51,440 INFO L225 Difference]: With dead ends: 161 [2023-02-17 02:06:51,440 INFO L226 Difference]: Without dead ends: 123 [2023-02-17 02:06:51,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2023-02-17 02:06:51,441 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 25 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 02:06:51,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 87 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 02:06:51,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-02-17 02:06:51,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 101. [2023-02-17 02:06:51,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 66 states have internal predecessors, (72), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2023-02-17 02:06:51,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 125 transitions. [2023-02-17 02:06:51,472 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 125 transitions. Word has length 67 [2023-02-17 02:06:51,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:06:51,472 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 125 transitions. [2023-02-17 02:06:51,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2023-02-17 02:06:51,472 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 125 transitions. [2023-02-17 02:06:51,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-17 02:06:51,473 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:06:51,473 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:06:51,480 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-17 02:06:51,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:06:51,683 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:06:51,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:06:51,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1728532070, now seen corresponding path program 1 times [2023-02-17 02:06:51,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:06:51,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537754967] [2023-02-17 02:06:51,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:06:51,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:06:51,689 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:06:51,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1225204628] [2023-02-17 02:06:51,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:06:51,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:06:51,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:06:51,733 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-17 02:06:51,767 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-17 02:06:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:06:51,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-17 02:06:51,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:06:51,837 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 24 proven. 37 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-17 02:06:51,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:06:51,937 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 24 proven. 37 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-17 02:06:51,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:06:51,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537754967] [2023-02-17 02:06:51,937 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:06:51,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225204628] [2023-02-17 02:06:51,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225204628] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:06:51,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:06:51,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-02-17 02:06:51,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350506617] [2023-02-17 02:06:51,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:06:51,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 02:06:51,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:06:51,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 02:06:51,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-02-17 02:06:51,939 INFO L87 Difference]: Start difference. First operand 101 states and 125 transitions. Second operand has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 8 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) [2023-02-17 02:06:52,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:06:52,196 INFO L93 Difference]: Finished difference Result 117 states and 139 transitions. [2023-02-17 02:06:52,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 02:06:52,196 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 8 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) Word has length 72 [2023-02-17 02:06:52,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:06:52,197 INFO L225 Difference]: With dead ends: 117 [2023-02-17 02:06:52,197 INFO L226 Difference]: Without dead ends: 86 [2023-02-17 02:06:52,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2023-02-17 02:06:52,198 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:06:52,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 92 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:06:52,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-17 02:06:52,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-02-17 02:06:52,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 57 states have internal predecessors, (60), 21 states have call successors, (21), 10 states have call predecessors, (21), 10 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-17 02:06:52,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2023-02-17 02:06:52,213 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 72 [2023-02-17 02:06:52,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:06:52,214 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2023-02-17 02:06:52,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 8 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) [2023-02-17 02:06:52,214 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2023-02-17 02:06:52,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-17 02:06:52,216 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:06:52,216 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:06:52,223 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-17 02:06:52,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:06:52,424 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:06:52,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:06:52,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1412721000, now seen corresponding path program 1 times [2023-02-17 02:06:52,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:06:52,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442018349] [2023-02-17 02:06:52,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:06:52,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:06:52,436 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:06:52,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [651651216] [2023-02-17 02:06:52,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:06:52,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:06:52,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:06:52,438 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-17 02:06:52,439 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-17 02:06:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:06:52,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 02:06:52,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:06:52,522 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2023-02-17 02:06:52,522 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:06:52,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:06:52,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442018349] [2023-02-17 02:06:52,522 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:06:52,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651651216] [2023-02-17 02:06:52,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651651216] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:06:52,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:06:52,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 02:06:52,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814885155] [2023-02-17 02:06:52,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:06:52,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:06:52,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:06:52,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:06:52,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:06:52,524 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2023-02-17 02:06:52,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:06:52,586 INFO L93 Difference]: Finished difference Result 116 states and 138 transitions. [2023-02-17 02:06:52,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:06:52,586 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 86 [2023-02-17 02:06:52,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:06:52,587 INFO L225 Difference]: With dead ends: 116 [2023-02-17 02:06:52,587 INFO L226 Difference]: Without dead ends: 86 [2023-02-17 02:06:52,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-17 02:06:52,588 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:06:52,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 95 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:06:52,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-17 02:06:52,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2023-02-17 02:06:52,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.08) internal successors, (54), 52 states have internal predecessors, (54), 17 states have call successors, (17), 10 states have call predecessors, (17), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-02-17 02:06:52,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2023-02-17 02:06:52,600 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 86 [2023-02-17 02:06:52,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:06:52,600 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2023-02-17 02:06:52,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2023-02-17 02:06:52,601 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2023-02-17 02:06:52,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-17 02:06:52,601 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:06:52,601 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:06:52,608 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-17 02:06:52,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:06:52,805 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:06:52,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:06:52,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1193302554, now seen corresponding path program 2 times [2023-02-17 02:06:52,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:06:52,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343287700] [2023-02-17 02:06:52,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:06:52,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:06:52,811 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:06:52,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1156966053] [2023-02-17 02:06:52,811 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 02:06:52,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:06:52,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:06:52,815 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-17 02:06:52,816 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-17 02:06:52,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 02:06:52,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:06:52,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 02:06:52,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:06:52,898 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2023-02-17 02:06:52,899 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:06:52,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:06:52,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343287700] [2023-02-17 02:06:52,899 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:06:52,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156966053] [2023-02-17 02:06:52,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156966053] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:06:52,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:06:52,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 02:06:52,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59133017] [2023-02-17 02:06:52,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:06:52,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:06:52,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:06:52,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:06:52,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:06:52,901 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-02-17 02:06:52,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:06:52,928 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2023-02-17 02:06:52,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:06:52,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 86 [2023-02-17 02:06:52,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:06:52,929 INFO L225 Difference]: With dead ends: 78 [2023-02-17 02:06:52,929 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 02:06:52,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-02-17 02:06:52,930 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:06:52,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 38 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:06:52,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 02:06:52,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 02:06:52,931 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-17 02:06:52,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 02:06:52,931 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 86 [2023-02-17 02:06:52,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:06:52,931 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 02:06:52,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-02-17 02:06:52,932 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 02:06:52,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 02:06:52,934 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 02:06:52,955 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-17 02:06:53,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:06:53,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 02:06:53,151 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 55) no Hoare annotation was computed. [2023-02-17 02:06:53,160 INFO L895 garLoopResultBuilder]: At program point L52-2(lines 44 56) the Hoare annotation is: (let ((.cse10 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse11 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse15 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse16 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse12 (= |ULTIMATE.start_main_~B~0#1| 1))) (or (let ((.cse13 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse14 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse4 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (let ((.cse8 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse2 (and .cse14 (not .cse4))) (.cse0 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse13))) (.cse5 (not .cse14)) (.cse3 (* (+ |ULTIMATE.start_main_~q~0#1| (+ .cse13 1)) |ULTIMATE.start_main_~B~0#1|)) (.cse6 (- (div |ULTIMATE.start_main_~d~0#1| 2))) (.cse7 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0))) (and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~d~0#1| 1) (or (let ((.cse1 (+ |ULTIMATE.start_main_~r~0#1| .cse6))) (and (or (= (+ .cse0 .cse1) |ULTIMATE.start_main_~A~0#1|) .cse2) (or (= (+ .cse3 .cse1) |ULTIMATE.start_main_~A~0#1|) .cse4 .cse5))) (and (not .cse7) .cse8)) (or (not .cse8) (let ((.cse9 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse6)))) (and (or .cse2 (= (+ .cse9 .cse0) |ULTIMATE.start_main_~A~0#1|)) (or .cse4 .cse5 (= |ULTIMATE.start_main_~A~0#1| (+ .cse3 .cse9))))) .cse7) .cse10 .cse11 (= |ULTIMATE.start_main_~r~0#1| (+ (- |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~A~0#1| (+ (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~d~0#1|)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)))) .cse12 (= |ULTIMATE.start_main_~q~0#1| (+ 0 1)) (= (+ |ULTIMATE.start_main_~p~0#1| 0) |ULTIMATE.start_main_~q~0#1|)))) (and .cse10 .cse11 .cse15 .cse16 .cse12) (let ((.cse17 (* 2 1))) (and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~d~0#1| .cse17) .cse15 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|) .cse16 .cse12 (= |ULTIMATE.start_main_~p~0#1| .cse17))))) [2023-02-17 02:06:53,160 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 13) no Hoare annotation was computed. [2023-02-17 02:06:53,161 INFO L895 garLoopResultBuilder]: At program point L44-1(lines 44 56) the Hoare annotation is: (let ((.cse30 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse32 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse24 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (let ((.cse10 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse31 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse6 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse21 (and .cse32 (not .cse24))) (.cse25 (not .cse32)) (.cse29 (+ .cse30 1))) (let ((.cse0 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse2 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse5 (and (or (not (= .cse30 1)) .cse21) (or .cse24 .cse25 (not (= .cse29 1))))) (.cse9 (+ .cse6 1)) (.cse12 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (.cse4 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse8 (not .cse31)) (.cse7 (and (not .cse10) .cse31))) (let ((.cse11 (let ((.cse23 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse30))) (.cse26 (* (+ |ULTIMATE.start_main_~q~0#1| .cse29) |ULTIMATE.start_main_~B~0#1|)) (.cse27 (- .cse6))) (let ((.cse17 (or (let ((.cse28 (+ |ULTIMATE.start_main_~r~0#1| .cse27))) (and (or (= (+ .cse23 .cse28) |ULTIMATE.start_main_~A~0#1|) .cse21) (or (= (+ .cse26 .cse28) |ULTIMATE.start_main_~A~0#1|) .cse24 .cse25))) .cse7)) (.cse18 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse19 (or .cse8 (let ((.cse22 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse27)))) (and (or .cse21 (= (+ .cse22 .cse23) |ULTIMATE.start_main_~A~0#1|)) (or .cse24 .cse25 (= |ULTIMATE.start_main_~A~0#1| (+ .cse26 .cse22))))) .cse10)) (.cse20 (= |ULTIMATE.start_main_~A~0#1| (+ (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~d~0#1|)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)))))) (let ((.cse16 (or (and .cse18 .cse12 .cse20) (and .cse17 .cse18 .cse19 .cse12 .cse20) (and .cse17 .cse18 .cse19 (= |ULTIMATE.start_main_~r~0#1| (+ (- |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~A~0#1|)) .cse12 .cse20 .cse4 (= |ULTIMATE.start_main_~q~0#1| (+ 0 1))))) (.cse15 (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (.cse13 (or .cse5 (and (or .cse8 .cse10 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse9)) |ULTIMATE.start_main_~A~0#1|)) (or .cse7 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse6 |ULTIMATE.start_main_~q~0#1|))))))) (.cse14 (or (and .cse17 .cse18 .cse19 .cse2 .cse12 .cse3 .cse20 .cse4) (and .cse18 .cse2 .cse12 .cse3 .cse20 .cse4)))) (or (and .cse13 .cse14 .cse15) (and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~d~0#1| 1) .cse0 .cse16 (= (+ |ULTIMATE.start_main_~p~0#1| 0) |ULTIMATE.start_main_~q~0#1|)) (and .cse13 .cse16 .cse15) (and .cse13 .cse14)))))) (.cse1 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (or .cse5 (and (or (= .cse6 |ULTIMATE.start_main_~B~0#1|) .cse7) (or .cse8 (= |ULTIMATE.start_main_~B~0#1| .cse9) .cse10))) .cse1 .cse11) (and .cse0 .cse1 .cse11 .cse4) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse4)))))) [2023-02-17 02:06:53,161 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 22 61) the Hoare annotation is: true [2023-02-17 02:06:53,161 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse0 (>= |ULTIMATE.start_main_~A~0#1| 0)) (.cse3 (<= |ULTIMATE.start_main_~A~0#1| 1)) (.cse5 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))) (let ((.cse2 (<= |ULTIMATE.start_main_~r~0#1| 1)) (.cse4 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse6 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse7 (or .cse5 (and (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0) (not .cse5)))) (.cse8 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse0 .cse3) (and (or (not .cse0) (not .cse3)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))))) (or (let ((.cse1 (* 2 1))) (and .cse0 (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~d~0#1| .cse1) .cse2 .cse3 (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse4 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|) .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~p~0#1| .cse1))) (and .cse0 (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) .cse2 .cse3 .cse4 (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse5 .cse6 .cse7 .cse8)))) [2023-02-17 02:06:53,161 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 02:06:53,161 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 02:06:53,162 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (let ((.cse10 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse11 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse15 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse16 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse12 (= |ULTIMATE.start_main_~B~0#1| 1))) (or (let ((.cse13 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse14 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse4 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (let ((.cse8 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse2 (and .cse14 (not .cse4))) (.cse0 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse13))) (.cse5 (not .cse14)) (.cse3 (* (+ |ULTIMATE.start_main_~q~0#1| (+ .cse13 1)) |ULTIMATE.start_main_~B~0#1|)) (.cse6 (- (div |ULTIMATE.start_main_~d~0#1| 2))) (.cse7 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0))) (and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~d~0#1| 1) (or (let ((.cse1 (+ |ULTIMATE.start_main_~r~0#1| .cse6))) (and (or (= (+ .cse0 .cse1) |ULTIMATE.start_main_~A~0#1|) .cse2) (or (= (+ .cse3 .cse1) |ULTIMATE.start_main_~A~0#1|) .cse4 .cse5))) (and (not .cse7) .cse8)) (or (not .cse8) (let ((.cse9 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse6)))) (and (or .cse2 (= (+ .cse9 .cse0) |ULTIMATE.start_main_~A~0#1|)) (or .cse4 .cse5 (= |ULTIMATE.start_main_~A~0#1| (+ .cse3 .cse9))))) .cse7) .cse10 .cse11 (= |ULTIMATE.start_main_~r~0#1| (+ (- |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~A~0#1| (+ (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~d~0#1|)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)))) .cse12 (= |ULTIMATE.start_main_~q~0#1| (+ 0 1)) (= (+ |ULTIMATE.start_main_~p~0#1| 0) |ULTIMATE.start_main_~q~0#1|)))) (and .cse10 .cse11 .cse15 .cse16 .cse12) (let ((.cse17 (* 2 1))) (and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~d~0#1| .cse17) .cse15 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|) .cse16 .cse12 (= |ULTIMATE.start_main_~p~0#1| .cse17))))) [2023-02-17 02:06:53,162 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-02-17 02:06:53,162 INFO L895 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: (let ((.cse10 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse11 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|)) (.cse15 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse16 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse12 (= |ULTIMATE.start_main_~B~0#1| 1))) (or (let ((.cse13 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse14 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse4 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (let ((.cse8 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse2 (and .cse14 (not .cse4))) (.cse0 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse13))) (.cse5 (not .cse14)) (.cse3 (* (+ |ULTIMATE.start_main_~q~0#1| (+ .cse13 1)) |ULTIMATE.start_main_~B~0#1|)) (.cse6 (- (div |ULTIMATE.start_main_~d~0#1| 2))) (.cse7 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0))) (and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~d~0#1| 1) (or (let ((.cse1 (+ |ULTIMATE.start_main_~r~0#1| .cse6))) (and (or (= (+ .cse0 .cse1) |ULTIMATE.start_main_~A~0#1|) .cse2) (or (= (+ .cse3 .cse1) |ULTIMATE.start_main_~A~0#1|) .cse4 .cse5))) (and (not .cse7) .cse8)) (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) (or (not .cse8) (let ((.cse9 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse6)))) (and (or .cse2 (= (+ .cse9 .cse0) |ULTIMATE.start_main_~A~0#1|)) (or .cse4 .cse5 (= |ULTIMATE.start_main_~A~0#1| (+ .cse3 .cse9))))) .cse7) .cse10 .cse11 (= |ULTIMATE.start_main_~r~0#1| (+ (- |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~A~0#1| (+ (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~d~0#1|)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)))) .cse12 (= |ULTIMATE.start_main_~q~0#1| (+ 0 1)) (= (+ |ULTIMATE.start_main_~p~0#1| 0) |ULTIMATE.start_main_~q~0#1|)))) (and .cse10 .cse11 .cse15 .cse16 .cse12) (let ((.cse17 (* 2 1))) (and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~d~0#1| .cse17) .cse15 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|) .cse16 .cse12 (= |ULTIMATE.start_main_~p~0#1| .cse17))))) [2023-02-17 02:06:53,162 INFO L899 garLoopResultBuilder]: For program point L37(lines 34 42) no Hoare annotation was computed. [2023-02-17 02:06:53,162 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 02:06:53,163 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (let ((.cse27 (div |ULTIMATE.start_main_~p~0#1| 2)) (.cse30 (< |ULTIMATE.start_main_~p~0#1| 0)) (.cse21 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (let ((.cse11 (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (.cse28 (< |ULTIMATE.start_main_~d~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse4 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse5 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse15 (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))) (.cse7 (div |ULTIMATE.start_main_~d~0#1| 2)) (.cse18 (and .cse30 (not .cse21))) (.cse22 (not .cse30)) (.cse26 (+ .cse27 1))) (let ((.cse6 (and (or (not (= .cse27 1)) .cse18) (or .cse21 .cse22 (not (= .cse26 1))))) (.cse10 (+ .cse7 1)) (.cse0 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse1 (let ((.cse29 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|))) (or (and .cse3 .cse29 .cse4 .cse5) (and .cse15 .cse29)))) (.cse9 (not .cse28)) (.cse8 (and (not .cse11) .cse28))) (let ((.cse12 (let ((.cse13 (let ((.cse20 (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| .cse27))) (.cse23 (* (+ |ULTIMATE.start_main_~q~0#1| .cse26) |ULTIMATE.start_main_~B~0#1|)) (.cse24 (- .cse7))) (let ((.cse14 (or (let ((.cse25 (+ |ULTIMATE.start_main_~r~0#1| .cse24))) (and (or (= (+ .cse20 .cse25) |ULTIMATE.start_main_~A~0#1|) .cse18) (or (= (+ .cse23 .cse25) |ULTIMATE.start_main_~A~0#1|) .cse21 .cse22))) .cse8)) (.cse16 (or .cse9 (let ((.cse19 (+ |ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse24)))) (and (or .cse18 (= (+ .cse19 .cse20) |ULTIMATE.start_main_~A~0#1|)) (or .cse21 .cse22 (= |ULTIMATE.start_main_~A~0#1| (+ .cse23 .cse19))))) .cse11)) (.cse17 (= |ULTIMATE.start_main_~A~0#1| (+ (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~d~0#1|)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)))))) (or (and .cse14 .cse15 .cse16 .cse1 .cse17) (and .cse15 .cse1 .cse17) (and .cse14 .cse16 .cse1 (= |ULTIMATE.start_main_~r~0#1| (+ (- |ULTIMATE.start_main_~B~0#1|) |ULTIMATE.start_main_~A~0#1|)) .cse17 .cse5 (= |ULTIMATE.start_main_~q~0#1| (+ 0 1)))))))) (or (and (or .cse6 (and (or .cse9 .cse11 (= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| .cse10)) |ULTIMATE.start_main_~A~0#1|)) (or .cse8 (= |ULTIMATE.start_main_~A~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* .cse7 |ULTIMATE.start_main_~q~0#1|)))))) (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) .cse13) (and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~d~0#1| 1) .cse0 (= (+ |ULTIMATE.start_main_~p~0#1| 0) |ULTIMATE.start_main_~q~0#1|) .cse13)))) (.cse2 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (or .cse6 (and (or (= .cse7 |ULTIMATE.start_main_~B~0#1|) .cse8) (or .cse9 (= |ULTIMATE.start_main_~B~0#1| .cse10) .cse11))) .cse12 .cse2) (and .cse0 .cse2 .cse4 .cse5) (and .cse0 .cse12 .cse2 .cse5)))))) [2023-02-17 02:06:53,163 INFO L899 garLoopResultBuilder]: For program point L46(lines 44 56) no Hoare annotation was computed. [2023-02-17 02:06:53,163 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 02:06:53,163 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 42) the Hoare annotation is: (let ((.cse0 (>= |ULTIMATE.start_main_~A~0#1| 0)) (.cse3 (<= |ULTIMATE.start_main_~A~0#1| 1)) (.cse5 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))) (let ((.cse2 (<= |ULTIMATE.start_main_~r~0#1| 1)) (.cse4 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse6 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse7 (or .cse5 (and (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0) (not .cse5)))) (.cse8 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse0 .cse3) (and (or (not .cse0) (not .cse3)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))))) (or (let ((.cse1 (* 2 1))) (and .cse0 (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~d~0#1| .cse1) .cse2 .cse3 (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse4 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|) .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~p~0#1| .cse1))) (and .cse0 (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) .cse2 .cse3 .cse4 (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse5 .cse6 .cse7 .cse8)))) [2023-02-17 02:06:53,163 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2023-02-17 02:06:53,163 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (>= |ULTIMATE.start_main_~A~0#1| 0)) (.cse3 (<= |ULTIMATE.start_main_~A~0#1| 1)) (.cse5 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))) (let ((.cse2 (<= |ULTIMATE.start_main_~r~0#1| 1)) (.cse4 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse6 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse7 (or .cse5 (and (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0) (not .cse5)))) (.cse8 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse0 .cse3) (and (or (not .cse0) (not .cse3)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))))) (or (let ((.cse1 (* 2 1))) (and .cse0 (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~d~0#1| .cse1) .cse2 .cse3 (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse4 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|) .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~p~0#1| .cse1))) (and .cse0 (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) .cse2 .cse3 .cse4 (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse5 .cse6 .cse7 .cse8)))) [2023-02-17 02:06:53,164 INFO L895 garLoopResultBuilder]: At program point L35-1(line 35) the Hoare annotation is: (let ((.cse0 (>= |ULTIMATE.start_main_~A~0#1| 0)) (.cse3 (<= |ULTIMATE.start_main_~A~0#1| 1)) (.cse5 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))) (let ((.cse2 (<= |ULTIMATE.start_main_~r~0#1| 1)) (.cse4 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse6 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse7 (or .cse5 (and (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0) (not .cse5)))) (.cse8 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse0 .cse3) (and (or (not .cse0) (not .cse3)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))))) (or (let ((.cse1 (* 2 1))) (and .cse0 (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= |ULTIMATE.start_main_~d~0#1| .cse1) .cse2 .cse3 (<= 2 |ULTIMATE.start_main_~d~0#1|) .cse4 (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|) .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~p~0#1| .cse1))) (and .cse0 (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) .cse2 .cse3 .cse4 (<= 1 |ULTIMATE.start_main_~d~0#1|) .cse5 .cse6 .cse7 .cse8)))) [2023-02-17 02:06:53,164 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2023-02-17 02:06:53,164 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2023-02-17 02:06:53,164 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2023-02-17 02:06:53,164 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2023-02-17 02:06:53,164 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 20) the Hoare annotation is: true [2023-02-17 02:06:53,164 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2023-02-17 02:06:53,167 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:06:53,168 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 02:06:53,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 02:06:53 BoogieIcfgContainer [2023-02-17 02:06:53,180 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 02:06:53,181 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 02:06:53,181 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 02:06:53,181 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 02:06:53,181 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:06:46" (3/4) ... [2023-02-17 02:06:53,183 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 02:06:53,187 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-17 02:06:53,199 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-02-17 02:06:53,199 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-02-17 02:06:53,199 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-02-17 02:06:53,200 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 02:06:53,200 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 02:06:53,229 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 02:06:53,229 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 02:06:53,230 INFO L158 Benchmark]: Toolchain (without parser) took 7252.16ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 140.2MB in the beginning and 82.7MB in the end (delta: 57.5MB). Peak memory consumption was 97.0MB. Max. memory is 16.1GB. [2023-02-17 02:06:53,230 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 138.4MB. Free memory was 79.1MB in the beginning and 79.0MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 02:06:53,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 157.53ms. Allocated memory is still 186.6MB. Free memory was 139.9MB in the beginning and 129.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 02:06:53,231 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.75ms. Allocated memory is still 186.6MB. Free memory was 129.4MB in the beginning and 127.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 02:06:53,231 INFO L158 Benchmark]: Boogie Preprocessor took 31.03ms. Allocated memory is still 186.6MB. Free memory was 127.6MB in the beginning and 126.7MB in the end (delta: 854.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 02:06:53,231 INFO L158 Benchmark]: RCFGBuilder took 229.96ms. Allocated memory is still 186.6MB. Free memory was 126.7MB in the beginning and 115.6MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 02:06:53,232 INFO L158 Benchmark]: TraceAbstraction took 6754.17ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 115.0MB in the beginning and 85.9MB in the end (delta: 29.2MB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. [2023-02-17 02:06:53,232 INFO L158 Benchmark]: Witness Printer took 48.76ms. Allocated memory is still 224.4MB. Free memory was 85.9MB in the beginning and 82.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 02:06:53,233 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.13ms. Allocated memory is still 138.4MB. Free memory was 79.1MB in the beginning and 79.0MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 157.53ms. Allocated memory is still 186.6MB. Free memory was 139.9MB in the beginning and 129.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.75ms. Allocated memory is still 186.6MB. Free memory was 129.4MB in the beginning and 127.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.03ms. Allocated memory is still 186.6MB. Free memory was 127.6MB in the beginning and 126.7MB in the end (delta: 854.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 229.96ms. Allocated memory is still 186.6MB. Free memory was 126.7MB in the beginning and 115.6MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6754.17ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 115.0MB in the beginning and 85.9MB in the end (delta: 29.2MB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. * Witness Printer took 48.76ms. Allocated memory is still 224.4MB. Free memory was 85.9MB in the beginning and 82.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: 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, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 10, TraceHistogramMax: 14, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 215 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 174 mSDsluCounter, 760 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 495 mSDsCounter, 200 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1566 IncrementalHoareTripleChecker+Invalid, 1766 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 200 mSolverCounterUnsat, 265 mSDtfsCounter, 1566 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 677 GetRequests, 574 SyntacticMatches, 6 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=6, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 50 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 82 PreInvPairs, 108 NumberOfFragments, 6332 HoareAnnotationTreeSize, 82 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 444 NumberOfCodeBlocks, 444 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 669 ConstructedInterpolants, 0 QuantifiedInterpolants, 5024 SizeOfPredicates, 32 NumberOfNonLiveVariables, 1147 ConjunctsInSsa, 151 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 1764/1968 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: 44]: Loop Invariant Derived loop invariant: (((((((((((d + r == A && d == 1) && (((B * (q + p / 2) + (r + -(d / 2)) == A || (p < 0 && !(p % 2 == 0))) && (((q + (p / 2 + 1)) * B + (r + -(d / 2)) == A || p % 2 == 0) || !(p < 0))) || (!(d % 2 == 0) && d < 0))) && ((!(d < 0) || (((p < 0 && !(p % 2 == 0)) || r + (-1 + -(d / 2)) + B * (q + p / 2) == A) && ((p % 2 == 0 || !(p < 0)) || A == (q + (p / 2 + 1)) * B + (r + (-1 + -(d / 2)))))) || d % 2 == 0)) && p == 1) && B == d) && r == -B + A) && A == r + -d + B * (p + q)) && B == 1) && q == 0 + 1) && p + 0 == q) || ((((p == 1 && B == d) && q == 0) && A == r) && B == 1)) || ((((((d == 2 * B && d == 2 * 1) && q == 0) && B * p == d) && A == r) && B == 1) && p == 2 * 1) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((((((((A >= 0 && d == 2 * B) && d == 2 * 1) && r <= 1) && A <= 1) && 2 <= d) && q == 0) && B * p == d) && A == r) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))) && (((cond == 1 && A >= 0) && A <= 1) || ((!(A >= 0) || !(A <= 1)) && cond == 0))) && p == 2 * 1) || (((((((((((A >= 0 && d == 1) && p == 1) && B == d) && r <= 1) && A <= 1) && q == 0) && 1 <= d) && A == r) && B == 1) && (A == r || (-1 * r + A == 0 && !(A == r)))) && (((cond == 1 && A >= 0) && A <= 1) || ((!(A >= 0) || !(A <= 1)) && cond == 0))) RESULT: Ultimate proved your program to be correct! [2023-02-17 02:06:53,265 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