./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound2.i --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/divbin2_valuebound2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b13c7652df725cabbd532da1a8071964fc183988971efb0d5513967afd08dfea --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 01:35:20,223 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 01:35:20,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 01:35:20,265 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 01:35:20,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 01:35:20,268 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 01:35:20,269 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 01:35:20,271 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 01:35:20,273 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 01:35:20,277 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 01:35:20,278 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 01:35:20,280 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 01:35:20,280 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 01:35:20,282 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 01:35:20,284 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 01:35:20,285 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 01:35:20,286 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 01:35:20,287 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 01:35:20,288 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 01:35:20,293 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 01:35:20,294 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 01:35:20,295 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 01:35:20,296 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 01:35:20,297 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 01:35:20,304 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 01:35:20,304 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 01:35:20,304 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 01:35:20,306 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 01:35:20,306 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 01:35:20,307 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 01:35:20,307 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 01:35:20,308 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 01:35:20,310 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 01:35:20,310 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 01:35:20,312 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 01:35:20,312 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 01:35:20,312 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 01:35:20,312 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 01:35:20,313 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 01:35:20,313 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 01:35:20,314 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 01:35:20,315 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 01:35:20,348 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 01:35:20,349 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 01:35:20,349 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 01:35:20,349 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 01:35:20,350 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 01:35:20,350 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 01:35:20,351 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 01:35:20,351 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 01:35:20,351 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 01:35:20,352 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 01:35:20,352 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 01:35:20,353 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 01:35:20,353 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 01:35:20,353 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 01:35:20,353 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 01:35:20,353 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 01:35:20,353 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 01:35:20,354 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 01:35:20,354 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 01:35:20,354 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 01:35:20,354 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 01:35:20,354 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 01:35:20,355 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 01:35:20,355 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 01:35:20,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 01:35:20,355 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 01:35:20,355 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 01:35:20,356 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 01:35:20,356 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 01:35:20,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 01:35:20,356 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 01:35:20,357 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 01:35:20,357 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 01:35:20,357 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 01:35:20,357 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 01:35:20,357 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 -> b13c7652df725cabbd532da1a8071964fc183988971efb0d5513967afd08dfea [2023-02-17 01:35:20,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 01:35:20,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 01:35:20,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 01:35:20,598 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 01:35:20,599 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 01:35:20,599 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound2.i [2023-02-17 01:35:21,750 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 01:35:21,912 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 01:35:21,912 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound2.i [2023-02-17 01:35:21,917 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52aec6970/6127f83285b14953a3812ea5c4518054/FLAGd8efb3309 [2023-02-17 01:35:21,929 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52aec6970/6127f83285b14953a3812ea5c4518054 [2023-02-17 01:35:21,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 01:35:21,932 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 01:35:21,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 01:35:21,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 01:35:21,936 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 01:35:21,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 01:35:21" (1/1) ... [2023-02-17 01:35:21,937 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26d4b9e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:35:21, skipping insertion in model container [2023-02-17 01:35:21,937 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 01:35:21" (1/1) ... [2023-02-17 01:35:21,944 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 01:35:21,959 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 01:35:22,071 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/divbin2_valuebound2.i[951,964] [2023-02-17 01:35:22,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 01:35:22,089 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 01:35:22,098 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/divbin2_valuebound2.i[951,964] [2023-02-17 01:35:22,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 01:35:22,113 INFO L208 MainTranslator]: Completed translation [2023-02-17 01:35:22,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:35:22 WrapperNode [2023-02-17 01:35:22,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 01:35:22,115 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 01:35:22,115 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 01:35:22,115 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 01:35:22,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:35:22" (1/1) ... [2023-02-17 01:35:22,125 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:35:22" (1/1) ... [2023-02-17 01:35:22,136 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 46 [2023-02-17 01:35:22,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 01:35:22,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 01:35:22,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 01:35:22,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 01:35:22,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:35:22" (1/1) ... [2023-02-17 01:35:22,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:35:22" (1/1) ... [2023-02-17 01:35:22,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:35:22" (1/1) ... [2023-02-17 01:35:22,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:35:22" (1/1) ... [2023-02-17 01:35:22,150 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:35:22" (1/1) ... [2023-02-17 01:35:22,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:35:22" (1/1) ... [2023-02-17 01:35:22,154 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:35:22" (1/1) ... [2023-02-17 01:35:22,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:35:22" (1/1) ... [2023-02-17 01:35:22,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 01:35:22,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 01:35:22,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 01:35:22,157 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 01:35:22,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:35:22" (1/1) ... [2023-02-17 01:35:22,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 01:35:22,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:35:22,180 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 01:35:22,192 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 01:35:22,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 01:35:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 01:35:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 01:35:22,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 01:35:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-17 01:35:22,220 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-17 01:35:22,284 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 01:35:22,286 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 01:35:22,474 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 01:35:22,479 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 01:35:22,479 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-17 01:35:22,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 01:35:22 BoogieIcfgContainer [2023-02-17 01:35:22,481 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 01:35:22,482 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 01:35:22,483 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 01:35:22,486 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 01:35:22,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 01:35:21" (1/3) ... [2023-02-17 01:35:22,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa7ba7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 01:35:22, skipping insertion in model container [2023-02-17 01:35:22,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:35:22" (2/3) ... [2023-02-17 01:35:22,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa7ba7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 01:35:22, skipping insertion in model container [2023-02-17 01:35:22,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 01:35:22" (3/3) ... [2023-02-17 01:35:22,488 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin2_valuebound2.i [2023-02-17 01:35:22,509 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 01:35:22,509 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 01:35:22,562 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 01:35:22,568 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;@576087ca, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 01:35:22,569 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 01:35:22,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:35:22,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-17 01:35:22,578 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:35:22,578 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:35:22,579 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:35:22,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:35:22,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1105477780, now seen corresponding path program 1 times [2023-02-17 01:35:22,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:35:22,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536483367] [2023-02-17 01:35:22,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:35:22,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:35:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:35:22,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:35:22,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536483367] [2023-02-17 01:35:22,702 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-17 01:35:22,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842745819] [2023-02-17 01:35:22,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:35:22,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:35:22,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:35:22,706 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 01:35:22,708 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 01:35:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:35:22,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-17 01:35:22,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:35:22,772 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 01:35:22,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 01:35:22,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842745819] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 01:35:22,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 01:35:22,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 01:35:22,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021865867] [2023-02-17 01:35:22,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:35:22,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 01:35:22,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:35:22,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 01:35:22,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 01:35:22,807 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 01:35:22,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:35:22,824 INFO L93 Difference]: Finished difference Result 39 states and 58 transitions. [2023-02-17 01:35:22,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 01:35:22,826 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-17 01:35:22,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:35:22,832 INFO L225 Difference]: With dead ends: 39 [2023-02-17 01:35:22,832 INFO L226 Difference]: Without dead ends: 17 [2023-02-17 01:35:22,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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 01:35:22,838 INFO L413 NwaCegarLoop]: 24 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, 24 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 01:35:22,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 01:35:22,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-02-17 01:35:22,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-02-17 01:35:22,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 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 01:35:22,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2023-02-17 01:35:22,865 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 10 [2023-02-17 01:35:22,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:35:22,865 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2023-02-17 01:35:22,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 01:35:22,866 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2023-02-17 01:35:22,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-17 01:35:22,866 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:35:22,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:35:22,877 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 01:35:23,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-17 01:35:23,073 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:35:23,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:35:23,073 INFO L85 PathProgramCache]: Analyzing trace with hash -2095969935, now seen corresponding path program 1 times [2023-02-17 01:35:23,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:35:23,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111313658] [2023-02-17 01:35:23,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:35:23,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:35:23,089 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:35:23,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1874622634] [2023-02-17 01:35:23,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:35:23,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:35:23,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:35:23,098 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 01:35:23,100 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 01:35:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:35:23,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-17 01:35:23,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:35:23,294 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 01:35:23,295 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 01:35:23,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:35:23,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111313658] [2023-02-17 01:35:23,295 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:35:23,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874622634] [2023-02-17 01:35:23,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874622634] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 01:35:23,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 01:35:23,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-17 01:35:23,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934041763] [2023-02-17 01:35:23,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:35:23,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 01:35:23,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:35:23,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 01:35:23,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-17 01:35:23,299 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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 01:35:23,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:35:23,412 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2023-02-17 01:35:23,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 01:35:23,418 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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 11 [2023-02-17 01:35:23,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:35:23,420 INFO L225 Difference]: With dead ends: 29 [2023-02-17 01:35:23,420 INFO L226 Difference]: Without dead ends: 26 [2023-02-17 01:35:23,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-02-17 01:35:23,424 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 33 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:35:23,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 44 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:35:23,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-17 01:35:23,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-02-17 01:35:23,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:35:23,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2023-02-17 01:35:23,441 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 11 [2023-02-17 01:35:23,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:35:23,441 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-02-17 01:35:23,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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 01:35:23,442 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2023-02-17 01:35:23,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 01:35:23,443 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:35:23,443 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:35:23,449 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 01:35:23,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-02-17 01:35:23,648 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:35:23,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:35:23,649 INFO L85 PathProgramCache]: Analyzing trace with hash 975547596, now seen corresponding path program 1 times [2023-02-17 01:35:23,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:35:23,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020441018] [2023-02-17 01:35:23,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:35:23,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:35:23,661 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:35:23,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [355006953] [2023-02-17 01:35:23,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:35:23,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:35:23,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:35:23,663 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 01:35:23,672 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 01:35:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:35:23,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-17 01:35:23,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:35:23,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 01:35:23,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:35:23,895 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 01:35:23,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:35:23,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020441018] [2023-02-17 01:35:23,895 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:35:23,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355006953] [2023-02-17 01:35:23,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355006953] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-17 01:35:23,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 01:35:23,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2023-02-17 01:35:23,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010678291] [2023-02-17 01:35:23,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:35:23,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 01:35:23,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:35:23,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 01:35:23,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-02-17 01:35:23,899 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (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 01:35:25,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-02-17 01:35:27,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-02-17 01:35:29,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-02-17 01:35:31,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:35:31,183 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2023-02-17 01:35:31,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 01:35:31,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (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 13 [2023-02-17 01:35:31,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:35:31,186 INFO L225 Difference]: With dead ends: 40 [2023-02-17 01:35:31,186 INFO L226 Difference]: Without dead ends: 37 [2023-02-17 01:35:31,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-02-17 01:35:31,187 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2023-02-17 01:35:31,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 52 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 3 Unknown, 0 Unchecked, 7.3s Time] [2023-02-17 01:35:31,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-17 01:35:31,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2023-02-17 01:35:31,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:35:31,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-02-17 01:35:31,202 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 13 [2023-02-17 01:35:31,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:35:31,203 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-02-17 01:35:31,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (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 01:35:31,206 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-02-17 01:35:31,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 01:35:31,207 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:35:31,207 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:35:31,217 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 01:35:31,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:35:31,414 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:35:31,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:35:31,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1791376988, now seen corresponding path program 1 times [2023-02-17 01:35:31,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:35:31,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009922235] [2023-02-17 01:35:31,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:35:31,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:35:31,428 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:35:31,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1068115784] [2023-02-17 01:35:31,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:35:31,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:35:31,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:35:31,437 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 01:35:31,463 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 01:35:31,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:35:31,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 01:35:31,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:35:31,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 01:35:31,501 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 01:35:31,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:35:31,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009922235] [2023-02-17 01:35:31,502 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:35:31,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068115784] [2023-02-17 01:35:31,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068115784] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 01:35:31,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 01:35:31,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 01:35:31,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596361412] [2023-02-17 01:35:31,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:35:31,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 01:35:31,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:35:31,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 01:35:31,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 01:35:31,505 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 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 01:35:31,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:35:31,538 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2023-02-17 01:35:31,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 01:35:31,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 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 19 [2023-02-17 01:35:31,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:35:31,543 INFO L225 Difference]: With dead ends: 40 [2023-02-17 01:35:31,543 INFO L226 Difference]: Without dead ends: 26 [2023-02-17 01:35:31,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 01:35:31,552 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 01:35:31,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 01:35:31,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-17 01:35:31,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-02-17 01:35:31,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:35:31,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-02-17 01:35:31,566 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 19 [2023-02-17 01:35:31,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:35:31,566 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-02-17 01:35:31,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 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 01:35:31,566 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-02-17 01:35:31,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-17 01:35:31,568 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:35:31,568 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:35:31,577 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 01:35:31,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:35:31,774 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:35:31,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:35:31,774 INFO L85 PathProgramCache]: Analyzing trace with hash -800204289, now seen corresponding path program 1 times [2023-02-17 01:35:31,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:35:31,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120100999] [2023-02-17 01:35:31,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:35:31,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:35:31,797 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:35:31,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1717063187] [2023-02-17 01:35:31,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:35:31,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:35:31,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:35:31,800 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 01:35:31,802 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 01:35:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:35:31,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-17 01:35:31,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:35:31,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 01:35:31,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:35:32,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 01:35:32,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:35:32,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120100999] [2023-02-17 01:35:32,439 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:35:32,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717063187] [2023-02-17 01:35:32,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717063187] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:35:32,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:35:32,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2023-02-17 01:35:32,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736902665] [2023-02-17 01:35:32,440 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:35:32,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-17 01:35:32,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:35:32,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-17 01:35:32,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2023-02-17 01:35:32,441 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 15 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:35:34,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:35:36,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:35:38,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:35:43,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:35:45,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:35:49,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:35:51,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:35:52,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:35:58,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:36:01,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:36:03,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:36:05,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:36:06,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:36:09,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:36:10,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:36:10,108 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2023-02-17 01:36:10,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-17 01:36:10,108 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 15 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2023-02-17 01:36:10,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:36:10,109 INFO L225 Difference]: With dead ends: 75 [2023-02-17 01:36:10,109 INFO L226 Difference]: Without dead ends: 69 [2023-02-17 01:36:10,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=197, Invalid=673, Unknown=0, NotChecked=0, Total=870 [2023-02-17 01:36:10,110 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 87 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 46 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:36:10,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 116 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 246 Invalid, 11 Unknown, 0 Unchecked, 34.1s Time] [2023-02-17 01:36:10,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-02-17 01:36:10,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2023-02-17 01:36:10,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 53 states have internal predecessors, (61), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 01:36:10,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2023-02-17 01:36:10,138 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 21 [2023-02-17 01:36:10,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:36:10,138 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2023-02-17 01:36:10,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 15 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:36:10,139 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2023-02-17 01:36:10,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 01:36:10,140 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:36:10,140 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:36:10,155 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 01:36:10,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:36:10,346 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:36:10,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:36:10,347 INFO L85 PathProgramCache]: Analyzing trace with hash 2122375824, now seen corresponding path program 2 times [2023-02-17 01:36:10,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:36:10,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200423564] [2023-02-17 01:36:10,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:36:10,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:36:10,358 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:36:10,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1775369915] [2023-02-17 01:36:10,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 01:36:10,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:36:10,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:36:10,367 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 01:36:10,369 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 01:36:10,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 01:36:10,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 01:36:10,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 01:36:10,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:36:10,471 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 01:36:10,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:36:10,560 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 01:36:10,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:36:10,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200423564] [2023-02-17 01:36:10,561 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:36:10,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775369915] [2023-02-17 01:36:10,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775369915] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:36:10,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:36:10,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-02-17 01:36:10,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742873584] [2023-02-17 01:36:10,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:36:10,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 01:36:10,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:36:10,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 01:36:10,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-02-17 01:36:10,566 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 01:36:11,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:36:11,407 INFO L93 Difference]: Finished difference Result 102 states and 130 transitions. [2023-02-17 01:36:11,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 01:36:11,408 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2023-02-17 01:36:11,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:36:11,409 INFO L225 Difference]: With dead ends: 102 [2023-02-17 01:36:11,409 INFO L226 Difference]: Without dead ends: 70 [2023-02-17 01:36:11,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2023-02-17 01:36:11,410 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 97 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-17 01:36:11,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 95 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-17 01:36:11,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-17 01:36:11,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 53. [2023-02-17 01:36:11,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.225) internal successors, (49), 42 states have internal predecessors, (49), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-17 01:36:11,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2023-02-17 01:36:11,434 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 27 [2023-02-17 01:36:11,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:36:11,434 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2023-02-17 01:36:11,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 01:36:11,435 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2023-02-17 01:36:11,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-17 01:36:11,437 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:36:11,437 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:36:11,449 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 01:36:11,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:36:11,649 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:36:11,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:36:11,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1335567410, now seen corresponding path program 3 times [2023-02-17 01:36:11,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:36:11,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656809164] [2023-02-17 01:36:11,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:36:11,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:36:11,659 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:36:11,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1051064645] [2023-02-17 01:36:11,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 01:36:11,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:36:11,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:36:11,661 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 01:36:11,683 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 01:36:15,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-17 01:36:15,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 01:36:15,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 01:36:15,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:36:15,512 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 01:36:15,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:36:15,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:36:15,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656809164] [2023-02-17 01:36:15,645 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:36:15,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051064645] [2023-02-17 01:36:15,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051064645] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 01:36:15,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 01:36:15,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2023-02-17 01:36:15,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421602978] [2023-02-17 01:36:15,646 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 01:36:15,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 01:36:15,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:36:15,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 01:36:15,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-02-17 01:36:15,647 INFO L87 Difference]: Start difference. First operand 53 states and 66 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:36:15,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:36:15,737 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2023-02-17 01:36:15,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 01:36:15,737 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2023-02-17 01:36:15,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:36:15,738 INFO L225 Difference]: With dead ends: 73 [2023-02-17 01:36:15,738 INFO L226 Difference]: Without dead ends: 36 [2023-02-17 01:36:15,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-02-17 01:36:15,739 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:36:15,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:36:15,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-02-17 01:36:15,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-02-17 01:36:15,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 01:36:15,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2023-02-17 01:36:15,749 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 29 [2023-02-17 01:36:15,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:36:15,749 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2023-02-17 01:36:15,750 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:36:15,750 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2023-02-17 01:36:15,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-17 01:36:15,750 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:36:15,751 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:36:15,765 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 01:36:15,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:36:15,959 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:36:15,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:36:15,960 INFO L85 PathProgramCache]: Analyzing trace with hash 532465357, now seen corresponding path program 4 times [2023-02-17 01:36:15,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:36:15,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859301009] [2023-02-17 01:36:15,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:36:15,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:36:15,970 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:36:15,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [842567789] [2023-02-17 01:36:15,970 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 01:36:15,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:36:15,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:36:15,972 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:36:15,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-17 01:36:16,068 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 01:36:16,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 01:36:16,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-17 01:36:16,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:36:16,243 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 01:36:16,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:36:16,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:36:16,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859301009] [2023-02-17 01:36:16,591 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:36:16,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842567789] [2023-02-17 01:36:16,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842567789] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 01:36:16,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 01:36:16,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2023-02-17 01:36:16,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061641721] [2023-02-17 01:36:16,591 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 01:36:16,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 01:36:16,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:36:16,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 01:36:16,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-02-17 01:36:16,593 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:36:17,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:36:17,055 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2023-02-17 01:36:17,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 01:36:17,056 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2023-02-17 01:36:17,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:36:17,057 INFO L225 Difference]: With dead ends: 55 [2023-02-17 01:36:17,057 INFO L226 Difference]: Without dead ends: 44 [2023-02-17 01:36:17,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2023-02-17 01:36:17,058 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 53 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 01:36:17,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 95 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 01:36:17,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-17 01:36:17,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2023-02-17 01:36:17,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 01:36:17,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2023-02-17 01:36:17,069 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 31 [2023-02-17 01:36:17,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:36:17,069 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2023-02-17 01:36:17,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:36:17,069 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2023-02-17 01:36:17,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-17 01:36:17,070 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:36:17,070 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:36:17,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-17 01:36:17,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-02-17 01:36:17,270 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:36:17,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:36:17,271 INFO L85 PathProgramCache]: Analyzing trace with hash 589723659, now seen corresponding path program 1 times [2023-02-17 01:36:17,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:36:17,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835468273] [2023-02-17 01:36:17,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:36:17,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:36:17,281 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:36:17,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1888375690] [2023-02-17 01:36:17,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:36:17,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:36:17,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:36:17,286 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:36:17,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-17 01:36:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:36:17,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-17 01:36:17,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:36:17,565 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 01:36:17,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:36:27,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:36:27,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835468273] [2023-02-17 01:36:27,415 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:36:27,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888375690] [2023-02-17 01:36:27,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888375690] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 01:36:27,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 01:36:27,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2023-02-17 01:36:27,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526564804] [2023-02-17 01:36:27,416 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 01:36:27,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 01:36:27,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:36:27,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 01:36:27,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2023-02-17 01:36:27,419 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:36:32,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:36:32,566 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2023-02-17 01:36:32,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 01:36:32,566 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2023-02-17 01:36:32,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:36:32,567 INFO L225 Difference]: With dead ends: 54 [2023-02-17 01:36:32,567 INFO L226 Difference]: Without dead ends: 36 [2023-02-17 01:36:32,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=153, Invalid=602, Unknown=1, NotChecked=0, Total=756 [2023-02-17 01:36:32,568 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 49 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-17 01:36:32,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 108 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-17 01:36:32,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-02-17 01:36:32,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-02-17 01:36:32,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 29 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 01:36:32,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2023-02-17 01:36:32,576 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 31 [2023-02-17 01:36:32,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:36:32,577 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2023-02-17 01:36:32,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:36:32,577 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2023-02-17 01:36:32,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-17 01:36:32,578 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:36:32,578 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:36:32,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-17 01:36:32,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:36:32,781 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:36:32,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:36:32,781 INFO L85 PathProgramCache]: Analyzing trace with hash -478651893, now seen corresponding path program 2 times [2023-02-17 01:36:32,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:36:32,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063050534] [2023-02-17 01:36:32,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:36:32,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:36:32,789 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:36:32,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1397539826] [2023-02-17 01:36:32,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 01:36:32,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:36:32,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:36:32,791 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:36:32,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-17 01:36:32,834 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 01:36:32,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 01:36:32,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 01:36:32,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:36:32,855 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 01:36:32,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:36:32,913 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 01:36:32,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:36:32,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063050534] [2023-02-17 01:36:32,914 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:36:32,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397539826] [2023-02-17 01:36:32,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397539826] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-17 01:36:32,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 01:36:32,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2023-02-17 01:36:32,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248858745] [2023-02-17 01:36:32,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:36:32,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 01:36:32,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:36:32,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 01:36:32,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-17 01:36:32,918 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:36:33,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:36:33,122 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2023-02-17 01:36:33,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 01:36:33,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2023-02-17 01:36:33,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:36:33,124 INFO L225 Difference]: With dead ends: 36 [2023-02-17 01:36:33,124 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 01:36:33,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-17 01:36:33,124 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 01:36:33,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 01:36:33,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 01:36:33,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 01:36:33,125 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 01:36:33,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 01:36:33,125 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2023-02-17 01:36:33,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:36:33,125 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 01:36:33,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:36:33,126 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 01:36:33,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 01:36:33,128 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 01:36:33,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-17 01:36:33,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-17 01:36:33,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 01:36:33,343 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 01:36:33,343 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2023-02-17 01:36:33,343 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2023-02-17 01:36:33,344 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 01:36:33,344 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 25 50) the Hoare annotation is: true [2023-02-17 01:36:33,345 INFO L895 garLoopResultBuilder]: At program point L38-1(lines 38 47) the Hoare annotation is: (let ((.cse13 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (let ((.cse29 (mod |ULTIMATE.start_main_~b~0#1| 2147483648)) (.cse2 (<= .cse13 2)) (.cse1 (>= .cse13 0)) (.cse16 (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (.cse30 (mod |ULTIMATE.start_main_~b~0#1| 4294967296))) (let ((.cse15 (forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= .cse13 (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))) (.cse11 (not (>= .cse16 .cse30))) (.cse3 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse1 .cse2) (and (or (not .cse2) (not .cse1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse25 (>= .cse16 (* 2 .cse29))) (.cse26 (* 2 |ULTIMATE.start_main_~q~0#1| (div .cse30 2))) (.cse28 (= (mod |ULTIMATE.start_main_~b~0#1| 2) 0)) (.cse27 (< .cse30 0))) (let ((.cse12 (* 2 1)) (.cse18 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse19 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse8 (= |ULTIMATE.start_main_~b~0#1| 1)) (.cse0 (or (= (mod (+ |ULTIMATE.start_main_~r~0#1| .cse26) 4294967296) .cse13) (and (not .cse28) .cse27))) (.cse5 (or (= (mod (+ |ULTIMATE.start_main_~r~0#1| (* 2 .cse29 |ULTIMATE.start_main_~q~0#1|)) 4294967296) .cse13) .cse25)) (.cse6 (or (= (mod (+ |ULTIMATE.start_main_~r~0#1| .cse26 (* 2 |ULTIMATE.start_main_~q~0#1|)) 4294967296) .cse13) (not .cse27) .cse28)) (.cse4 (or (and .cse1 .cse2 .cse3) (and .cse1 (or .cse15 .cse11) .cse2 .cse3)))) (let ((.cse17 (* 2 0)) (.cse7 (= .cse13 (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))) (.cse9 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse14 (let ((.cse20 (<= .cse16 2)) (.cse22 (>= .cse16 0))) (let ((.cse23 (let ((.cse24 (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse4)))) (or (and .cse1 .cse2 .cse3 .cse24 .cse11) (and .cse1 .cse2 .cse3 .cse24) (and .cse20 .cse8 .cse1 .cse22 .cse2 .cse3 .cse24 .cse11 (not .cse25)))))) (or (let ((.cse21 (mod (+ 2 |ULTIMATE.start_main_~r~0#1|) 4294967296))) (and .cse20 .cse8 .cse1 (>= .cse21 0) .cse22 .cse2 .cse3 (>= .cse21 1) .cse18 (<= .cse21 2) .cse19 .cse23 (>= .cse21 .cse12))) (and .cse20 .cse1 .cse22 .cse2 .cse3 .cse18 .cse19 .cse23))))) (.cse10 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse10 .cse11) (and .cse8 .cse1 (= |ULTIMATE.start_main_~q~0#1| (* 2 (+ 0 1))) (= (+ (- .cse12) |ULTIMATE.start_main_~A~0#1|) |ULTIMATE.start_main_~r~0#1|) (>= .cse13 .cse12) (>= .cse13 1) .cse2 .cse3 .cse14) (and .cse1 .cse15 .cse2 .cse3) (and .cse8 .cse1 .cse2 .cse3 .cse4 (not (>= .cse16 2)) .cse10 (= |ULTIMATE.start_main_~q~0#1| .cse17)) (and .cse8 .cse1 .cse2 .cse3 .cse4 (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) .cse17) (= (+ |ULTIMATE.start_main_~A~0#1| (- |ULTIMATE.start_main_~b~0#1|)) |ULTIMATE.start_main_~r~0#1|) (not (>= .cse13 2))) (and .cse1 .cse2 .cse3 .cse4 .cse7) (and .cse1 .cse2 .cse3 .cse9 .cse18 .cse14 .cse10 .cse19))))))) [2023-02-17 01:36:33,345 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 37) the Hoare annotation is: (let ((.cse25 (mod |ULTIMATE.start_main_~b~0#1| 4294967296)) (.cse16 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (let ((.cse5 (<= .cse16 2)) (.cse2 (>= .cse16 0)) (.cse19 (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (.cse21 (= (mod |ULTIMATE.start_main_~b~0#1| 2) 0)) (.cse28 (< .cse25 0))) (let ((.cse17 (and (not .cse21) .cse28)) (.cse24 (* (- 1) .cse19)) (.cse20 (not .cse28)) (.cse22 (div .cse25 2)) (.cse1 (= |ULTIMATE.start_main_~b~0#1| 1)) (.cse6 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse2 .cse5) (and (or (not .cse5) (not .cse2)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse7 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse8 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))) (let ((.cse0 (<= .cse19 2)) (.cse3 (let ((.cse27 (forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= .cse16 (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))))) (or (and .cse2 .cse27 .cse5 .cse6) (and .cse1 .cse2 .cse27 .cse5 .cse6 .cse7 .cse8)))) (.cse4 (>= .cse19 0)) (.cse12 (* 2 |ULTIMATE.start_main_~B~0#1|)) (.cse13 (* 2 1)) (.cse9 (let ((.cse26 (+ (* (div (+ .cse22 (- 4294967295)) 4294967296) 4294967296) 4294967296))) (or (< (+ .cse22 .cse24) .cse26) (< (+ .cse22 1) .cse26) .cse20 .cse21))) (.cse14 (>= .cse19 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (.cse10 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse11 (let ((.cse23 (* (div .cse25 8589934592) 4294967296))) (or (< .cse22 .cse23) (< (+ (- 1) .cse22 .cse24) .cse23) .cse17)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|) .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse3 (= |ULTIMATE.start_main_~b~0#1| .cse12) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_main_~b~0#1| .cse13) .cse14 .cse10 .cse11) (let ((.cse15 (* 2 |ULTIMATE.start_main_~q~0#1| .cse22))) (and .cse0 (or (= (mod (+ |ULTIMATE.start_main_~r~0#1| .cse15) 4294967296) .cse16) .cse17) .cse2 .cse3 .cse4 (= (* 2 .cse12) |ULTIMATE.start_main_~b~0#1|) .cse5 .cse6 (let ((.cse18 (mod |ULTIMATE.start_main_~b~0#1| 2147483648))) (or (= (mod (+ |ULTIMATE.start_main_~r~0#1| (* 2 .cse18 |ULTIMATE.start_main_~q~0#1|)) 4294967296) .cse16) (>= .cse19 (* 2 .cse18)))) .cse7 (= |ULTIMATE.start_main_~b~0#1| (* 2 .cse13)) .cse8 (or (= (mod (+ |ULTIMATE.start_main_~r~0#1| .cse15 (* 2 |ULTIMATE.start_main_~q~0#1|)) 4294967296) .cse16) .cse20 .cse21) .cse9 .cse14 .cse10 (= .cse16 (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)) .cse11))))))) [2023-02-17 01:36:33,345 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 01:36:33,346 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 01:36:33,346 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2023-02-17 01:36:33,346 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 46) no Hoare annotation was computed. [2023-02-17 01:36:33,347 INFO L895 garLoopResultBuilder]: At program point L43-2(lines 38 47) the Hoare annotation is: (let ((.cse12 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (let ((.cse29 (mod |ULTIMATE.start_main_~b~0#1| 2147483648)) (.cse2 (<= .cse12 2)) (.cse0 (>= .cse12 0)) (.cse38 (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (.cse13 (mod |ULTIMATE.start_main_~b~0#1| 4294967296))) (let ((.cse39 (forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= .cse12 (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))) (.cse7 (not (>= .cse38 .cse13))) (.cse3 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse0 .cse2) (and (or (not .cse2) (not .cse0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse30 (>= .cse38 (* 2 .cse29)))) (let ((.cse20 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse21 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse5 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (.cse18 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse15 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse9 (<= .cse38 2)) (.cse17 (= |ULTIMATE.start_main_~b~0#1| 1)) (.cse10 (>= .cse38 0)) (.cse19 (not .cse30)) (.cse6 (or (and .cse0 .cse2 .cse3) (and .cse0 (or .cse39 .cse7) .cse2 .cse3))) (.cse25 (* 2 1)) (.cse28 (* 2 |ULTIMATE.start_main_~B~0#1|))) (let ((.cse14 (= (+ |ULTIMATE.start_main_~A~0#1| (- |ULTIMATE.start_main_~b~0#1|)) |ULTIMATE.start_main_~r~0#1|)) (.cse1 (= |ULTIMATE.start_main_~b~0#1| .cse28)) (.cse11 (= |ULTIMATE.start_main_~b~0#1| .cse25)) (.cse16 (+ 0 1)) (.cse22 (let ((.cse41 (or (and .cse0 .cse2 .cse3 .cse6 .cse7) (and .cse9 .cse17 .cse0 .cse10 .cse2 .cse3 .cse6 .cse7 .cse19) (and .cse0 .cse2 .cse3 .cse6)))) (or (let ((.cse40 (mod (+ 2 |ULTIMATE.start_main_~r~0#1|) 4294967296))) (and .cse9 .cse17 .cse0 (>= .cse40 0) .cse10 .cse41 .cse2 .cse3 (>= .cse40 1) .cse18 (<= .cse40 2) .cse15 (>= .cse40 .cse25))) (and .cse9 .cse0 .cse10 .cse41 .cse2 .cse3 .cse18 .cse15)))) (.cse24 (>= .cse38 .cse5)) (.cse8 (= .cse12 (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))) (.cse23 (or (and .cse0 .cse39 .cse2 .cse3) (and .cse17 .cse0 .cse39 .cse2 .cse3 .cse20 .cse21 .cse7)))) (or (let ((.cse4 (mod (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~r~0#1|) 4294967296))) (and .cse0 .cse1 .cse2 .cse3 (>= .cse4 .cse5) (or (and .cse0 .cse2 .cse3 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse6 .cse11 .cse7 .cse8) (and .cse0 .cse2 .cse3 .cse6 .cse8)) (>= .cse12 .cse13) (>= .cse12 .cse5) (<= .cse4 2) (>= .cse4 .cse13) .cse14 .cse15 (= |ULTIMATE.start_main_~q~0#1| .cse16) (>= .cse4 0))) (and .cse9 .cse17 .cse0 .cse10 .cse2 .cse3 .cse6 .cse18 (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) (* 2 0)) .cse7 .cse14 (not (>= .cse12 2)) .cse15 .cse19) (and .cse0 .cse2 .cse3 .cse20 .cse18 .cse21 .cse22 .cse15) (and .cse9 .cse0 .cse1 .cse10 .cse2 .cse3 .cse20 .cse23 .cse21 .cse11 .cse7 .cse24 .cse15) (and .cse17 .cse0 (= |ULTIMATE.start_main_~q~0#1| (* 2 .cse16)) (= (+ (- .cse25) |ULTIMATE.start_main_~A~0#1|) |ULTIMATE.start_main_~r~0#1|) (>= .cse12 .cse25) (>= .cse12 1) .cse2 .cse3 .cse22) (let ((.cse32 (= (mod |ULTIMATE.start_main_~b~0#1| 2) 0)) (.cse37 (< .cse13 0)) (.cse33 (div .cse13 2))) (let ((.cse26 (* 2 |ULTIMATE.start_main_~q~0#1| .cse33)) (.cse31 (not .cse37)) (.cse34 (* (- 1) .cse38)) (.cse27 (and (not .cse32) .cse37))) (and .cse9 (or (= (mod (+ |ULTIMATE.start_main_~r~0#1| .cse26) 4294967296) .cse12) .cse27) .cse0 .cse10 (= (* 2 .cse28) |ULTIMATE.start_main_~b~0#1|) .cse2 .cse3 (or (= (mod (+ |ULTIMATE.start_main_~r~0#1| (* 2 .cse29 |ULTIMATE.start_main_~q~0#1|)) 4294967296) .cse12) .cse30) .cse20 .cse23 (= |ULTIMATE.start_main_~b~0#1| (* 2 .cse25)) .cse21 (or (= (mod (+ |ULTIMATE.start_main_~r~0#1| .cse26 (* 2 |ULTIMATE.start_main_~q~0#1|)) 4294967296) .cse12) .cse31 .cse32) (let ((.cse35 (+ (* (div (+ .cse33 (- 4294967295)) 4294967296) 4294967296) 4294967296))) (or (< (+ .cse33 .cse34) .cse35) (< (+ .cse33 1) .cse35) .cse31 .cse32)) .cse24 .cse15 .cse8 (let ((.cse36 (* (div .cse13 8589934592) 4294967296))) (or (< .cse33 .cse36) (< (+ (- 1) .cse33 .cse34) .cse36) .cse27))))) (and .cse23 .cse18 .cse15))))))) [2023-02-17 01:36:33,348 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse12 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (let ((.cse29 (mod |ULTIMATE.start_main_~b~0#1| 2147483648)) (.cse2 (<= .cse12 2)) (.cse0 (>= .cse12 0)) (.cse38 (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (.cse13 (mod |ULTIMATE.start_main_~b~0#1| 4294967296))) (let ((.cse39 (forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= .cse12 (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))) (.cse7 (not (>= .cse38 .cse13))) (.cse3 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse0 .cse2) (and (or (not .cse2) (not .cse0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse30 (>= .cse38 (* 2 .cse29)))) (let ((.cse20 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse21 (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse5 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (.cse18 (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse15 (= |ULTIMATE.start_main_~B~0#1| 1)) (.cse9 (<= .cse38 2)) (.cse17 (= |ULTIMATE.start_main_~b~0#1| 1)) (.cse10 (>= .cse38 0)) (.cse19 (not .cse30)) (.cse6 (or (and .cse0 .cse2 .cse3) (and .cse0 (or .cse39 .cse7) .cse2 .cse3))) (.cse25 (* 2 1)) (.cse28 (* 2 |ULTIMATE.start_main_~B~0#1|))) (let ((.cse14 (= (+ |ULTIMATE.start_main_~A~0#1| (- |ULTIMATE.start_main_~b~0#1|)) |ULTIMATE.start_main_~r~0#1|)) (.cse1 (= |ULTIMATE.start_main_~b~0#1| .cse28)) (.cse11 (= |ULTIMATE.start_main_~b~0#1| .cse25)) (.cse16 (+ 0 1)) (.cse22 (let ((.cse41 (or (and .cse0 .cse2 .cse3 .cse6 .cse7) (and .cse9 .cse17 .cse0 .cse10 .cse2 .cse3 .cse6 .cse7 .cse19) (and .cse0 .cse2 .cse3 .cse6)))) (or (let ((.cse40 (mod (+ 2 |ULTIMATE.start_main_~r~0#1|) 4294967296))) (and .cse9 .cse17 .cse0 (>= .cse40 0) .cse10 .cse41 .cse2 .cse3 (>= .cse40 1) .cse18 (<= .cse40 2) .cse15 (>= .cse40 .cse25))) (and .cse9 .cse0 .cse10 .cse41 .cse2 .cse3 .cse18 .cse15)))) (.cse24 (>= .cse38 .cse5)) (.cse8 (= .cse12 (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))) (.cse23 (or (and .cse0 .cse39 .cse2 .cse3) (and .cse17 .cse0 .cse39 .cse2 .cse3 .cse20 .cse21 .cse7)))) (or (let ((.cse4 (mod (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~r~0#1|) 4294967296))) (and .cse0 .cse1 .cse2 .cse3 (>= .cse4 .cse5) (or (and .cse0 .cse2 .cse3 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse6 .cse11 .cse7 .cse8) (and .cse0 .cse2 .cse3 .cse6 .cse8)) (>= .cse12 .cse13) (>= .cse12 .cse5) (<= .cse4 2) (>= .cse4 .cse13) .cse14 .cse15 (= |ULTIMATE.start_main_~q~0#1| .cse16) (>= .cse4 0))) (and .cse9 .cse17 .cse0 .cse10 .cse2 .cse3 .cse6 .cse18 (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) (* 2 0)) .cse7 .cse14 (not (>= .cse12 2)) .cse15 .cse19) (and .cse0 .cse2 .cse3 .cse20 .cse18 .cse21 .cse22 .cse15) (and .cse9 .cse0 .cse1 .cse10 .cse2 .cse3 .cse20 .cse23 .cse21 .cse11 .cse7 .cse24 .cse15) (and .cse17 .cse0 (= |ULTIMATE.start_main_~q~0#1| (* 2 .cse16)) (= (+ (- .cse25) |ULTIMATE.start_main_~A~0#1|) |ULTIMATE.start_main_~r~0#1|) (>= .cse12 .cse25) (>= .cse12 1) .cse2 .cse3 .cse22) (let ((.cse32 (= (mod |ULTIMATE.start_main_~b~0#1| 2) 0)) (.cse37 (< .cse13 0)) (.cse33 (div .cse13 2))) (let ((.cse26 (* 2 |ULTIMATE.start_main_~q~0#1| .cse33)) (.cse31 (not .cse37)) (.cse34 (* (- 1) .cse38)) (.cse27 (and (not .cse32) .cse37))) (and .cse9 (or (= (mod (+ |ULTIMATE.start_main_~r~0#1| .cse26) 4294967296) .cse12) .cse27) .cse0 .cse10 (= (* 2 .cse28) |ULTIMATE.start_main_~b~0#1|) .cse2 .cse3 (or (= (mod (+ |ULTIMATE.start_main_~r~0#1| (* 2 .cse29 |ULTIMATE.start_main_~q~0#1|)) 4294967296) .cse12) .cse30) .cse20 .cse23 (= |ULTIMATE.start_main_~b~0#1| (* 2 .cse25)) .cse21 (or (= (mod (+ |ULTIMATE.start_main_~r~0#1| .cse26 (* 2 |ULTIMATE.start_main_~q~0#1|)) 4294967296) .cse12) .cse31 .cse32) (let ((.cse35 (+ (* (div (+ .cse33 (- 4294967295)) 4294967296) 4294967296) 4294967296))) (or (< (+ .cse33 .cse34) .cse35) (< (+ .cse33 1) .cse35) .cse31 .cse32)) .cse24 .cse15 .cse8 (let ((.cse36 (* (div .cse13 8589934592) 4294967296))) (or (< .cse33 .cse36) (< (+ (- 1) .cse33 .cse34) .cse36) .cse27))))) (and .cse23 .cse18 .cse15))))))) [2023-02-17 01:36:33,348 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 38 47) no Hoare annotation was computed. [2023-02-17 01:36:33,348 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2023-02-17 01:36:33,348 INFO L899 garLoopResultBuilder]: For program point L19-2(lines 18 24) no Hoare annotation was computed. [2023-02-17 01:36:33,348 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 18 24) no Hoare annotation was computed. [2023-02-17 01:36:33,349 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 18 24) the Hoare annotation is: (let ((.cse1 (= |__VERIFIER_assert_#in~cond| 0))) (let ((.cse0 (not .cse1)) (.cse2 (= |__VERIFIER_assert_#in~cond| 1))) (or .cse0 (and .cse1 (or (not .cse2) .cse1)) (and .cse0 .cse2)))) [2023-02-17 01:36:33,349 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 21) no Hoare annotation was computed. [2023-02-17 01:36:33,349 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 22) no Hoare annotation was computed. [2023-02-17 01:36:33,349 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) no Hoare annotation was computed. [2023-02-17 01:36:33,352 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1] [2023-02-17 01:36:33,353 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 01:36:33,361 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,362 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,367 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,368 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,368 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,368 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,369 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,372 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,373 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,373 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,373 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,373 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,373 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,374 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,374 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,374 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,374 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,374 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,375 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,375 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,375 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,375 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,398 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,399 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,399 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,399 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,399 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,399 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,400 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,400 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,400 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,400 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,404 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,404 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,404 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,404 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,404 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,409 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,409 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,409 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,410 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,410 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,410 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,410 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,415 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,416 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,417 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,417 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,417 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,417 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,418 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,425 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,425 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,426 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,426 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,427 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 01:36:33 BoogieIcfgContainer [2023-02-17 01:36:33,429 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 01:36:33,430 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 01:36:33,430 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 01:36:33,430 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 01:36:33,431 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 01:35:22" (3/4) ... [2023-02-17 01:36:33,433 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 01:36:33,438 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-17 01:36:33,446 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2023-02-17 01:36:33,447 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-02-17 01:36:33,447 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-17 01:36:33,447 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 01:36:33,487 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 01:36:33,487 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 01:36:33,488 INFO L158 Benchmark]: Toolchain (without parser) took 71555.79ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 58.9MB in the beginning and 99.1MB in the end (delta: -40.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 01:36:33,488 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 107.0MB. Free memory was 77.0MB in the beginning and 76.9MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 01:36:33,489 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.45ms. Allocated memory is still 107.0MB. Free memory was 58.9MB in the beginning and 48.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 01:36:33,489 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.38ms. Allocated memory is still 107.0MB. Free memory was 48.4MB in the beginning and 47.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 01:36:33,489 INFO L158 Benchmark]: Boogie Preprocessor took 19.20ms. Allocated memory is still 107.0MB. Free memory was 47.0MB in the beginning and 45.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 01:36:33,490 INFO L158 Benchmark]: RCFGBuilder took 324.04ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 45.9MB in the beginning and 101.0MB in the end (delta: -55.1MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2023-02-17 01:36:33,490 INFO L158 Benchmark]: TraceAbstraction took 70946.25ms. Allocated memory is still 130.0MB. Free memory was 100.3MB in the beginning and 102.2MB in the end (delta: -1.9MB). Peak memory consumption was 74.5MB. Max. memory is 16.1GB. [2023-02-17 01:36:33,491 INFO L158 Benchmark]: Witness Printer took 57.22ms. Allocated memory is still 130.0MB. Free memory was 102.2MB in the beginning and 99.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 01:36:33,492 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 107.0MB. Free memory was 77.0MB in the beginning and 76.9MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.45ms. Allocated memory is still 107.0MB. Free memory was 58.9MB in the beginning and 48.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.38ms. Allocated memory is still 107.0MB. Free memory was 48.4MB in the beginning and 47.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.20ms. Allocated memory is still 107.0MB. Free memory was 47.0MB in the beginning and 45.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 324.04ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 45.9MB in the beginning and 101.0MB in the end (delta: -55.1MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * TraceAbstraction took 70946.25ms. Allocated memory is still 130.0MB. Free memory was 100.3MB in the beginning and 102.2MB in the end (delta: -1.9MB). Peak memory consumption was 74.5MB. Max. memory is 16.1GB. * Witness Printer took 57.22ms. Allocated memory is still 130.0MB. Free memory was 102.2MB in the beginning and 99.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] * 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: 21]: 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, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 70.8s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 52.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 14 mSolverCounterUnknown, 331 SdHoareTripleChecker+Valid, 43.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 329 mSDsluCounter, 636 SdHoareTripleChecker+Invalid, 43.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 446 mSDsCounter, 150 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 930 IncrementalHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 150 mSolverCounterUnsat, 190 mSDtfsCounter, 930 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 390 GetRequests, 257 SyntacticMatches, 7 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 19.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=5, InterpolantAutomatonStates: 81, 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, 38 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 40 PreInvPairs, 66 NumberOfFragments, 15637 HoareAnnotationTreeSize, 40 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 4.1s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 233 NumberOfCodeBlocks, 233 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 301 ConstructedInterpolants, 6 QuantifiedInterpolants, 3501 SizeOfPredicates, 36 NumberOfNonLiveVariables, 723 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 101/174 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: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 38]: Loop Invariant [2023-02-17 01:36:33,516 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,516 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,517 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,517 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,517 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,517 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,517 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,518 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,518 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,518 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,518 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,518 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,518 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,519 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,519 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,519 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,519 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,520 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,520 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,520 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,520 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,521 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,527 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,527 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,527 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,528 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,528 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,528 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,528 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,528 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,529 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,529 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,529 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,529 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,529 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,530 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,530 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,530 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,530 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,530 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,530 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,531 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,531 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,531 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] Derived loop invariant: ((((((((((((((((((A % 4294967296 >= 0 && b == 2 * B) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && (b + r) % 4294967296 >= B % 4294967296) && (((((((A % 4294967296 >= 0 && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && (((A % 4294967296 >= 0 && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) || (((A % 4294967296 >= 0 && ((forall ULTIMATE.start_main_~b~0#1 : int :: A % 4294967296 == (r + ULTIMATE.start_main_~b~0#1 * q) % 4294967296) || !(r % 4294967296 >= b % 4294967296))) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))))) && !(r % 4294967296 >= b % 4294967296)) && A % 4294967296 == (r + b * q) % 4294967296) || ((((((((r % 4294967296 <= 2 && A % 4294967296 >= 0) && r % 4294967296 >= 0) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && (((A % 4294967296 >= 0 && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) || (((A % 4294967296 >= 0 && ((forall ULTIMATE.start_main_~b~0#1 : int :: A % 4294967296 == (r + ULTIMATE.start_main_~b~0#1 * q) % 4294967296) || !(r % 4294967296 >= b % 4294967296))) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))))) && b == 2 * 1) && !(r % 4294967296 >= b % 4294967296)) && A % 4294967296 == (r + b * q) % 4294967296)) || ((((A % 4294967296 >= 0 && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && (((A % 4294967296 >= 0 && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) || (((A % 4294967296 >= 0 && ((forall ULTIMATE.start_main_~b~0#1 : int :: A % 4294967296 == (r + ULTIMATE.start_main_~b~0#1 * q) % 4294967296) || !(r % 4294967296 >= b % 4294967296))) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))))) && A % 4294967296 == (r + b * q) % 4294967296))) && A % 4294967296 >= b % 4294967296) && A % 4294967296 >= B % 4294967296) && (b + r) % 4294967296 <= 2) && (b + r) % 4294967296 >= b % 4294967296) && A + -b == r) && B == 1) && q == 0 + 1) && (b + r) % 4294967296 >= 0) || (((((((((((((r % 4294967296 <= 2 && b == 1) && A % 4294967296 >= 0) && r % 4294967296 >= 0) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && (((A % 4294967296 >= 0 && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) || (((A % 4294967296 >= 0 && ((forall ULTIMATE.start_main_~b~0#1 : int :: A % 4294967296 == (r + ULTIMATE.start_main_~b~0#1 * q) % 4294967296) || !(r % 4294967296 >= b % 4294967296))) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))))) && B == b) && -1 + q == 2 * 0) && !(r % 4294967296 >= b % 4294967296)) && A + -b == r) && !(A % 4294967296 >= 2)) && B == 1) && !(r % 4294967296 >= 2 * (b % 2147483648)))) || (((((((A % 4294967296 >= 0 && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && q == 0) && B == b) && A == r) && (((((((((((((r % 4294967296 <= 2 && b == 1) && A % 4294967296 >= 0) && (2 + r) % 4294967296 >= 0) && r % 4294967296 >= 0) && ((((((A % 4294967296 >= 0 && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && (((A % 4294967296 >= 0 && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) || (((A % 4294967296 >= 0 && ((forall ULTIMATE.start_main_~b~0#1 : int :: A % 4294967296 == (r + ULTIMATE.start_main_~b~0#1 * q) % 4294967296) || !(r % 4294967296 >= b % 4294967296))) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))))) && !(r % 4294967296 >= b % 4294967296)) || ((((((((r % 4294967296 <= 2 && b == 1) && A % 4294967296 >= 0) && r % 4294967296 >= 0) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && (((A % 4294967296 >= 0 && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) || (((A % 4294967296 >= 0 && ((forall ULTIMATE.start_main_~b~0#1 : int :: A % 4294967296 == (r + ULTIMATE.start_main_~b~0#1 * q) % 4294967296) || !(r % 4294967296 >= b % 4294967296))) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))))) && !(r % 4294967296 >= b % 4294967296)) && !(r % 4294967296 >= 2 * (b % 2147483648)))) || (((A % 4294967296 >= 0 && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && (((A % 4294967296 >= 0 && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) || (((A % 4294967296 >= 0 && ((forall ULTIMATE.start_main_~b~0#1 : int :: A % 4294967296 == (r + ULTIMATE.start_main_~b~0#1 * q) % 4294967296) || !(r % 4294967296 >= b % 4294967296))) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))))))) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && (2 + r) % 4294967296 >= 1) && B == b) && (2 + r) % 4294967296 <= 2) && B == 1) && (2 + r) % 4294967296 >= 2 * 1) || (((((((r % 4294967296 <= 2 && A % 4294967296 >= 0) && r % 4294967296 >= 0) && ((((((A % 4294967296 >= 0 && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && (((A % 4294967296 >= 0 && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) || (((A % 4294967296 >= 0 && ((forall ULTIMATE.start_main_~b~0#1 : int :: A % 4294967296 == (r + ULTIMATE.start_main_~b~0#1 * q) % 4294967296) || !(r % 4294967296 >= b % 4294967296))) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))))) && !(r % 4294967296 >= b % 4294967296)) || ((((((((r % 4294967296 <= 2 && b == 1) && A % 4294967296 >= 0) && r % 4294967296 >= 0) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && (((A % 4294967296 >= 0 && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) || (((A % 4294967296 >= 0 && ((forall ULTIMATE.start_main_~b~0#1 : int :: A % 4294967296 == (r + ULTIMATE.start_main_~b~0#1 * q) % 4294967296) || !(r % 4294967296 >= b % 4294967296))) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))))) && !(r % 4294967296 >= b % 4294967296)) && !(r % 4294967296 >= 2 * (b % 2147483648)))) || (((A % 4294967296 >= 0 && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && (((A % 4294967296 >= 0 && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) || (((A % 4294967296 >= 0 && ((forall ULTIMATE.start_main_~b~0#1 : int :: A % 4294967296 == (r + ULTIMATE.start_main_~b~0#1 * q) % 4294967296) || !(r % 4294967296 >= b % 4294967296))) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))))))) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && B == b) && B == 1))) && B == 1)) || ((((((((((((r % 4294967296 <= 2 && A % 4294967296 >= 0) && b == 2 * B) && r % 4294967296 >= 0) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && q == 0) && ((((A % 4294967296 >= 0 && (forall ULTIMATE.start_main_~b~0#1 : int :: A % 4294967296 == (r + ULTIMATE.start_main_~b~0#1 * q) % 4294967296)) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) || (((((((b == 1 && A % 4294967296 >= 0) && (forall ULTIMATE.start_main_~b~0#1 : int :: A % 4294967296 == (r + ULTIMATE.start_main_~b~0#1 * q) % 4294967296)) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && q == 0) && A == r) && !(r % 4294967296 >= b % 4294967296)))) && A == r) && b == 2 * 1) && !(r % 4294967296 >= b % 4294967296)) && r % 4294967296 >= B % 4294967296) && B == 1)) || ((((((((b == 1 && A % 4294967296 >= 0) && q == 2 * (0 + 1)) && -(2 * 1) + A == r) && A % 4294967296 >= 2 * 1) && A % 4294967296 >= 1) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && (((((((((((((r % 4294967296 <= 2 && b == 1) && A % 4294967296 >= 0) && (2 + r) % 4294967296 >= 0) && r % 4294967296 >= 0) && ((((((A % 4294967296 >= 0 && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && (((A % 4294967296 >= 0 && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) || (((A % 4294967296 >= 0 && ((forall ULTIMATE.start_main_~b~0#1 : int :: A % 4294967296 == (r + ULTIMATE.start_main_~b~0#1 * q) % 4294967296) || !(r % 4294967296 >= b % 4294967296))) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))))) && !(r % 4294967296 >= b % 4294967296)) || ((((((((r % 4294967296 <= 2 && b == 1) && A % 4294967296 >= 0) && r % 4294967296 >= 0) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && (((A % 4294967296 >= 0 && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) || (((A % 4294967296 >= 0 && ((forall ULTIMATE.start_main_~b~0#1 : int :: A % 4294967296 == (r + ULTIMATE.start_main_~b~0#1 * q) % 4294967296) || !(r % 4294967296 >= b % 4294967296))) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))))) && !(r % 4294967296 >= b % 4294967296)) && !(r % 4294967296 >= 2 * (b % 2147483648)))) || (((A % 4294967296 >= 0 && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && (((A % 4294967296 >= 0 && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) || (((A % 4294967296 >= 0 && ((forall ULTIMATE.start_main_~b~0#1 : int :: A % 4294967296 == (r + ULTIMATE.start_main_~b~0#1 * q) % 4294967296) || !(r % 4294967296 >= b % 4294967296))) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))))))) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && (2 + r) % 4294967296 >= 1) && B == b) && (2 + r) % 4294967296 <= 2) && B == 1) && (2 + r) % 4294967296 >= 2 * 1) || (((((((r % 4294967296 <= 2 && A % 4294967296 >= 0) && r % 4294967296 >= 0) && ((((((A % 4294967296 >= 0 && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && (((A % 4294967296 >= 0 && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) || (((A % 4294967296 >= 0 && ((forall ULTIMATE.start_main_~b~0#1 : int :: A % 4294967296 == (r + ULTIMATE.start_main_~b~0#1 * q) % 4294967296) || !(r % 4294967296 >= b % 4294967296))) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))))) && !(r % 4294967296 >= b % 4294967296)) || ((((((((r % 4294967296 <= 2 && b == 1) && A % 4294967296 >= 0) && r % 4294967296 >= 0) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && (((A % 4294967296 >= 0 && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) || (((A % 4294967296 >= 0 && ((forall ULTIMATE.start_main_~b~0#1 : int :: A % 4294967296 == (r + ULTIMATE.start_main_~b~0#1 * q) % 4294967296) || !(r % 4294967296 >= b % 4294967296))) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))))) && !(r % 4294967296 >= b % 4294967296)) && !(r % 4294967296 >= 2 * (b % 2147483648)))) || (((A % 4294967296 >= 0 && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && (((A % 4294967296 >= 0 && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) || (((A % 4294967296 >= 0 && ((forall ULTIMATE.start_main_~b~0#1 : int :: A % 4294967296 == (r + ULTIMATE.start_main_~b~0#1 * q) % 4294967296) || !(r % 4294967296 >= b % 4294967296))) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))))))) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && B == b) && B == 1)))) || (((((((((((((((((r % 4294967296 <= 2 && ((r + 2 * q * (b % 4294967296 / 2)) % 4294967296 == A % 4294967296 || (!(b % 2 == 0) && b % 4294967296 < 0))) && A % 4294967296 >= 0) && r % 4294967296 >= 0) && 2 * (2 * B) == b) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && ((r + 2 * (b % 2147483648) * q) % 4294967296 == A % 4294967296 || r % 4294967296 >= 2 * (b % 2147483648))) && q == 0) && ((((A % 4294967296 >= 0 && (forall ULTIMATE.start_main_~b~0#1 : int :: A % 4294967296 == (r + ULTIMATE.start_main_~b~0#1 * q) % 4294967296)) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) || (((((((b == 1 && A % 4294967296 >= 0) && (forall ULTIMATE.start_main_~b~0#1 : int :: A % 4294967296 == (r + ULTIMATE.start_main_~b~0#1 * q) % 4294967296)) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && q == 0) && A == r) && !(r % 4294967296 >= b % 4294967296)))) && b == 2 * (2 * 1)) && A == r) && (((r + 2 * q * (b % 4294967296 / 2) + 2 * q) % 4294967296 == A % 4294967296 || !(b % 4294967296 < 0)) || b % 2 == 0)) && (((b % 4294967296 / 2 + -1 * (r % 4294967296) < (b % 4294967296 / 2 + -4294967295) / 4294967296 * 4294967296 + 4294967296 || b % 4294967296 / 2 + 1 < (b % 4294967296 / 2 + -4294967295) / 4294967296 * 4294967296 + 4294967296) || !(b % 4294967296 < 0)) || b % 2 == 0)) && r % 4294967296 >= B % 4294967296) && B == 1) && A % 4294967296 == (r + b * q) % 4294967296) && ((b % 4294967296 / 2 < b % 4294967296 / 8589934592 * 4294967296 || -1 + b % 4294967296 / 2 + -1 * (r % 4294967296) < b % 4294967296 / 8589934592 * 4294967296) || (!(b % 2 == 0) && b % 4294967296 < 0)))) || ((((((A % 4294967296 >= 0 && (forall ULTIMATE.start_main_~b~0#1 : int :: A % 4294967296 == (r + ULTIMATE.start_main_~b~0#1 * q) % 4294967296)) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) || (((((((b == 1 && A % 4294967296 >= 0) && (forall ULTIMATE.start_main_~b~0#1 : int :: A % 4294967296 == (r + ULTIMATE.start_main_~b~0#1 * q) % 4294967296)) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && q == 0) && A == r) && !(r % 4294967296 >= b % 4294967296))) && B == b) && B == 1) - InvariantResult [Line: 34]: Loop Invariant [2023-02-17 01:36:33,535 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,536 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,536 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,536 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,536 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,536 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,538 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,538 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,538 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,538 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,538 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-17 01:36:33,538 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] Derived loop invariant: (((((((((((((r % 4294967296 <= 2 && b == 1) && A % 4294967296 >= 0) && ((((A % 4294967296 >= 0 && (forall ULTIMATE.start_main_~b~0#1 : int :: A % 4294967296 == (r + ULTIMATE.start_main_~b~0#1 * q) % 4294967296)) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) || ((((((b == 1 && A % 4294967296 >= 0) && (forall ULTIMATE.start_main_~b~0#1 : int :: A % 4294967296 == (r + ULTIMATE.start_main_~b~0#1 * q) % 4294967296)) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && q == 0) && A == r))) && r % 4294967296 >= 0) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && q == 0) && B == b) && A == r) && (((b % 4294967296 / 2 + -1 * (r % 4294967296) < (b % 4294967296 / 2 + -4294967295) / 4294967296 * 4294967296 + 4294967296 || b % 4294967296 / 2 + 1 < (b % 4294967296 / 2 + -4294967295) / 4294967296 * 4294967296 + 4294967296) || !(b % 4294967296 < 0)) || b % 2 == 0)) && B == 1) && ((b % 4294967296 / 2 < b % 4294967296 / 8589934592 * 4294967296 || -1 + b % 4294967296 / 2 + -1 * (r % 4294967296) < b % 4294967296 / 8589934592 * 4294967296) || (!(b % 2 == 0) && b % 4294967296 < 0))) || (((((((((((((r % 4294967296 <= 2 && A % 4294967296 >= 0) && ((((A % 4294967296 >= 0 && (forall ULTIMATE.start_main_~b~0#1 : int :: A % 4294967296 == (r + ULTIMATE.start_main_~b~0#1 * q) % 4294967296)) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) || ((((((b == 1 && A % 4294967296 >= 0) && (forall ULTIMATE.start_main_~b~0#1 : int :: A % 4294967296 == (r + ULTIMATE.start_main_~b~0#1 * q) % 4294967296)) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && q == 0) && A == r))) && b == 2 * B) && r % 4294967296 >= 0) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && q == 0) && A == r) && (((b % 4294967296 / 2 + -1 * (r % 4294967296) < (b % 4294967296 / 2 + -4294967295) / 4294967296 * 4294967296 + 4294967296 || b % 4294967296 / 2 + 1 < (b % 4294967296 / 2 + -4294967295) / 4294967296 * 4294967296 + 4294967296) || !(b % 4294967296 < 0)) || b % 2 == 0)) && b == 2 * 1) && r % 4294967296 >= B % 4294967296) && B == 1) && ((b % 4294967296 / 2 < b % 4294967296 / 8589934592 * 4294967296 || -1 + b % 4294967296 / 2 + -1 * (r % 4294967296) < b % 4294967296 / 8589934592 * 4294967296) || (!(b % 2 == 0) && b % 4294967296 < 0)))) || (((((((((((((((((r % 4294967296 <= 2 && ((r + 2 * q * (b % 4294967296 / 2)) % 4294967296 == A % 4294967296 || (!(b % 2 == 0) && b % 4294967296 < 0))) && A % 4294967296 >= 0) && ((((A % 4294967296 >= 0 && (forall ULTIMATE.start_main_~b~0#1 : int :: A % 4294967296 == (r + ULTIMATE.start_main_~b~0#1 * q) % 4294967296)) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) || ((((((b == 1 && A % 4294967296 >= 0) && (forall ULTIMATE.start_main_~b~0#1 : int :: A % 4294967296 == (r + ULTIMATE.start_main_~b~0#1 * q) % 4294967296)) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && q == 0) && A == r))) && r % 4294967296 >= 0) && 2 * (2 * B) == b) && A % 4294967296 <= 2) && (((cond == 1 && A % 4294967296 >= 0) && A % 4294967296 <= 2) || ((!(A % 4294967296 <= 2) || !(A % 4294967296 >= 0)) && cond == 0))) && ((r + 2 * (b % 2147483648) * q) % 4294967296 == A % 4294967296 || r % 4294967296 >= 2 * (b % 2147483648))) && q == 0) && b == 2 * (2 * 1)) && A == r) && (((r + 2 * q * (b % 4294967296 / 2) + 2 * q) % 4294967296 == A % 4294967296 || !(b % 4294967296 < 0)) || b % 2 == 0)) && (((b % 4294967296 / 2 + -1 * (r % 4294967296) < (b % 4294967296 / 2 + -4294967295) / 4294967296 * 4294967296 + 4294967296 || b % 4294967296 / 2 + 1 < (b % 4294967296 / 2 + -4294967295) / 4294967296 * 4294967296 + 4294967296) || !(b % 4294967296 < 0)) || b % 2 == 0)) && r % 4294967296 >= B % 4294967296) && B == 1) && A % 4294967296 == (r + b * q) % 4294967296) && ((b % 4294967296 / 2 < b % 4294967296 / 8589934592 * 4294967296 || -1 + b % 4294967296 / 2 + -1 * (r % 4294967296) < b % 4294967296 / 8589934592 * 4294967296) || (!(b % 2 == 0) && b % 4294967296 < 0))) RESULT: Ultimate proved your program to be correct! [2023-02-17 01:36:33,586 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