./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2e0d3ed79ba62190a0b501c090bc81fd178363cb7e6ce8cbe0996ce655e2ac6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 01:25:43,516 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 01:25:43,518 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 01:25:43,541 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 01:25:43,541 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 01:25:43,542 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 01:25:43,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 01:25:43,545 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 01:25:43,546 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 01:25:43,547 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 01:25:43,548 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 01:25:43,549 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 01:25:43,549 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 01:25:43,550 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 01:25:43,551 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 01:25:43,552 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 01:25:43,552 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 01:25:43,553 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 01:25:43,554 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 01:25:43,556 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 01:25:43,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 01:25:43,558 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 01:25:43,559 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 01:25:43,560 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 01:25:43,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 01:25:43,563 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 01:25:43,563 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 01:25:43,564 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 01:25:43,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 01:25:43,565 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 01:25:43,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 01:25:43,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 01:25:43,567 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 01:25:43,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 01:25:43,568 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 01:25:43,569 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 01:25:43,569 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 01:25:43,569 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 01:25:43,570 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 01:25:43,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 01:25:43,571 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 01:25:43,573 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 01:25:43,610 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 01:25:43,610 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 01:25:43,610 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 01:25:43,610 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 01:25:43,611 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 01:25:43,611 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 01:25:43,611 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 01:25:43,611 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 01:25:43,612 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 01:25:43,612 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 01:25:43,612 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 01:25:43,612 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 01:25:43,612 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 01:25:43,612 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 01:25:43,612 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 01:25:43,613 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 01:25:43,613 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 01:25:43,613 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 01:25:43,613 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 01:25:43,613 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 01:25:43,613 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 01:25:43,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 01:25:43,614 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 01:25:43,614 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 01:25:43,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 01:25:43,614 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 01:25:43,614 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 01:25:43,614 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 01:25:43,614 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 01:25:43,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 01:25:43,615 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 01:25:43,615 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 01:25:43,615 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 01:25:43,615 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 01:25:43,615 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 01:25:43,615 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 -> a2e0d3ed79ba62190a0b501c090bc81fd178363cb7e6ce8cbe0996ce655e2ac6 [2023-02-18 01:25:43,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 01:25:43,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 01:25:43,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 01:25:43,878 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 01:25:43,879 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 01:25:43,880 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound1.c [2023-02-18 01:25:45,145 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 01:25:45,337 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 01:25:45,337 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound1.c [2023-02-18 01:25:45,342 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/052e5a403/ac3c029400f240399c8e573a04b704ba/FLAGebafa7851 [2023-02-18 01:25:45,354 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/052e5a403/ac3c029400f240399c8e573a04b704ba [2023-02-18 01:25:45,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 01:25:45,358 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 01:25:45,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 01:25:45,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 01:25:45,365 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 01:25:45,365 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:25:45" (1/1) ... [2023-02-18 01:25:45,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f6ec3b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:25:45, skipping insertion in model container [2023-02-18 01:25:45,366 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:25:45" (1/1) ... [2023-02-18 01:25:45,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 01:25:45,385 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 01:25:45,506 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/dijkstra-u_valuebound1.c[525,538] [2023-02-18 01:25:45,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 01:25:45,536 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 01:25:45,546 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/dijkstra-u_valuebound1.c[525,538] [2023-02-18 01:25:45,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 01:25:45,575 INFO L208 MainTranslator]: Completed translation [2023-02-18 01:25:45,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:25:45 WrapperNode [2023-02-18 01:25:45,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 01:25:45,577 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 01:25:45,577 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 01:25:45,577 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 01:25:45,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:25:45" (1/1) ... [2023-02-18 01:25:45,588 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:25:45" (1/1) ... [2023-02-18 01:25:45,606 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2023-02-18 01:25:45,608 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 01:25:45,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 01:25:45,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 01:25:45,608 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 01:25:45,616 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:25:45" (1/1) ... [2023-02-18 01:25:45,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:25:45" (1/1) ... [2023-02-18 01:25:45,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:25:45" (1/1) ... [2023-02-18 01:25:45,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:25:45" (1/1) ... [2023-02-18 01:25:45,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:25:45" (1/1) ... [2023-02-18 01:25:45,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:25:45" (1/1) ... [2023-02-18 01:25:45,646 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:25:45" (1/1) ... [2023-02-18 01:25:45,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:25:45" (1/1) ... [2023-02-18 01:25:45,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 01:25:45,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 01:25:45,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 01:25:45,650 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 01:25:45,651 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:25:45" (1/1) ... [2023-02-18 01:25:45,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 01:25:45,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:25:45,694 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-18 01:25:45,696 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-18 01:25:45,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 01:25:45,726 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-18 01:25:45,726 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-18 01:25:45,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 01:25:45,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 01:25:45,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 01:25:45,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 01:25:45,727 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 01:25:45,774 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 01:25:45,776 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 01:25:45,931 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 01:25:45,949 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 01:25:45,950 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-18 01:25:45,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:25:45 BoogieIcfgContainer [2023-02-18 01:25:45,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 01:25:45,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 01:25:45,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 01:25:45,955 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 01:25:45,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 01:25:45" (1/3) ... [2023-02-18 01:25:45,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24637901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:25:45, skipping insertion in model container [2023-02-18 01:25:45,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:25:45" (2/3) ... [2023-02-18 01:25:45,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24637901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:25:45, skipping insertion in model container [2023-02-18 01:25:45,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:25:45" (3/3) ... [2023-02-18 01:25:45,958 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound1.c [2023-02-18 01:25:45,972 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 01:25:45,972 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 01:25:46,011 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 01:25:46,017 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;@b5d047a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 01:25:46,017 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 01:25:46,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-18 01:25:46,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-18 01:25:46,027 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:25:46,027 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:25:46,028 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:25:46,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:25:46,032 INFO L85 PathProgramCache]: Analyzing trace with hash -645822239, now seen corresponding path program 1 times [2023-02-18 01:25:46,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:25:46,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123947456] [2023-02-18 01:25:46,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:25:46,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:25:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:25:46,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:25:46,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123947456] [2023-02-18 01:25:46,173 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-18 01:25:46,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944849150] [2023-02-18 01:25:46,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:25:46,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:25:46,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:25:46,181 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-18 01:25:46,220 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-18 01:25:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:25:46,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-18 01:25:46,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:25:46,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 01:25:46,298 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 01:25:46,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944849150] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 01:25:46,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 01:25:46,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 01:25:46,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304340497] [2023-02-18 01:25:46,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 01:25:46,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 01:25:46,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:25:46,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 01:25:46,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 01:25:46,333 INFO L87 Difference]: Start difference. First operand has 33 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 01:25:46,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:25:46,371 INFO L93 Difference]: Finished difference Result 63 states and 107 transitions. [2023-02-18 01:25:46,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 01:25:46,373 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2023-02-18 01:25:46,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:25:46,379 INFO L225 Difference]: With dead ends: 63 [2023-02-18 01:25:46,379 INFO L226 Difference]: Without dead ends: 29 [2023-02-18 01:25:46,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 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-18 01:25:46,384 INFO L413 NwaCegarLoop]: 44 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, 44 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-18 01:25:46,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 01:25:46,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-18 01:25:46,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-18 01:25:46,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 01:25:46,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2023-02-18 01:25:46,428 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 19 [2023-02-18 01:25:46,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:25:46,428 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2023-02-18 01:25:46,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 01:25:46,429 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2023-02-18 01:25:46,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-18 01:25:46,430 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:25:46,431 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:25:46,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-18 01:25:46,636 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-18 01:25:46,637 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:25:46,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:25:46,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1757085840, now seen corresponding path program 1 times [2023-02-18 01:25:46,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:25:46,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397351822] [2023-02-18 01:25:46,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:25:46,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:25:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:25:47,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 01:25:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:25:47,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 01:25:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:25:47,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 01:25:47,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:25:47,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397351822] [2023-02-18 01:25:47,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397351822] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 01:25:47,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 01:25:47,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 01:25:47,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340763690] [2023-02-18 01:25:47,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 01:25:47,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 01:25:47,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:25:47,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 01:25:47,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 01:25:47,026 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 01:25:49,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:25:52,315 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-18 01:25:54,809 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-18 01:25:55,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:25:55,163 INFO L93 Difference]: Finished difference Result 64 states and 94 transitions. [2023-02-18 01:25:55,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 01:25:55,164 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2023-02-18 01:25:55,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:25:55,165 INFO L225 Difference]: With dead ends: 64 [2023-02-18 01:25:55,165 INFO L226 Difference]: Without dead ends: 46 [2023-02-18 01:25:55,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-18 01:25:55,167 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 18 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:25:55,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 157 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 86 Invalid, 3 Unknown, 0 Unchecked, 8.1s Time] [2023-02-18 01:25:55,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-18 01:25:55,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2023-02-18 01:25:55,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-02-18 01:25:55,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2023-02-18 01:25:55,184 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 20 [2023-02-18 01:25:55,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:25:55,185 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2023-02-18 01:25:55,185 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 01:25:55,185 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2023-02-18 01:25:55,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-18 01:25:55,186 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:25:55,186 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:25:55,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 01:25:55,186 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:25:55,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:25:55,187 INFO L85 PathProgramCache]: Analyzing trace with hash -332038773, now seen corresponding path program 1 times [2023-02-18 01:25:55,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:25:55,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890879120] [2023-02-18 01:25:55,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:25:55,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:25:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:25:55,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 01:25:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:25:55,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 01:25:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:25:55,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 01:25:55,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:25:55,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890879120] [2023-02-18 01:25:55,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890879120] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 01:25:55,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409903191] [2023-02-18 01:25:55,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:25:55,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:25:55,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:25:55,485 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-18 01:25:55,488 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-18 01:25:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:25:55,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 01:25:55,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:25:55,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 01:25:55,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:25:55,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 01:25:55,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409903191] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:25:55,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 01:25:55,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2023-02-18 01:25:55,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133758948] [2023-02-18 01:25:55,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 01:25:55,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 01:25:55,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:25:55,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 01:25:55,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2023-02-18 01:25:55,720 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 01:26:09,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:26:09,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:26:09,386 INFO L93 Difference]: Finished difference Result 124 states and 198 transitions. [2023-02-18 01:26:09,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 01:26:09,387 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-02-18 01:26:09,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:26:09,389 INFO L225 Difference]: With dead ends: 124 [2023-02-18 01:26:09,389 INFO L226 Difference]: Without dead ends: 102 [2023-02-18 01:26:09,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2023-02-18 01:26:09,391 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 42 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 144 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2023-02-18 01:26:09,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 368 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 430 Invalid, 1 Unknown, 0 Unchecked, 13.5s Time] [2023-02-18 01:26:09,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-02-18 01:26:09,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 63. [2023-02-18 01:26:09,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 32 states have (on average 1.21875) internal successors, (39), 36 states have internal predecessors, (39), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2023-02-18 01:26:09,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 89 transitions. [2023-02-18 01:26:09,422 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 89 transitions. Word has length 22 [2023-02-18 01:26:09,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:26:09,425 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 89 transitions. [2023-02-18 01:26:09,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 01:26:09,425 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 89 transitions. [2023-02-18 01:26:09,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-18 01:26:09,427 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:26:09,427 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:26:09,436 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-18 01:26:09,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-02-18 01:26:09,633 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:26:09,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:26:09,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1041809680, now seen corresponding path program 1 times [2023-02-18 01:26:09,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:26:09,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040184246] [2023-02-18 01:26:09,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:26:09,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:26:09,645 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:26:09,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [742146013] [2023-02-18 01:26:09,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:26:09,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:26:09,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:26:09,652 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-18 01:26:09,655 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-18 01:26:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:26:09,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 01:26:09,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:26:09,768 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 01:26:09,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:26:12,080 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~r~0#1| Int) (|ULTIMATE.start_main_~n~0#1| Int)) (or (= (mod (+ (* |c_ULTIMATE.start_main_~p~0#1| 16 |ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~h~0#1| |c_ULTIMATE.start_main_~h~0#1| |c_ULTIMATE.start_main_~h~0#1|) (* |c_ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~n~0#1| 4294967284 |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~r~0#1| 4294967280 |c_ULTIMATE.start_main_~q~0#1|) (* 4294967295 |c_ULTIMATE.start_main_~h~0#1| |c_ULTIMATE.start_main_~q~0#1| |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~r~0#1| 12 |c_ULTIMATE.start_main_~q~0#1|) (* 4294967292 |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~q~0#1| |c_ULTIMATE.start_main_~q~0#1|)) 4294967296) 0) (not (= (mod (* |ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~q~0#1|) 4294967296) (mod (+ (* |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~p~0#1|) (* |ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~q~0#1|)) 4294967296))))) is different from false [2023-02-18 01:26:12,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:26:12,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040184246] [2023-02-18 01:26:12,156 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:26:12,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742146013] [2023-02-18 01:26:12,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742146013] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 01:26:12,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 01:26:12,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2023-02-18 01:26:12,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581864401] [2023-02-18 01:26:12,157 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 01:26:12,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 01:26:12,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:26:12,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 01:26:12,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2023-02-18 01:26:12,158 INFO L87 Difference]: Start difference. First operand 63 states and 89 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 01:26:16,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:26:18,097 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-18 01:26:20,100 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-18 01:26:22,103 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-18 01:26:23,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:26:27,336 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-18 01:26:27,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:26:27,415 INFO L93 Difference]: Finished difference Result 80 states and 109 transitions. [2023-02-18 01:26:27,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 01:26:27,416 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2023-02-18 01:26:27,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:26:27,418 INFO L225 Difference]: With dead ends: 80 [2023-02-18 01:26:27,419 INFO L226 Difference]: Without dead ends: 57 [2023-02-18 01:26:27,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=37, Invalid=98, Unknown=1, NotChecked=20, Total=156 [2023-02-18 01:26:27,420 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 13 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 6 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2023-02-18 01:26:27,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 122 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 186 Invalid, 5 Unknown, 0 Unchecked, 14.3s Time] [2023-02-18 01:26:27,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-18 01:26:27,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-02-18 01:26:27,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 31 states have internal predecessors, (34), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2023-02-18 01:26:27,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 82 transitions. [2023-02-18 01:26:27,432 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 82 transitions. Word has length 30 [2023-02-18 01:26:27,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:26:27,433 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 82 transitions. [2023-02-18 01:26:27,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 01:26:27,433 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 82 transitions. [2023-02-18 01:26:27,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-18 01:26:27,434 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:26:27,434 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:26:27,440 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-18 01:26:27,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:26:27,640 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:26:27,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:26:27,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1015454531, now seen corresponding path program 1 times [2023-02-18 01:26:27,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:26:27,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054283633] [2023-02-18 01:26:27,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:26:27,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:26:27,648 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:26:27,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1351826603] [2023-02-18 01:26:27,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:26:27,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:26:27,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:26:27,650 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-18 01:26:27,656 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-18 01:26:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:26:27,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 01:26:27,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:26:27,773 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-18 01:26:27,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:26:27,825 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 01:26:27,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:26:27,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054283633] [2023-02-18 01:26:27,825 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:26:27,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351826603] [2023-02-18 01:26:27,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351826603] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:26:27,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:26:27,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2023-02-18 01:26:27,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731290139] [2023-02-18 01:26:27,826 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:26:27,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 01:26:27,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:26:27,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 01:26:27,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-02-18 01:26:27,828 INFO L87 Difference]: Start difference. First operand 57 states and 82 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 9 states have internal predecessors, (31), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-18 01:26:30,335 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-18 01:26:34,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:26:36,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:26:39,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:26:41,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:26:45,299 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-18 01:26:46,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:26:46,340 INFO L93 Difference]: Finished difference Result 81 states and 114 transitions. [2023-02-18 01:26:46,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 01:26:46,340 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 9 states have internal predecessors, (31), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 29 [2023-02-18 01:26:46,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:26:46,341 INFO L225 Difference]: With dead ends: 81 [2023-02-18 01:26:46,341 INFO L226 Difference]: Without dead ends: 55 [2023-02-18 01:26:46,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:26:46,342 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 19 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 28 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.5s IncrementalHoareTripleChecker+Time [2023-02-18 01:26:46,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 129 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 127 Invalid, 5 Unknown, 0 Unchecked, 18.5s Time] [2023-02-18 01:26:46,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-18 01:26:46,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2023-02-18 01:26:46,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 25 states have (on average 1.16) internal successors, (29), 27 states have internal predecessors, (29), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-18 01:26:46,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2023-02-18 01:26:46,354 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 29 [2023-02-18 01:26:46,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:26:46,354 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2023-02-18 01:26:46,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 9 states have internal predecessors, (31), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-18 01:26:46,355 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2023-02-18 01:26:46,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-18 01:26:46,355 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:26:46,355 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:26:46,367 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-18 01:26:46,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:26:46,564 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:26:46,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:26:46,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1797429611, now seen corresponding path program 1 times [2023-02-18 01:26:46,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:26:46,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209093774] [2023-02-18 01:26:46,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:26:46,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:26:46,569 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:26:46,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [999007409] [2023-02-18 01:26:46,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:26:46,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:26:46,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:26:46,571 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-18 01:26:46,585 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-18 01:26:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:26:46,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 01:26:46,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:26:46,858 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 01:26:46,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:26:48,870 WARN L859 $PredicateComparison]: unable to prove that (= 0 (mod (+ (* |c_ULTIMATE.start_main_~h~0#1| |c_ULTIMATE.start_main_~r~0#1| 12 |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~r~0#1| 4294967280 |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~h~0#1| |c_ULTIMATE.start_main_~h~0#1| |c_ULTIMATE.start_main_~h~0#1|) (* |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~p~0#1| 16 |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~h~0#1| 4294967284 |c_ULTIMATE.start_main_~q~0#1|) (* 4294967295 |c_ULTIMATE.start_main_~h~0#1| |c_ULTIMATE.start_main_~q~0#1| |c_ULTIMATE.start_main_~q~0#1|) (* 4294967292 |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~q~0#1| |c_ULTIMATE.start_main_~q~0#1|)) 4294967296)) is different from true [2023-02-18 01:26:50,937 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~q~0#1| Int) (|ULTIMATE.start_main_~r~0#1| Int) (|ULTIMATE.start_main_~n~0#1| Int)) (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~p~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) 4294967296) (mod (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~q~0#1|) 4294967296))) (= (mod (+ (* |c_ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1| 4294967280) (* |c_ULTIMATE.start_main_~h~0#1| |c_ULTIMATE.start_main_~h~0#1| |c_ULTIMATE.start_main_~h~0#1|) (* |c_ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1| 12) (* 4294967295 |c_ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~p~0#1| 16 |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~q~0#1| 4294967284) (* 4294967292 |c_ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296) 0))) is different from false [2023-02-18 01:26:51,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:26:51,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209093774] [2023-02-18 01:26:51,152 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:26:51,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999007409] [2023-02-18 01:26:51,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999007409] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 01:26:51,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 01:26:51,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2023-02-18 01:26:51,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295616134] [2023-02-18 01:26:51,152 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 01:26:51,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 01:26:51,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:26:51,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 01:26:51,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=56, Unknown=2, NotChecked=30, Total=110 [2023-02-18 01:26:51,154 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 01:26:53,176 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-18 01:26:55,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:26:57,451 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-18 01:26:59,452 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-18 01:27:01,457 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-18 01:27:04,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:27:06,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:27:08,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:27:11,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:27:11,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:27:11,712 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2023-02-18 01:27:11,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 01:27:11,712 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2023-02-18 01:27:11,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:27:11,713 INFO L225 Difference]: With dead ends: 63 [2023-02-18 01:27:11,714 INFO L226 Difference]: Without dead ends: 61 [2023-02-18 01:27:11,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=35, Invalid=81, Unknown=2, NotChecked=38, Total=156 [2023-02-18 01:27:11,715 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 9 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2023-02-18 01:27:11,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 100 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 117 Invalid, 9 Unknown, 0 Unchecked, 20.5s Time] [2023-02-18 01:27:11,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-02-18 01:27:11,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-02-18 01:27:11,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 33 states have internal predecessors, (35), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-18 01:27:11,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2023-02-18 01:27:11,727 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 32 [2023-02-18 01:27:11,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:27:11,728 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2023-02-18 01:27:11,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 01:27:11,728 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2023-02-18 01:27:11,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-18 01:27:11,729 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:27:11,729 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:27:11,741 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-18 01:27:11,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:27:11,935 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:27:11,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:27:11,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1526883210, now seen corresponding path program 1 times [2023-02-18 01:27:11,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:27:11,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092878433] [2023-02-18 01:27:11,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:27:11,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:27:11,948 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:27:11,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1835325960] [2023-02-18 01:27:11,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:27:11,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:27:11,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:27:11,950 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-18 01:27:11,961 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-18 01:27:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:27:12,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-18 01:27:12,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:27:12,238 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-02-18 01:27:12,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:27:16,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:27:16,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092878433] [2023-02-18 01:27:16,652 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:27:16,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835325960] [2023-02-18 01:27:16,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835325960] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 01:27:16,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 01:27:16,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2023-02-18 01:27:16,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581943611] [2023-02-18 01:27:16,653 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 01:27:16,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 01:27:16,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:27:16,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 01:27:16,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=281, Unknown=2, NotChecked=0, Total=342 [2023-02-18 01:27:16,654 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-18 01:27:21,287 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 [0] [2023-02-18 01:27:23,913 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-18 01:27:25,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:27:28,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:27:30,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:27:32,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:27:34,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:27:36,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:27:40,764 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-18 01:27:42,766 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-18 01:27:47,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:27:49,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:27:51,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:27:53,963 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 [0] [2023-02-18 01:27:55,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:27:57,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:27:59,976 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-18 01:28:02,086 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-18 01:28:04,088 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-18 01:28:06,089 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 [0] [2023-02-18 01:28:08,090 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-18 01:28:10,092 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-18 01:28:12,093 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-18 01:28:14,094 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-18 01:28:14,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:28:14,095 INFO L93 Difference]: Finished difference Result 84 states and 112 transitions. [2023-02-18 01:28:14,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 01:28:14,096 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 55 [2023-02-18 01:28:14,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:28:14,097 INFO L225 Difference]: With dead ends: 84 [2023-02-18 01:28:14,097 INFO L226 Difference]: Without dead ends: 59 [2023-02-18 01:28:14,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=92, Invalid=458, Unknown=2, NotChecked=0, Total=552 [2023-02-18 01:28:14,098 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 29 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 61 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.4s IncrementalHoareTripleChecker+Time [2023-02-18 01:28:14,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 124 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 494 Invalid, 22 Unknown, 0 Unchecked, 57.4s Time] [2023-02-18 01:28:14,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-18 01:28:14,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2023-02-18 01:28:14,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.0625) internal successors, (34), 34 states have internal predecessors, (34), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-02-18 01:28:14,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2023-02-18 01:28:14,110 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 55 [2023-02-18 01:28:14,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:28:14,110 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2023-02-18 01:28:14,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-18 01:28:14,110 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2023-02-18 01:28:14,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-18 01:28:14,112 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:28:14,112 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:28:14,121 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-18 01:28:14,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:28:14,318 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:28:14,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:28:14,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1584141512, now seen corresponding path program 1 times [2023-02-18 01:28:14,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:28:14,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531487178] [2023-02-18 01:28:14,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:28:14,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:28:14,326 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:28:14,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [944767962] [2023-02-18 01:28:14,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:28:14,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:28:14,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:28:14,328 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-18 01:28:14,332 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-18 01:28:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:28:14,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 01:28:14,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:28:14,442 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-02-18 01:28:14,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:28:14,556 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-02-18 01:28:14,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:28:14,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531487178] [2023-02-18 01:28:14,556 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:28:14,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944767962] [2023-02-18 01:28:14,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944767962] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:28:14,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:28:14,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-18 01:28:14,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481868433] [2023-02-18 01:28:14,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:28:14,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 01:28:14,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:28:14,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 01:28:14,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-18 01:28:14,563 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-02-18 01:28:16,683 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-18 01:28:18,751 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-18 01:28:24,265 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-18 01:28:26,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:28:29,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:28:32,006 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-18 01:28:32,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:28:32,468 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2023-02-18 01:28:32,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 01:28:32,469 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 55 [2023-02-18 01:28:32,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:28:32,470 INFO L225 Difference]: With dead ends: 63 [2023-02-18 01:28:32,470 INFO L226 Difference]: Without dead ends: 55 [2023-02-18 01:28:32,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:28:32,471 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 11 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 30 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.9s IncrementalHoareTripleChecker+Time [2023-02-18 01:28:32,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 100 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 108 Invalid, 5 Unknown, 0 Unchecked, 17.9s Time] [2023-02-18 01:28:32,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-18 01:28:32,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-02-18 01:28:32,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.032258064516129) internal successors, (32), 32 states have internal predecessors, (32), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-02-18 01:28:32,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2023-02-18 01:28:32,481 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 55 [2023-02-18 01:28:32,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:28:32,481 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2023-02-18 01:28:32,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-02-18 01:28:32,482 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2023-02-18 01:28:32,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-18 01:28:32,483 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:28:32,483 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:28:32,488 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-18 01:28:32,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:28:32,688 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:28:32,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:28:32,689 INFO L85 PathProgramCache]: Analyzing trace with hash 657582233, now seen corresponding path program 2 times [2023-02-18 01:28:32,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:28:32,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894537455] [2023-02-18 01:28:32,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:28:32,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:28:32,696 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:28:32,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [759130325] [2023-02-18 01:28:32,696 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 01:28:32,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:28:32,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:28:32,698 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-18 01:28:32,724 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-18 01:28:32,855 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 01:28:32,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:28:32,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-18 01:28:32,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:28:33,020 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 13 proven. 27 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-02-18 01:28:33,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:28:36,109 WARN L859 $PredicateComparison]: unable to prove that (or (not (>= (mod |c_ULTIMATE.start_main_~r~0#1| 4294967296) (mod |c_ULTIMATE.start_main_~h~0#1| 4294967296))) (= (mod (* |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~q~0#1|) 4294967296) (mod (+ (* |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~p~0#1|) (* 4294967295 |c_ULTIMATE.start_main_~h~0#1| |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~p~0#1| 2 |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~q~0#1| |c_ULTIMATE.start_main_~q~0#1|)) 4294967296))) is different from true [2023-02-18 01:34:26,837 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 13 proven. 21 refuted. 3 times theorem prover too weak. 70 trivial. 0 not checked. [2023-02-18 01:34:26,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:34:26,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894537455] [2023-02-18 01:34:26,837 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:34:26,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759130325] [2023-02-18 01:34:26,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759130325] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:34:26,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:34:26,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2023-02-18 01:34:26,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57063262] [2023-02-18 01:34:26,838 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:34:26,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-18 01:34:26,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:34:26,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-18 01:34:26,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=306, Unknown=6, NotChecked=36, Total=420 [2023-02-18 01:34:26,839 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 18 states have internal predecessors, (39), 7 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 6 states have call predecessors, (18), 7 states have call successors, (18) [2023-02-18 01:34:29,675 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-18 01:34:31,682 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-18 01:34:35,547 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-18 01:34:42,269 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-18 01:34:44,296 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-18 01:34:47,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:34:49,026 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-18 01:34:54,766 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-18 01:34:59,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:35:00,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:35:03,225 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-18 01:35:05,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:35:08,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:35:09,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:35:14,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:35:18,643 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-18 01:35:21,048 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-18 01:35:23,798 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-18 01:35:26,217 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-18 01:35:28,346 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-18 01:35:30,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:35:33,709 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-18 01:35:35,945 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-18 01:35:37,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:35:39,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:35:41,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:35:45,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:35:47,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:35:49,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:35:51,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:35:53,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:35:55,551 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-18 01:35:57,556 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-18 01:36:00,420 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-18 01:36:02,424 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-18 01:36:05,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:36:07,066 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-18 01:36:08,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:36:10,923 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-18 01:36:11,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:36:11,129 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2023-02-18 01:36:11,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 01:36:11,129 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 18 states have internal predecessors, (39), 7 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 6 states have call predecessors, (18), 7 states have call successors, (18) Word has length 60 [2023-02-18 01:36:11,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:36:11,130 INFO L225 Difference]: With dead ends: 63 [2023-02-18 01:36:11,130 INFO L226 Difference]: Without dead ends: 61 [2023-02-18 01:36:11,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 97 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 38.3s TimeCoverageRelationStatistics Valid=91, Invalid=412, Unknown=7, NotChecked=42, Total=552 [2023-02-18 01:36:11,131 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 21 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 30 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 97.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 30 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 97.7s IncrementalHoareTripleChecker+Time [2023-02-18 01:36:11,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 118 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 402 Invalid, 30 Unknown, 55 Unchecked, 97.7s Time] [2023-02-18 01:36:11,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-02-18 01:36:11,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2023-02-18 01:36:11,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-02-18 01:36:11,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2023-02-18 01:36:11,144 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 60 [2023-02-18 01:36:11,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:36:11,144 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2023-02-18 01:36:11,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 18 states have internal predecessors, (39), 7 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 6 states have call predecessors, (18), 7 states have call successors, (18) [2023-02-18 01:36:11,145 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2023-02-18 01:36:11,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-18 01:36:11,146 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:36:11,146 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:36:11,157 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-18 01:36:11,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-02-18 01:36:11,357 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:36:11,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:36:11,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1365029718, now seen corresponding path program 3 times [2023-02-18 01:36:11,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:36:11,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804868606] [2023-02-18 01:36:11,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:36:11,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:36:11,372 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:36:11,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1918466122] [2023-02-18 01:36:11,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 01:36:11,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:36:11,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:36:11,374 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-18 01:36:11,377 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-18 01:36:11,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-18 01:36:11,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:36:11,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-18 01:36:11,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:36:11,590 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2023-02-18 01:36:11,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:36:37,270 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse14 (mod |c_ULTIMATE.start_main_~q~0#1| 1073741824))) (let ((.cse0 (* .cse14 4))) (or (= .cse0 1) (<= .cse0 (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296)) (let ((.cse15 (mod |c_ULTIMATE.start_main_~p~0#1| 4294967296))) (let ((.cse16 (div .cse15 2))) (let ((.cse1 (* .cse14 .cse14 12 .cse16)) (.cse2 (* |c_ULTIMATE.start_main_~n~0#1| .cse14 |c_ULTIMATE.start_main_~p~0#1| 4294967284)) (.cse3 (* 4294967292 .cse14 .cse14 |c_ULTIMATE.start_main_~r~0#1|)) (.cse4 (* |c_ULTIMATE.start_main_~n~0#1| .cse14 .cse14 4)) (.cse5 (* |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~p~0#1|)) (.cse6 (* .cse14 |c_ULTIMATE.start_main_~r~0#1| .cse16 4294967280)) (.cse7 (* .cse14 .cse14 4294967290 |c_ULTIMATE.start_main_~p~0#1|)) (.cse8 (* .cse14 |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~r~0#1| 12)) (.cse9 (* .cse14 |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~p~0#1| 4294967287)) (.cse10 (* .cse14 |c_ULTIMATE.start_main_~p~0#1| 16 .cse16)) (.cse11 (* |c_ULTIMATE.start_main_~n~0#1| .cse14 16 .cse16)) (.cse13 (< .cse15 0)) (.cse12 (= (mod |c_ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (= (mod (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) 4294967296) 0) (and (not .cse12) .cse13)) (or (= (mod (+ .cse1 .cse2 (* .cse14 |c_ULTIMATE.start_main_~r~0#1| 4294967280) .cse3 .cse4 .cse5 (* .cse14 .cse14 12) .cse6 .cse7 .cse8 .cse9 .cse10 (* .cse14 |c_ULTIMATE.start_main_~p~0#1| 16) .cse11 (* |c_ULTIMATE.start_main_~n~0#1| .cse14 16)) 4294967296) 0) (not .cse13) .cse12)))))))) is different from true [2023-02-18 01:36:37,277 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 116 trivial. 2 not checked. [2023-02-18 01:36:37,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:36:37,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804868606] [2023-02-18 01:36:37,277 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:36:37,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918466122] [2023-02-18 01:36:37,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918466122] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:36:37,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:36:37,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-02-18 01:36:37,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515851737] [2023-02-18 01:36:37,278 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:36:37,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 01:36:37,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:36:37,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 01:36:37,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=157, Unknown=10, NotChecked=26, Total=240 [2023-02-18 01:36:37,279 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 14 states have internal predecessors, (31), 5 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2023-02-18 01:36:39,562 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-18 01:36:41,586 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-18 01:36:42,613 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-18 01:36:44,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:36:46,759 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-18 01:36:48,761 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-18 01:36:50,949 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-18 01:36:52,952 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-18 01:36:55,371 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-18 01:36:57,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:37:00,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:37:08,439 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-18 01:37:11,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:37:15,526 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-18 01:37:18,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:37:20,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:37:22,479 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-18 01:37:25,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:37:28,200 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-18 01:37:31,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:37:33,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:37:37,487 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-18 01:37:42,270 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-18 01:37:44,304 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-18 01:37:46,943 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-18 01:37:49,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:37:56,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:37:58,537 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-18 01:37:58,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:37:58,538 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2023-02-18 01:37:58,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 01:37:58,545 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 14 states have internal predecessors, (31), 5 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 65 [2023-02-18 01:37:58,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:37:58,546 INFO L225 Difference]: With dead ends: 59 [2023-02-18 01:37:58,546 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 01:37:58,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 29.9s TimeCoverageRelationStatistics Valid=60, Invalid=204, Unknown=12, NotChecked=30, Total=306 [2023-02-18 01:37:58,547 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 14 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 28 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 76.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 76.8s IncrementalHoareTripleChecker+Time [2023-02-18 01:37:58,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 114 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 222 Invalid, 22 Unknown, 50 Unchecked, 76.8s Time] [2023-02-18 01:37:58,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 01:37:58,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 01:37:58,547 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-18 01:37:58,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 01:37:58,548 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2023-02-18 01:37:58,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:37:58,548 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 01:37:58,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 14 states have internal predecessors, (31), 5 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2023-02-18 01:37:58,548 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 01:37:58,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 01:37:58,550 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 01:37:58,559 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-18 01:37:58,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-18 01:37:58,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 01:37:58,778 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 32) no Hoare annotation was computed. [2023-02-18 01:37:58,778 INFO L902 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: true [2023-02-18 01:37:58,778 INFO L895 garLoopResultBuilder]: At program point L23-1(line 23) the Hoare annotation is: (let ((.cse0 (mod |ULTIMATE.start_main_~n~0#1| 4294967296))) (and (>= .cse0 0) (<= .cse0 1))) [2023-02-18 01:37:58,778 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 55) no Hoare annotation was computed. [2023-02-18 01:37:58,779 INFO L895 garLoopResultBuilder]: At program point L52-2(lines 38 56) the Hoare annotation is: (let ((.cse8 (mod |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse11 (mod |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse15 (= |ULTIMATE.start_main_~q~0#1| 1)) (.cse35 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse12 (>= .cse11 0)) (.cse40 (= |ULTIMATE.start_main_~h~0#1| 0)) (.cse14 (<= .cse11 1)) (.cse0 (<= .cse8 .cse11)) (.cse16 (* 4 1)) (.cse42 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse9 (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (or (let ((.cse13 (* (- 1) |ULTIMATE.start_main_~q~0#1|))) (let ((.cse17 (* 4294967295 |ULTIMATE.start_main_~r~0#1|)) (.cse23 (* 4294967295 |ULTIMATE.start_main_~q~0#1|)) (.cse10 (mod (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 4294967296)) (.cse19 (+ .cse13 |ULTIMATE.start_main_~p~0#1|))) (and (or .cse0 (let ((.cse4 (< .cse8 0)) (.cse1 (= (mod |ULTIMATE.start_main_~q~0#1| 4) 0)) (.cse5 (* (- 1) .cse9)) (.cse2 (div .cse8 4))) (and (let ((.cse3 (+ (* (div (+ .cse2 |ULTIMATE.start_main_~p~0#1| (- 4294967295)) 4294967296) 4294967296) 4294967296))) (or .cse1 (< (+ .cse2 |ULTIMATE.start_main_~p~0#1| 1) .cse3) (not .cse4) (< (+ .cse2 |ULTIMATE.start_main_~p~0#1| .cse5) .cse3))) (let ((.cse6 (+ .cse2 |ULTIMATE.start_main_~p~0#1|))) (let ((.cse7 (* (div .cse6 4294967296) 4294967296))) (or (< .cse6 .cse7) (and .cse4 (not .cse1)) (< (+ (- 1) .cse2 |ULTIMATE.start_main_~p~0#1| .cse5) .cse7))))))) (>= .cse10 .cse8) (= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~r~0#1|)) (not (<= 4 .cse11)) (<= .cse10 1) .cse12 (= (+ .cse13 |ULTIMATE.start_main_~h~0#1|) 0) .cse14 .cse15 (not (<= .cse16 .cse11)) (>= .cse11 (mod (+ .cse17 |ULTIMATE.start_main_~n~0#1|) 4294967296)) (= (+ (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~n~0#1|) .cse13) 0) (let ((.cse22 (mod (+ |ULTIMATE.start_main_~h~0#1| .cse23) 4294967296))) (let ((.cse18 (= (mod (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~q~0#1|) 2) 0)) (.cse21 (< .cse22 0)) (.cse20 (div .cse22 2))) (or (and (not .cse18) (= .cse19 (+ .cse20 1)) .cse21) (and (or .cse18 (not .cse21)) (= .cse19 .cse20))))) (let ((.cse27 (mod (+ .cse17 |ULTIMATE.start_main_~n~0#1| .cse23) 4294967296))) (let ((.cse25 (= (mod (+ |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse26 (< .cse27 0)) (.cse24 (div .cse27 2))) (or (and (= .cse19 .cse24) (or .cse25 (not .cse26))) (and (not .cse25) .cse26 (= (+ .cse24 1) .cse19))))) (>= .cse10 0) (= .cse19 0)))) (let ((.cse44 (div |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse39 (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)) (.cse38 (div |ULTIMATE.start_main_~r~0#1| 4294967296))) (let ((.cse31 (* .cse38 4294967296)) (.cse43 (<= .cse39 0)) (.cse33 (<= (+ .cse44 1) 0)) (.cse29 (* .cse39 4294967296))) (let ((.cse28 (* .cse44 4294967296)) (.cse32 (+ |ULTIMATE.start_main_~r~0#1| (- 4294967296) .cse29)) (.cse41 (not .cse33)) (.cse34 (not .cse43)) (.cse30 (+ (- 1) |ULTIMATE.start_main_~q~0#1| .cse31))) (and (or (<= (+ .cse28 |ULTIMATE.start_main_~r~0#1| .cse29) .cse30) (<= .cse31 .cse32) .cse33 .cse34) .cse35 (= (mod (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~q~0#1|) 4294967296) (mod (+ (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~p~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) 4294967296)) (or (let ((.cse37 (div |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse36 (<= (+ .cse37 (* (- 1) .cse38) .cse39) 0))) (and (or .cse36 (<= (* .cse37 4294967296) |ULTIMATE.start_main_~r~0#1|) .cse34) (or (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (not .cse36))))) .cse33) .cse40 .cse15 (or .cse41 (<= |ULTIMATE.start_main_~q~0#1| (+ .cse28 4294967295))) .cse42 (or (and (or (<= |ULTIMATE.start_main_~q~0#1| 4) .cse43) (or (and (or (<= (+ .cse28 .cse31) .cse32) .cse33) (or .cse41 (<= 0 .cse44))) .cse34)) (<= (+ |ULTIMATE.start_main_~r~0#1| .cse29) .cse30)) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))))) (and .cse35 .cse12 .cse40 .cse14 (<= 1 .cse9) (>= .cse9 (mod |ULTIMATE.start_main_~h~0#1| 4294967296)) (<= 1 .cse11) (not .cse0) (= .cse16 |ULTIMATE.start_main_~q~0#1|) .cse42 (not (<= .cse8 .cse9)))))) [2023-02-18 01:37:58,779 INFO L899 garLoopResultBuilder]: For program point L44(lines 38 56) no Hoare annotation was computed. [2023-02-18 01:37:58,779 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 19 61) the Hoare annotation is: true [2023-02-18 01:37:58,779 INFO L895 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: (let ((.cse31 (* 4 1)) (.cse28 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse15 (= |ULTIMATE.start_main_~q~0#1| 1)) (.cse32 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse8 (mod |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse11 (mod |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse0 (<= .cse8 .cse11)) (.cse29 (= (mod (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~q~0#1|) 4294967296) (mod (+ (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~p~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) 4294967296))) (.cse30 (= |ULTIMATE.start_main_~h~0#1| 0)) (.cse33 (or (let ((.cse47 (div |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse44 (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)) (.cse43 (div |ULTIMATE.start_main_~r~0#1| 4294967296))) (let ((.cse37 (* .cse43 4294967296)) (.cse46 (<= .cse44 0)) (.cse39 (<= (+ .cse47 1) 0)) (.cse35 (* .cse44 4294967296))) (let ((.cse34 (* .cse47 4294967296)) (.cse38 (+ |ULTIMATE.start_main_~r~0#1| (- 4294967296) .cse35)) (.cse45 (not .cse39)) (.cse40 (not .cse46)) (.cse36 (+ (- 1) |ULTIMATE.start_main_~q~0#1| .cse37))) (and (or (<= (+ .cse34 |ULTIMATE.start_main_~r~0#1| .cse35) .cse36) (<= .cse37 .cse38) .cse39 .cse40) .cse28 (or (let ((.cse42 (div |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse41 (<= (+ .cse42 (* (- 1) .cse43) .cse44) 0))) (and (or .cse41 (<= (* .cse42 4294967296) |ULTIMATE.start_main_~r~0#1|) .cse40) (or (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (not .cse41))))) .cse39) .cse15 (or .cse45 (<= |ULTIMATE.start_main_~q~0#1| (+ .cse34 4294967295))) .cse32 (or (and (or (<= |ULTIMATE.start_main_~q~0#1| 4) .cse46) (or (and (or (<= (+ .cse34 .cse37) .cse38) .cse39) (or .cse45 (<= 0 .cse47))) .cse40)) (<= (+ |ULTIMATE.start_main_~r~0#1| .cse35) .cse36)) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))))) (and .cse28 .cse15 .cse32))) (.cse9 (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (.cse12 (>= .cse11 0)) (.cse14 (<= .cse11 1)) (.cse16 (not (<= .cse31 .cse11)))) (or (let ((.cse13 (* (- 1) |ULTIMATE.start_main_~q~0#1|))) (let ((.cse17 (* 4294967295 |ULTIMATE.start_main_~r~0#1|)) (.cse23 (* 4294967295 |ULTIMATE.start_main_~q~0#1|)) (.cse10 (mod (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 4294967296)) (.cse19 (+ .cse13 |ULTIMATE.start_main_~p~0#1|))) (and (or .cse0 (let ((.cse4 (< .cse8 0)) (.cse1 (= (mod |ULTIMATE.start_main_~q~0#1| 4) 0)) (.cse5 (* (- 1) .cse9)) (.cse2 (div .cse8 4))) (and (let ((.cse3 (+ (* (div (+ .cse2 |ULTIMATE.start_main_~p~0#1| (- 4294967295)) 4294967296) 4294967296) 4294967296))) (or .cse1 (< (+ .cse2 |ULTIMATE.start_main_~p~0#1| 1) .cse3) (not .cse4) (< (+ .cse2 |ULTIMATE.start_main_~p~0#1| .cse5) .cse3))) (let ((.cse6 (+ .cse2 |ULTIMATE.start_main_~p~0#1|))) (let ((.cse7 (* (div .cse6 4294967296) 4294967296))) (or (< .cse6 .cse7) (and .cse4 (not .cse1)) (< (+ (- 1) .cse2 |ULTIMATE.start_main_~p~0#1| .cse5) .cse7))))))) (>= .cse10 .cse8) (= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~r~0#1|)) (not (<= 4 .cse11)) (<= .cse10 1) .cse12 (= (+ .cse13 |ULTIMATE.start_main_~h~0#1|) 0) .cse14 .cse15 .cse16 (>= .cse11 (mod (+ .cse17 |ULTIMATE.start_main_~n~0#1|) 4294967296)) (= (+ (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~n~0#1|) .cse13) 0) (let ((.cse22 (mod (+ |ULTIMATE.start_main_~h~0#1| .cse23) 4294967296))) (let ((.cse18 (= (mod (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~q~0#1|) 2) 0)) (.cse21 (< .cse22 0)) (.cse20 (div .cse22 2))) (or (and (not .cse18) (= .cse19 (+ .cse20 1)) .cse21) (and (or .cse18 (not .cse21)) (= .cse19 .cse20))))) (let ((.cse27 (mod (+ .cse17 |ULTIMATE.start_main_~n~0#1| .cse23) 4294967296))) (let ((.cse25 (= (mod (+ |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse26 (< .cse27 0)) (.cse24 (div .cse27 2))) (or (and (= .cse19 .cse24) (or .cse25 (not .cse26))) (and (not .cse25) .cse26 (= (+ .cse24 1) .cse19))))) (>= .cse10 0) (= .cse19 0)))) (and .cse28 .cse29 .cse12 .cse30 .cse14 (<= 1 .cse9) (>= .cse9 (mod |ULTIMATE.start_main_~h~0#1| 4294967296)) (<= 1 .cse11) (not .cse0) (= .cse31 |ULTIMATE.start_main_~q~0#1|) .cse32 (not (<= .cse8 .cse9))) (and .cse33 .cse28 .cse29 .cse30 .cse15) (and .cse33 .cse28 (= (+ |ULTIMATE.start_main_~q~0#1| 0) |ULTIMATE.start_main_~h~0#1|) (<= .cse9 1) (>= .cse9 0) .cse12 .cse14 .cse15 .cse16 .cse32)))) [2023-02-18 01:37:58,779 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 01:37:58,779 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 01:37:58,780 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse1 (= |ULTIMATE.start_main_~q~0#1| 1)) (.cse2 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))) (or (and .cse0 .cse1 .cse2) (let ((.cse13 (* (- 1) |ULTIMATE.start_main_~q~0#1|))) (let ((.cse3 (mod |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse4 (mod |ULTIMATE.start_main_~n~0#1| 4294967296)) (.cse14 (* 4294967295 |ULTIMATE.start_main_~r~0#1|)) (.cse20 (* 4294967295 |ULTIMATE.start_main_~q~0#1|)) (.cse12 (mod (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 4294967296)) (.cse16 (+ .cse13 |ULTIMATE.start_main_~p~0#1|))) (and (or (<= .cse3 .cse4) (let ((.cse8 (< .cse3 0)) (.cse5 (= (mod |ULTIMATE.start_main_~q~0#1| 4) 0)) (.cse9 (* (- 1) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (.cse6 (div .cse3 4))) (and (let ((.cse7 (+ (* (div (+ .cse6 |ULTIMATE.start_main_~p~0#1| (- 4294967295)) 4294967296) 4294967296) 4294967296))) (or .cse5 (< (+ .cse6 |ULTIMATE.start_main_~p~0#1| 1) .cse7) (not .cse8) (< (+ .cse6 |ULTIMATE.start_main_~p~0#1| .cse9) .cse7))) (let ((.cse10 (+ .cse6 |ULTIMATE.start_main_~p~0#1|))) (let ((.cse11 (* (div .cse10 4294967296) 4294967296))) (or (< .cse10 .cse11) (and .cse8 (not .cse5)) (< (+ (- 1) .cse6 |ULTIMATE.start_main_~p~0#1| .cse9) .cse11))))))) (>= .cse12 .cse3) (= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~r~0#1|)) (not (<= 4 .cse4)) (<= .cse12 1) (>= .cse4 0) (= (+ .cse13 |ULTIMATE.start_main_~h~0#1|) 0) (<= .cse4 1) .cse1 (not (<= (* 4 1) .cse4)) (>= .cse4 (mod (+ .cse14 |ULTIMATE.start_main_~n~0#1|) 4294967296)) (= (+ (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~n~0#1|) .cse13) 0) (not (<= (* (mod |ULTIMATE.start_main_~q~0#1| 1073741824) 4) .cse4)) (let ((.cse19 (mod (+ |ULTIMATE.start_main_~h~0#1| .cse20) 4294967296))) (let ((.cse15 (= (mod (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~q~0#1|) 2) 0)) (.cse18 (< .cse19 0)) (.cse17 (div .cse19 2))) (or (and (not .cse15) (= .cse16 (+ .cse17 1)) .cse18) (and (or .cse15 (not .cse18)) (= .cse16 .cse17))))) (let ((.cse24 (mod (+ .cse14 |ULTIMATE.start_main_~n~0#1| .cse20) 4294967296))) (let ((.cse22 (= (mod (+ |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse23 (< .cse24 0)) (.cse21 (div .cse24 2))) (or (and (= .cse16 .cse21) (or .cse22 (not .cse23))) (and (not .cse22) .cse23 (= (+ .cse21 1) .cse16))))) (>= .cse12 0) (= .cse16 0)))) (and .cse0 .cse1 .cse2 (let ((.cse30 (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296))) (let ((.cse28 (* .cse30 4294967296)) (.cse27 (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296))) (or (let ((.cse25 (<= .cse30 0))) (and (or (<= |ULTIMATE.start_main_~q~0#1| 4) .cse25) (or (let ((.cse26 (div |ULTIMATE.start_main_~q~0#1| 4294967296))) (let ((.cse29 (<= (+ .cse26 1) 0))) (and (or (<= (+ (* .cse26 4294967296) .cse27) (+ |ULTIMATE.start_main_~r~0#1| (- 4294967296) .cse28)) .cse29) (or (not .cse29) (<= 0 .cse26))))) (not .cse25)))) (<= (+ |ULTIMATE.start_main_~r~0#1| .cse28) (+ (- 1) |ULTIMATE.start_main_~q~0#1| .cse27)))))))) [2023-02-18 01:37:58,780 INFO L899 garLoopResultBuilder]: For program point L24(line 24) no Hoare annotation was computed. [2023-02-18 01:37:58,780 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (let ((.cse31 (* 4 1)) (.cse28 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse15 (= |ULTIMATE.start_main_~q~0#1| 1)) (.cse32 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse8 (mod |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse11 (mod |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse0 (<= .cse8 .cse11)) (.cse29 (= (mod (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~q~0#1|) 4294967296) (mod (+ (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~p~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) 4294967296))) (.cse30 (= |ULTIMATE.start_main_~h~0#1| 0)) (.cse33 (or (let ((.cse47 (div |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse44 (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)) (.cse43 (div |ULTIMATE.start_main_~r~0#1| 4294967296))) (let ((.cse37 (* .cse43 4294967296)) (.cse46 (<= .cse44 0)) (.cse39 (<= (+ .cse47 1) 0)) (.cse35 (* .cse44 4294967296))) (let ((.cse34 (* .cse47 4294967296)) (.cse38 (+ |ULTIMATE.start_main_~r~0#1| (- 4294967296) .cse35)) (.cse45 (not .cse39)) (.cse40 (not .cse46)) (.cse36 (+ (- 1) |ULTIMATE.start_main_~q~0#1| .cse37))) (and (or (<= (+ .cse34 |ULTIMATE.start_main_~r~0#1| .cse35) .cse36) (<= .cse37 .cse38) .cse39 .cse40) .cse28 (or (let ((.cse42 (div |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse41 (<= (+ .cse42 (* (- 1) .cse43) .cse44) 0))) (and (or .cse41 (<= (* .cse42 4294967296) |ULTIMATE.start_main_~r~0#1|) .cse40) (or (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (not .cse41))))) .cse39) .cse15 (or .cse45 (<= |ULTIMATE.start_main_~q~0#1| (+ .cse34 4294967295))) .cse32 (or (and (or (<= |ULTIMATE.start_main_~q~0#1| 4) .cse46) (or (and (or (<= (+ .cse34 .cse37) .cse38) .cse39) (or .cse45 (<= 0 .cse47))) .cse40)) (<= (+ |ULTIMATE.start_main_~r~0#1| .cse35) .cse36)) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))))) (and .cse28 .cse15 .cse32))) (.cse9 (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (.cse12 (>= .cse11 0)) (.cse14 (<= .cse11 1)) (.cse16 (not (<= .cse31 .cse11)))) (or (let ((.cse13 (* (- 1) |ULTIMATE.start_main_~q~0#1|))) (let ((.cse17 (* 4294967295 |ULTIMATE.start_main_~r~0#1|)) (.cse23 (* 4294967295 |ULTIMATE.start_main_~q~0#1|)) (.cse10 (mod (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 4294967296)) (.cse19 (+ .cse13 |ULTIMATE.start_main_~p~0#1|))) (and (or .cse0 (let ((.cse4 (< .cse8 0)) (.cse1 (= (mod |ULTIMATE.start_main_~q~0#1| 4) 0)) (.cse5 (* (- 1) .cse9)) (.cse2 (div .cse8 4))) (and (let ((.cse3 (+ (* (div (+ .cse2 |ULTIMATE.start_main_~p~0#1| (- 4294967295)) 4294967296) 4294967296) 4294967296))) (or .cse1 (< (+ .cse2 |ULTIMATE.start_main_~p~0#1| 1) .cse3) (not .cse4) (< (+ .cse2 |ULTIMATE.start_main_~p~0#1| .cse5) .cse3))) (let ((.cse6 (+ .cse2 |ULTIMATE.start_main_~p~0#1|))) (let ((.cse7 (* (div .cse6 4294967296) 4294967296))) (or (< .cse6 .cse7) (and .cse4 (not .cse1)) (< (+ (- 1) .cse2 |ULTIMATE.start_main_~p~0#1| .cse5) .cse7))))))) (>= .cse10 .cse8) (= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~r~0#1|)) (not (<= 4 .cse11)) (<= .cse10 1) .cse12 (= (+ .cse13 |ULTIMATE.start_main_~h~0#1|) 0) .cse14 .cse15 .cse16 (>= .cse11 (mod (+ .cse17 |ULTIMATE.start_main_~n~0#1|) 4294967296)) (= (+ (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~n~0#1|) .cse13) 0) (let ((.cse22 (mod (+ |ULTIMATE.start_main_~h~0#1| .cse23) 4294967296))) (let ((.cse18 (= (mod (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~q~0#1|) 2) 0)) (.cse21 (< .cse22 0)) (.cse20 (div .cse22 2))) (or (and (not .cse18) (= .cse19 (+ .cse20 1)) .cse21) (and (or .cse18 (not .cse21)) (= .cse19 .cse20))))) (let ((.cse27 (mod (+ .cse17 |ULTIMATE.start_main_~n~0#1| .cse23) 4294967296))) (let ((.cse25 (= (mod (+ |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse26 (< .cse27 0)) (.cse24 (div .cse27 2))) (or (and (= .cse19 .cse24) (or .cse25 (not .cse26))) (and (not .cse25) .cse26 (= (+ .cse24 1) .cse19))))) (>= .cse10 0) (= .cse19 0)))) (and .cse28 .cse29 .cse12 .cse30 .cse14 (<= 1 .cse9) (>= .cse9 (mod |ULTIMATE.start_main_~h~0#1| 4294967296)) (<= 1 .cse11) (not .cse0) (= .cse31 |ULTIMATE.start_main_~q~0#1|) .cse32 (not (<= .cse8 .cse9))) (and .cse33 .cse28 .cse29 .cse30 .cse15) (and .cse33 .cse28 (= (+ |ULTIMATE.start_main_~q~0#1| 0) |ULTIMATE.start_main_~h~0#1|) (<= .cse9 1) (>= .cse9 0) .cse12 .cse14 .cse15 .cse16 .cse32)))) [2023-02-18 01:37:58,780 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 01:37:58,781 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse1 (= |ULTIMATE.start_main_~q~0#1| 1)) (.cse2 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))) (or (and .cse0 .cse1 .cse2) (let ((.cse13 (* (- 1) |ULTIMATE.start_main_~q~0#1|))) (let ((.cse3 (mod |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse4 (mod |ULTIMATE.start_main_~n~0#1| 4294967296)) (.cse14 (* 4294967295 |ULTIMATE.start_main_~r~0#1|)) (.cse20 (* 4294967295 |ULTIMATE.start_main_~q~0#1|)) (.cse12 (mod (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 4294967296)) (.cse16 (+ .cse13 |ULTIMATE.start_main_~p~0#1|))) (and (or (<= .cse3 .cse4) (let ((.cse8 (< .cse3 0)) (.cse5 (= (mod |ULTIMATE.start_main_~q~0#1| 4) 0)) (.cse9 (* (- 1) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (.cse6 (div .cse3 4))) (and (let ((.cse7 (+ (* (div (+ .cse6 |ULTIMATE.start_main_~p~0#1| (- 4294967295)) 4294967296) 4294967296) 4294967296))) (or .cse5 (< (+ .cse6 |ULTIMATE.start_main_~p~0#1| 1) .cse7) (not .cse8) (< (+ .cse6 |ULTIMATE.start_main_~p~0#1| .cse9) .cse7))) (let ((.cse10 (+ .cse6 |ULTIMATE.start_main_~p~0#1|))) (let ((.cse11 (* (div .cse10 4294967296) 4294967296))) (or (< .cse10 .cse11) (and .cse8 (not .cse5)) (< (+ (- 1) .cse6 |ULTIMATE.start_main_~p~0#1| .cse9) .cse11))))))) (>= .cse12 .cse3) (= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~r~0#1|)) (not (<= 4 .cse4)) (<= .cse12 1) (>= .cse4 0) (= (+ .cse13 |ULTIMATE.start_main_~h~0#1|) 0) (<= .cse4 1) .cse1 (not (<= (* 4 1) .cse4)) (>= .cse4 (mod (+ .cse14 |ULTIMATE.start_main_~n~0#1|) 4294967296)) (= (+ (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~n~0#1|) .cse13) 0) (not (<= (* (mod |ULTIMATE.start_main_~q~0#1| 1073741824) 4) .cse4)) (let ((.cse19 (mod (+ |ULTIMATE.start_main_~h~0#1| .cse20) 4294967296))) (let ((.cse15 (= (mod (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~q~0#1|) 2) 0)) (.cse18 (< .cse19 0)) (.cse17 (div .cse19 2))) (or (and (not .cse15) (= .cse16 (+ .cse17 1)) .cse18) (and (or .cse15 (not .cse18)) (= .cse16 .cse17))))) (let ((.cse24 (mod (+ .cse14 |ULTIMATE.start_main_~n~0#1| .cse20) 4294967296))) (let ((.cse22 (= (mod (+ |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse23 (< .cse24 0)) (.cse21 (div .cse24 2))) (or (and (= .cse16 .cse21) (or .cse22 (not .cse23))) (and (not .cse22) .cse23 (= (+ .cse21 1) .cse16))))) (>= .cse12 0) (= .cse16 0)))) (and .cse0 .cse1 .cse2 (let ((.cse30 (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296))) (let ((.cse28 (* .cse30 4294967296)) (.cse27 (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296))) (or (let ((.cse25 (<= .cse30 0))) (and (or (<= |ULTIMATE.start_main_~q~0#1| 4) .cse25) (or (let ((.cse26 (div |ULTIMATE.start_main_~q~0#1| 4294967296))) (let ((.cse29 (<= (+ .cse26 1) 0))) (and (or (<= (+ (* .cse26 4294967296) .cse27) (+ |ULTIMATE.start_main_~r~0#1| (- 4294967296) .cse28)) .cse29) (or (not .cse29) (<= 0 .cse26))))) (not .cse25)))) (<= (+ |ULTIMATE.start_main_~r~0#1| .cse28) (+ (- 1) |ULTIMATE.start_main_~q~0#1| .cse27)))))))) [2023-02-18 01:37:58,781 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (let ((.cse31 (* 4 1)) (.cse28 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse15 (= |ULTIMATE.start_main_~q~0#1| 1)) (.cse32 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse8 (mod |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse11 (mod |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse0 (<= .cse8 .cse11)) (.cse29 (= (mod (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~q~0#1|) 4294967296) (mod (+ (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~p~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) 4294967296))) (.cse30 (= |ULTIMATE.start_main_~h~0#1| 0)) (.cse33 (or (let ((.cse47 (div |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse44 (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)) (.cse43 (div |ULTIMATE.start_main_~r~0#1| 4294967296))) (let ((.cse37 (* .cse43 4294967296)) (.cse46 (<= .cse44 0)) (.cse39 (<= (+ .cse47 1) 0)) (.cse35 (* .cse44 4294967296))) (let ((.cse34 (* .cse47 4294967296)) (.cse38 (+ |ULTIMATE.start_main_~r~0#1| (- 4294967296) .cse35)) (.cse45 (not .cse39)) (.cse40 (not .cse46)) (.cse36 (+ (- 1) |ULTIMATE.start_main_~q~0#1| .cse37))) (and (or (<= (+ .cse34 |ULTIMATE.start_main_~r~0#1| .cse35) .cse36) (<= .cse37 .cse38) .cse39 .cse40) .cse28 (or (let ((.cse42 (div |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse41 (<= (+ .cse42 (* (- 1) .cse43) .cse44) 0))) (and (or .cse41 (<= (* .cse42 4294967296) |ULTIMATE.start_main_~r~0#1|) .cse40) (or (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (not .cse41))))) .cse39) .cse15 (or .cse45 (<= |ULTIMATE.start_main_~q~0#1| (+ .cse34 4294967295))) .cse32 (or (and (or (<= |ULTIMATE.start_main_~q~0#1| 4) .cse46) (or (and (or (<= (+ .cse34 .cse37) .cse38) .cse39) (or .cse45 (<= 0 .cse47))) .cse40)) (<= (+ |ULTIMATE.start_main_~r~0#1| .cse35) .cse36)) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))))) (and .cse28 .cse15 .cse32))) (.cse9 (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (.cse12 (>= .cse11 0)) (.cse14 (<= .cse11 1)) (.cse16 (not (<= .cse31 .cse11)))) (or (let ((.cse13 (* (- 1) |ULTIMATE.start_main_~q~0#1|))) (let ((.cse17 (* 4294967295 |ULTIMATE.start_main_~r~0#1|)) (.cse23 (* 4294967295 |ULTIMATE.start_main_~q~0#1|)) (.cse10 (mod (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 4294967296)) (.cse19 (+ .cse13 |ULTIMATE.start_main_~p~0#1|))) (and (or .cse0 (let ((.cse4 (< .cse8 0)) (.cse1 (= (mod |ULTIMATE.start_main_~q~0#1| 4) 0)) (.cse5 (* (- 1) .cse9)) (.cse2 (div .cse8 4))) (and (let ((.cse3 (+ (* (div (+ .cse2 |ULTIMATE.start_main_~p~0#1| (- 4294967295)) 4294967296) 4294967296) 4294967296))) (or .cse1 (< (+ .cse2 |ULTIMATE.start_main_~p~0#1| 1) .cse3) (not .cse4) (< (+ .cse2 |ULTIMATE.start_main_~p~0#1| .cse5) .cse3))) (let ((.cse6 (+ .cse2 |ULTIMATE.start_main_~p~0#1|))) (let ((.cse7 (* (div .cse6 4294967296) 4294967296))) (or (< .cse6 .cse7) (and .cse4 (not .cse1)) (< (+ (- 1) .cse2 |ULTIMATE.start_main_~p~0#1| .cse5) .cse7))))))) (>= .cse10 .cse8) (= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~r~0#1|)) (not (<= 4 .cse11)) (<= .cse10 1) .cse12 (= (+ .cse13 |ULTIMATE.start_main_~h~0#1|) 0) .cse14 .cse15 .cse16 (>= .cse11 (mod (+ .cse17 |ULTIMATE.start_main_~n~0#1|) 4294967296)) (= (+ (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~n~0#1|) .cse13) 0) (let ((.cse22 (mod (+ |ULTIMATE.start_main_~h~0#1| .cse23) 4294967296))) (let ((.cse18 (= (mod (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~q~0#1|) 2) 0)) (.cse21 (< .cse22 0)) (.cse20 (div .cse22 2))) (or (and (not .cse18) (= .cse19 (+ .cse20 1)) .cse21) (and (or .cse18 (not .cse21)) (= .cse19 .cse20))))) (let ((.cse27 (mod (+ .cse17 |ULTIMATE.start_main_~n~0#1| .cse23) 4294967296))) (let ((.cse25 (= (mod (+ |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse26 (< .cse27 0)) (.cse24 (div .cse27 2))) (or (and (= .cse19 .cse24) (or .cse25 (not .cse26))) (and (not .cse25) .cse26 (= (+ .cse24 1) .cse19))))) (>= .cse10 0) (= .cse19 0)))) (and .cse28 .cse29 .cse12 .cse30 .cse14 (<= 1 .cse9) (>= .cse9 (mod |ULTIMATE.start_main_~h~0#1| 4294967296)) (<= 1 .cse11) (not .cse0) (= .cse31 |ULTIMATE.start_main_~q~0#1|) .cse32 (not (<= .cse8 .cse9))) (and .cse33 .cse28 .cse29 .cse30 .cse15) (and .cse33 .cse28 (= (+ |ULTIMATE.start_main_~q~0#1| 0) |ULTIMATE.start_main_~h~0#1|) (<= .cse9 1) (>= .cse9 0) .cse12 .cse14 .cse15 .cse16 .cse32)))) [2023-02-18 01:37:58,781 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 01:37:58,781 INFO L895 garLoopResultBuilder]: At program point L38-1(lines 38 56) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse1 (= |ULTIMATE.start_main_~q~0#1| 1)) (.cse30 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse4 (mod |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse12 (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (.cse14 (>= .cse4 0)) (.cse16 (<= .cse4 1)) (.cse17 (not (<= (* 4 1) .cse4))) (.cse19 (not (<= (* (mod |ULTIMATE.start_main_~q~0#1| 1073741824) 4) .cse4))) (.cse2 (or (and .cse0 .cse1 .cse30) (and .cse0 .cse1 .cse30 (let ((.cse36 (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296))) (let ((.cse34 (* .cse36 4294967296)) (.cse33 (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296))) (or (let ((.cse31 (<= .cse36 0))) (and (or (<= |ULTIMATE.start_main_~q~0#1| 4) .cse31) (or (let ((.cse32 (div |ULTIMATE.start_main_~q~0#1| 4294967296))) (let ((.cse35 (<= (+ .cse32 1) 0))) (and (or (<= (+ (* .cse32 4294967296) .cse33) (+ |ULTIMATE.start_main_~r~0#1| (- 4294967296) .cse34)) .cse35) (or (not .cse35) (<= 0 .cse32))))) (not .cse31)))) (<= (+ |ULTIMATE.start_main_~r~0#1| .cse34) (+ (- 1) |ULTIMATE.start_main_~q~0#1| .cse33))))))))) (or (and .cse0 (= (mod (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~q~0#1|) 4294967296) (mod (+ (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~p~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) 4294967296)) (= |ULTIMATE.start_main_~h~0#1| 0) .cse1 .cse2) (let ((.cse15 (* (- 1) |ULTIMATE.start_main_~q~0#1|))) (let ((.cse3 (mod |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse18 (* 4294967295 |ULTIMATE.start_main_~r~0#1|)) (.cse25 (* 4294967295 |ULTIMATE.start_main_~q~0#1|)) (.cse13 (mod (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 4294967296)) (.cse21 (+ .cse15 |ULTIMATE.start_main_~p~0#1|))) (and (or (<= .cse3 .cse4) (let ((.cse8 (< .cse3 0)) (.cse5 (= (mod |ULTIMATE.start_main_~q~0#1| 4) 0)) (.cse9 (* (- 1) .cse12)) (.cse6 (div .cse3 4))) (and (let ((.cse7 (+ (* (div (+ .cse6 |ULTIMATE.start_main_~p~0#1| (- 4294967295)) 4294967296) 4294967296) 4294967296))) (or .cse5 (< (+ .cse6 |ULTIMATE.start_main_~p~0#1| 1) .cse7) (not .cse8) (< (+ .cse6 |ULTIMATE.start_main_~p~0#1| .cse9) .cse7))) (let ((.cse10 (+ .cse6 |ULTIMATE.start_main_~p~0#1|))) (let ((.cse11 (* (div .cse10 4294967296) 4294967296))) (or (< .cse10 .cse11) (and .cse8 (not .cse5)) (< (+ (- 1) .cse6 |ULTIMATE.start_main_~p~0#1| .cse9) .cse11))))))) (>= .cse13 .cse3) (= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~r~0#1|)) (not (<= 4 .cse4)) (<= .cse13 1) .cse14 (= (+ .cse15 |ULTIMATE.start_main_~h~0#1|) 0) .cse16 .cse1 .cse17 (>= .cse4 (mod (+ .cse18 |ULTIMATE.start_main_~n~0#1|) 4294967296)) (= (+ (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~n~0#1|) .cse15) 0) .cse19 (let ((.cse24 (mod (+ |ULTIMATE.start_main_~h~0#1| .cse25) 4294967296))) (let ((.cse20 (= (mod (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~q~0#1|) 2) 0)) (.cse23 (< .cse24 0)) (.cse22 (div .cse24 2))) (or (and (not .cse20) (= .cse21 (+ .cse22 1)) .cse23) (and (or .cse20 (not .cse23)) (= .cse21 .cse22))))) (let ((.cse29 (mod (+ .cse18 |ULTIMATE.start_main_~n~0#1| .cse25) 4294967296))) (let ((.cse27 (= (mod (+ |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse28 (< .cse29 0)) (.cse26 (div .cse29 2))) (or (and (= .cse21 .cse26) (or .cse27 (not .cse28))) (and (not .cse27) .cse28 (= (+ .cse26 1) .cse21))))) (>= .cse13 0) (= .cse21 0)))) (and .cse0 (= (+ |ULTIMATE.start_main_~q~0#1| 0) |ULTIMATE.start_main_~h~0#1|) (<= .cse12 1) (>= .cse12 0) .cse14 .cse16 .cse1 .cse17 .cse19 .cse30 .cse2)))) [2023-02-18 01:37:58,782 INFO L895 garLoopResultBuilder]: At program point L30-2(lines 30 35) the Hoare annotation is: (let ((.cse5 (mod |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse0 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse1 (>= .cse5 0)) (.cse2 (= |ULTIMATE.start_main_~h~0#1| 0)) (.cse3 (<= .cse5 1)) (.cse4 (>= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~h~0#1| 4294967296))) (.cse6 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 .cse5) (= (* 4 1) |ULTIMATE.start_main_~q~0#1|) .cse6) (and .cse0 (= (mod (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~q~0#1|) 4294967296) (mod (+ (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~p~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) 4294967296)) (or (let ((.cse8 (div |ULTIMATE.start_main_~n~0#1| 4294967296)) (.cse9 (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296))) (let ((.cse7 (<= (+ .cse8 (* (- 1) (div |ULTIMATE.start_main_~r~0#1| 4294967296)) .cse9) 0))) (and (or .cse7 (<= (* .cse8 4294967296) |ULTIMATE.start_main_~r~0#1|) (not (<= .cse9 0))) (or (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (not .cse7))))) (<= (+ (div |ULTIMATE.start_main_~q~0#1| 4294967296) 1) 0)) .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~q~0#1| 1) .cse6 (let ((.cse13 (mod |ULTIMATE.start_main_~q~0#1| 1073741824))) (let ((.cse10 (* .cse13 4))) (or (<= .cse10 .cse5) (let ((.cse25 (mod |ULTIMATE.start_main_~p~0#1| 4294967296))) (let ((.cse26 (div .cse25 2))) (let ((.cse12 (* .cse13 |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~p~0#1| 4294967287)) (.cse14 (* .cse13 .cse13 |ULTIMATE.start_main_~n~0#1| 4)) (.cse15 (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~p~0#1|)) (.cse16 (* .cse13 |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~r~0#1| 12)) (.cse17 (* .cse13 16 |ULTIMATE.start_main_~n~0#1| .cse26)) (.cse18 (* 4294967290 .cse13 .cse13 |ULTIMATE.start_main_~p~0#1|)) (.cse19 (* .cse13 16 |ULTIMATE.start_main_~p~0#1| .cse26)) (.cse20 (* .cse13 .cse13 12 .cse26)) (.cse21 (* .cse13 |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~p~0#1| 4294967284)) (.cse22 (* 4294967292 .cse13 .cse13 |ULTIMATE.start_main_~r~0#1|)) (.cse23 (* .cse13 |ULTIMATE.start_main_~r~0#1| .cse26 4294967280)) (.cse24 (< .cse25 0)) (.cse11 (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or .cse11 (= (mod (+ .cse12 (* .cse13 16 |ULTIMATE.start_main_~p~0#1|) .cse14 .cse15 (* .cse13 16 |ULTIMATE.start_main_~n~0#1|) .cse16 .cse17 (* .cse13 .cse13 12) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (* .cse13 |ULTIMATE.start_main_~r~0#1| 4294967280)) 4294967296) 0) (not .cse24)) (or (= (mod (+ .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) 4294967296) 0) (and .cse24 (not .cse11))))))) (= .cse10 1)))) (= (mod (+ (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1| 4294967280) (* 4294967292 |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~q~0#1|) (* |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~h~0#1|) (* 16 |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|) (* 4294967295 |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~q~0#1|) (* |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~q~0#1| 4294967284) (* |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1| 12)) 4294967296) 0) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))))) [2023-02-18 01:37:58,782 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2023-02-18 01:37:58,782 INFO L895 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (let ((.cse8 (mod |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse33 (* 4 1)) (.cse11 (mod |ULTIMATE.start_main_~n~0#1| 4294967296)) (.cse29 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse15 (= |ULTIMATE.start_main_~q~0#1| 1)) (.cse32 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))) (let ((.cse28 (or (let ((.cse47 (div |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse44 (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)) (.cse43 (div |ULTIMATE.start_main_~r~0#1| 4294967296))) (let ((.cse37 (* .cse43 4294967296)) (.cse46 (<= .cse44 0)) (.cse39 (<= (+ .cse47 1) 0)) (.cse35 (* .cse44 4294967296))) (let ((.cse34 (* .cse47 4294967296)) (.cse38 (+ |ULTIMATE.start_main_~r~0#1| (- 4294967296) .cse35)) (.cse45 (not .cse39)) (.cse40 (not .cse46)) (.cse36 (+ (- 1) |ULTIMATE.start_main_~q~0#1| .cse37))) (and (or (<= (+ .cse34 |ULTIMATE.start_main_~r~0#1| .cse35) .cse36) (<= .cse37 .cse38) .cse39 .cse40) .cse29 (or (let ((.cse42 (div |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse41 (<= (+ .cse42 (* (- 1) .cse43) .cse44) 0))) (and (or .cse41 (<= (* .cse42 4294967296) |ULTIMATE.start_main_~r~0#1|) .cse40) (or (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (not .cse41))))) .cse39) .cse15 (or .cse45 (<= |ULTIMATE.start_main_~q~0#1| (+ .cse34 4294967295))) .cse32 (or (and (or (<= |ULTIMATE.start_main_~q~0#1| 4) .cse46) (or (and (or (<= (+ .cse34 .cse37) .cse38) .cse39) (or .cse45 (<= 0 .cse47))) .cse40)) (<= (+ |ULTIMATE.start_main_~r~0#1| .cse35) .cse36)) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))))) (and .cse29 .cse15 .cse32))) (.cse30 (= (mod (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~q~0#1|) 4294967296) (mod (+ (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~p~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) 4294967296))) (.cse12 (>= .cse11 0)) (.cse31 (= |ULTIMATE.start_main_~h~0#1| 0)) (.cse14 (<= .cse11 1)) (.cse16 (not (<= .cse33 .cse11))) (.cse0 (<= .cse8 .cse11)) (.cse9 (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (or (let ((.cse13 (* (- 1) |ULTIMATE.start_main_~q~0#1|))) (let ((.cse17 (* 4294967295 |ULTIMATE.start_main_~r~0#1|)) (.cse23 (* 4294967295 |ULTIMATE.start_main_~q~0#1|)) (.cse10 (mod (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 4294967296)) (.cse19 (+ .cse13 |ULTIMATE.start_main_~p~0#1|))) (and (or .cse0 (let ((.cse4 (< .cse8 0)) (.cse1 (= (mod |ULTIMATE.start_main_~q~0#1| 4) 0)) (.cse5 (* (- 1) .cse9)) (.cse2 (div .cse8 4))) (and (let ((.cse3 (+ (* (div (+ .cse2 |ULTIMATE.start_main_~p~0#1| (- 4294967295)) 4294967296) 4294967296) 4294967296))) (or .cse1 (< (+ .cse2 |ULTIMATE.start_main_~p~0#1| 1) .cse3) (not .cse4) (< (+ .cse2 |ULTIMATE.start_main_~p~0#1| .cse5) .cse3))) (let ((.cse6 (+ .cse2 |ULTIMATE.start_main_~p~0#1|))) (let ((.cse7 (* (div .cse6 4294967296) 4294967296))) (or (< .cse6 .cse7) (and .cse4 (not .cse1)) (< (+ (- 1) .cse2 |ULTIMATE.start_main_~p~0#1| .cse5) .cse7))))))) (>= .cse10 .cse8) (= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~r~0#1|)) (not (<= 4 .cse11)) (<= .cse10 1) .cse12 (= (+ .cse13 |ULTIMATE.start_main_~h~0#1|) 0) .cse14 .cse15 .cse16 (>= .cse11 (mod (+ .cse17 |ULTIMATE.start_main_~n~0#1|) 4294967296)) (= (+ (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~n~0#1|) .cse13) 0) (let ((.cse22 (mod (+ |ULTIMATE.start_main_~h~0#1| .cse23) 4294967296))) (let ((.cse18 (= (mod (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~q~0#1|) 2) 0)) (.cse21 (< .cse22 0)) (.cse20 (div .cse22 2))) (or (and (not .cse18) (= .cse19 (+ .cse20 1)) .cse21) (and (or .cse18 (not .cse21)) (= .cse19 .cse20))))) (let ((.cse27 (mod (+ .cse17 |ULTIMATE.start_main_~n~0#1| .cse23) 4294967296))) (let ((.cse25 (= (mod (+ |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse26 (< .cse27 0)) (.cse24 (div .cse27 2))) (or (and (= .cse19 .cse24) (or .cse25 (not .cse26))) (and (not .cse25) .cse26 (= (+ .cse24 1) .cse19))))) (>= .cse10 0) (= .cse19 0)))) (and .cse28 .cse29 .cse30 .cse31 .cse15) (and .cse28 .cse29 (= (+ |ULTIMATE.start_main_~q~0#1| 0) |ULTIMATE.start_main_~h~0#1|) (<= .cse9 1) (>= .cse9 0) .cse12 .cse14 .cse15 .cse16 .cse32) (and .cse29 .cse30 .cse12 .cse31 .cse14 (<= 1 .cse9) (>= .cse9 (mod |ULTIMATE.start_main_~h~0#1| 4294967296)) .cse16 (<= 1 .cse11) (not .cse0) (= .cse33 |ULTIMATE.start_main_~q~0#1|) (not (<= (* (mod |ULTIMATE.start_main_~q~0#1| 1073741824) 4) .cse11)) .cse32 (not (<= .cse8 .cse9)))))) [2023-02-18 01:37:58,782 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse8 (mod |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse11 (mod |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse15 (= |ULTIMATE.start_main_~q~0#1| 1)) (.cse35 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse12 (>= .cse11 0)) (.cse40 (= |ULTIMATE.start_main_~h~0#1| 0)) (.cse14 (<= .cse11 1)) (.cse0 (<= .cse8 .cse11)) (.cse16 (* 4 1)) (.cse42 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse9 (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (or (let ((.cse13 (* (- 1) |ULTIMATE.start_main_~q~0#1|))) (let ((.cse17 (* 4294967295 |ULTIMATE.start_main_~r~0#1|)) (.cse23 (* 4294967295 |ULTIMATE.start_main_~q~0#1|)) (.cse10 (mod (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 4294967296)) (.cse19 (+ .cse13 |ULTIMATE.start_main_~p~0#1|))) (and (or .cse0 (let ((.cse4 (< .cse8 0)) (.cse1 (= (mod |ULTIMATE.start_main_~q~0#1| 4) 0)) (.cse5 (* (- 1) .cse9)) (.cse2 (div .cse8 4))) (and (let ((.cse3 (+ (* (div (+ .cse2 |ULTIMATE.start_main_~p~0#1| (- 4294967295)) 4294967296) 4294967296) 4294967296))) (or .cse1 (< (+ .cse2 |ULTIMATE.start_main_~p~0#1| 1) .cse3) (not .cse4) (< (+ .cse2 |ULTIMATE.start_main_~p~0#1| .cse5) .cse3))) (let ((.cse6 (+ .cse2 |ULTIMATE.start_main_~p~0#1|))) (let ((.cse7 (* (div .cse6 4294967296) 4294967296))) (or (< .cse6 .cse7) (and .cse4 (not .cse1)) (< (+ (- 1) .cse2 |ULTIMATE.start_main_~p~0#1| .cse5) .cse7))))))) (>= .cse10 .cse8) (= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~r~0#1|)) (not (<= 4 .cse11)) (<= .cse10 1) .cse12 (= (+ .cse13 |ULTIMATE.start_main_~h~0#1|) 0) .cse14 .cse15 (not (<= .cse16 .cse11)) (>= .cse11 (mod (+ .cse17 |ULTIMATE.start_main_~n~0#1|) 4294967296)) (= (+ (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~n~0#1|) .cse13) 0) (let ((.cse22 (mod (+ |ULTIMATE.start_main_~h~0#1| .cse23) 4294967296))) (let ((.cse18 (= (mod (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~q~0#1|) 2) 0)) (.cse21 (< .cse22 0)) (.cse20 (div .cse22 2))) (or (and (not .cse18) (= .cse19 (+ .cse20 1)) .cse21) (and (or .cse18 (not .cse21)) (= .cse19 .cse20))))) (let ((.cse27 (mod (+ .cse17 |ULTIMATE.start_main_~n~0#1| .cse23) 4294967296))) (let ((.cse25 (= (mod (+ |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse26 (< .cse27 0)) (.cse24 (div .cse27 2))) (or (and (= .cse19 .cse24) (or .cse25 (not .cse26))) (and (not .cse25) .cse26 (= (+ .cse24 1) .cse19))))) (>= .cse10 0) (= .cse19 0)))) (let ((.cse44 (div |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse39 (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)) (.cse38 (div |ULTIMATE.start_main_~r~0#1| 4294967296))) (let ((.cse31 (* .cse38 4294967296)) (.cse43 (<= .cse39 0)) (.cse33 (<= (+ .cse44 1) 0)) (.cse29 (* .cse39 4294967296))) (let ((.cse28 (* .cse44 4294967296)) (.cse32 (+ |ULTIMATE.start_main_~r~0#1| (- 4294967296) .cse29)) (.cse41 (not .cse33)) (.cse34 (not .cse43)) (.cse30 (+ (- 1) |ULTIMATE.start_main_~q~0#1| .cse31))) (and (or (<= (+ .cse28 |ULTIMATE.start_main_~r~0#1| .cse29) .cse30) (<= .cse31 .cse32) .cse33 .cse34) .cse35 (= (mod (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~q~0#1|) 4294967296) (mod (+ (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~p~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) 4294967296)) (or (let ((.cse37 (div |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse36 (<= (+ .cse37 (* (- 1) .cse38) .cse39) 0))) (and (or .cse36 (<= (* .cse37 4294967296) |ULTIMATE.start_main_~r~0#1|) .cse34) (or (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (not .cse36))))) .cse33) .cse40 .cse15 (or .cse41 (<= |ULTIMATE.start_main_~q~0#1| (+ .cse28 4294967295))) .cse42 (or (and (or (<= |ULTIMATE.start_main_~q~0#1| 4) .cse43) (or (and (or (<= (+ .cse28 .cse31) .cse32) .cse33) (or .cse41 (<= 0 .cse44))) .cse34)) (<= (+ |ULTIMATE.start_main_~r~0#1| .cse29) .cse30)) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))))) (and .cse35 .cse12 .cse40 .cse14 (<= 1 .cse9) (>= .cse9 (mod |ULTIMATE.start_main_~h~0#1| 4294967296)) (<= 1 .cse11) (not .cse0) (= .cse16 |ULTIMATE.start_main_~q~0#1|) .cse42 (not (<= .cse8 .cse9)))))) [2023-02-18 01:37:58,783 INFO L895 garLoopResultBuilder]: At program point L39-1(line 39) the Hoare annotation is: (let ((.cse8 (mod |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse32 (* 4 1)) (.cse11 (mod |ULTIMATE.start_main_~n~0#1| 4294967296)) (.cse29 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse15 (= |ULTIMATE.start_main_~q~0#1| 1)) (.cse31 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))) (let ((.cse28 (or (let ((.cse46 (div |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse43 (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)) (.cse42 (div |ULTIMATE.start_main_~r~0#1| 4294967296))) (let ((.cse36 (* .cse42 4294967296)) (.cse45 (<= .cse43 0)) (.cse38 (<= (+ .cse46 1) 0)) (.cse34 (* .cse43 4294967296))) (let ((.cse33 (* .cse46 4294967296)) (.cse37 (+ |ULTIMATE.start_main_~r~0#1| (- 4294967296) .cse34)) (.cse44 (not .cse38)) (.cse39 (not .cse45)) (.cse35 (+ (- 1) |ULTIMATE.start_main_~q~0#1| .cse36))) (and (or (<= (+ .cse33 |ULTIMATE.start_main_~r~0#1| .cse34) .cse35) (<= .cse36 .cse37) .cse38 .cse39) .cse29 (or (let ((.cse41 (div |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse40 (<= (+ .cse41 (* (- 1) .cse42) .cse43) 0))) (and (or .cse40 (<= (* .cse41 4294967296) |ULTIMATE.start_main_~r~0#1|) .cse39) (or (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (not .cse40))))) .cse38) .cse15 (or .cse44 (<= |ULTIMATE.start_main_~q~0#1| (+ .cse33 4294967295))) .cse31 (or (and (or (<= |ULTIMATE.start_main_~q~0#1| 4) .cse45) (or (and (or (<= (+ .cse33 .cse36) .cse37) .cse38) (or .cse44 (<= 0 .cse46))) .cse39)) (<= (+ |ULTIMATE.start_main_~r~0#1| .cse34) .cse35)) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))))) (and .cse29 .cse15 .cse31))) (.cse16 (not (<= .cse32 .cse11))) (.cse12 (>= .cse11 0)) (.cse30 (= |ULTIMATE.start_main_~h~0#1| 0)) (.cse14 (<= .cse11 1)) (.cse0 (<= .cse8 .cse11)) (.cse9 (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (or (let ((.cse13 (* (- 1) |ULTIMATE.start_main_~q~0#1|))) (let ((.cse17 (* 4294967295 |ULTIMATE.start_main_~r~0#1|)) (.cse23 (* 4294967295 |ULTIMATE.start_main_~q~0#1|)) (.cse10 (mod (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 4294967296)) (.cse19 (+ .cse13 |ULTIMATE.start_main_~p~0#1|))) (and (or .cse0 (let ((.cse4 (< .cse8 0)) (.cse1 (= (mod |ULTIMATE.start_main_~q~0#1| 4) 0)) (.cse5 (* (- 1) .cse9)) (.cse2 (div .cse8 4))) (and (let ((.cse3 (+ (* (div (+ .cse2 |ULTIMATE.start_main_~p~0#1| (- 4294967295)) 4294967296) 4294967296) 4294967296))) (or .cse1 (< (+ .cse2 |ULTIMATE.start_main_~p~0#1| 1) .cse3) (not .cse4) (< (+ .cse2 |ULTIMATE.start_main_~p~0#1| .cse5) .cse3))) (let ((.cse6 (+ .cse2 |ULTIMATE.start_main_~p~0#1|))) (let ((.cse7 (* (div .cse6 4294967296) 4294967296))) (or (< .cse6 .cse7) (and .cse4 (not .cse1)) (< (+ (- 1) .cse2 |ULTIMATE.start_main_~p~0#1| .cse5) .cse7))))))) (>= .cse10 .cse8) (= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~r~0#1|)) (not (<= 4 .cse11)) (<= .cse10 1) .cse12 (= (+ .cse13 |ULTIMATE.start_main_~h~0#1|) 0) .cse14 .cse15 .cse16 (>= .cse11 (mod (+ .cse17 |ULTIMATE.start_main_~n~0#1|) 4294967296)) (= (+ (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~n~0#1|) .cse13) 0) (let ((.cse22 (mod (+ |ULTIMATE.start_main_~h~0#1| .cse23) 4294967296))) (let ((.cse18 (= (mod (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~q~0#1|) 2) 0)) (.cse21 (< .cse22 0)) (.cse20 (div .cse22 2))) (or (and (not .cse18) (= .cse19 (+ .cse20 1)) .cse21) (and (or .cse18 (not .cse21)) (= .cse19 .cse20))))) (let ((.cse27 (mod (+ .cse17 |ULTIMATE.start_main_~n~0#1| .cse23) 4294967296))) (let ((.cse25 (= (mod (+ |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse26 (< .cse27 0)) (.cse24 (div .cse27 2))) (or (and (= .cse19 .cse24) (or .cse25 (not .cse26))) (and (not .cse25) .cse26 (= (+ .cse24 1) .cse19))))) (>= .cse10 0) (= .cse19 0)))) (and .cse28 .cse29 (= (mod (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~q~0#1|) 4294967296) (mod (+ (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~p~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) 4294967296)) .cse30 .cse15) (and .cse28 .cse29 (= (+ |ULTIMATE.start_main_~q~0#1| 0) |ULTIMATE.start_main_~h~0#1|) (<= .cse9 1) (>= .cse9 0) .cse12 .cse14 .cse15 .cse16 .cse31) (and .cse29 .cse12 .cse30 .cse14 (<= 1 .cse9) (>= .cse9 (mod |ULTIMATE.start_main_~h~0#1| 4294967296)) (<= 1 .cse11) (not .cse0) (= .cse32 |ULTIMATE.start_main_~q~0#1|) .cse31 (not (<= .cse8 .cse9)))))) [2023-02-18 01:37:58,783 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 8 10) the Hoare annotation is: true [2023-02-18 01:37:58,783 INFO L899 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2023-02-18 01:37:58,783 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2023-02-18 01:37:58,783 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2023-02-18 01:37:58,783 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2023-02-18 01:37:58,783 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2023-02-18 01:37:58,783 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2023-02-18 01:37:58,783 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2023-02-18 01:37:58,783 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 11 17) the Hoare annotation is: true [2023-02-18 01:37:58,783 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2023-02-18 01:37:58,785 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:37:58,787 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 01:37:58,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 01:37:58 BoogieIcfgContainer [2023-02-18 01:37:58,811 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 01:37:58,812 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 01:37:58,812 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 01:37:58,812 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 01:37:58,812 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:25:45" (3/4) ... [2023-02-18 01:37:58,822 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 01:37:58,826 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-02-18 01:37:58,827 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-18 01:37:58,829 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-02-18 01:37:58,829 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 01:37:58,829 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 01:37:58,830 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 01:37:58,855 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 01:37:58,855 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 01:37:58,855 INFO L158 Benchmark]: Toolchain (without parser) took 733497.31ms. Allocated memory was 115.3MB in the beginning and 736.1MB in the end (delta: 620.8MB). Free memory was 73.1MB in the beginning and 520.5MB in the end (delta: -447.4MB). Peak memory consumption was 173.7MB. Max. memory is 16.1GB. [2023-02-18 01:37:58,856 INFO L158 Benchmark]: CDTParser took 0.73ms. Allocated memory is still 115.3MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 01:37:58,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.48ms. Allocated memory is still 115.3MB. Free memory was 72.7MB in the beginning and 61.5MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 01:37:58,856 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.92ms. Allocated memory is still 115.3MB. Free memory was 61.5MB in the beginning and 59.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 01:37:58,856 INFO L158 Benchmark]: Boogie Preprocessor took 41.10ms. Allocated memory is still 115.3MB. Free memory was 59.8MB in the beginning and 58.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 01:37:58,857 INFO L158 Benchmark]: RCFGBuilder took 301.18ms. Allocated memory is still 115.3MB. Free memory was 58.4MB in the beginning and 88.6MB in the end (delta: -30.2MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2023-02-18 01:37:58,857 INFO L158 Benchmark]: TraceAbstraction took 732858.94ms. Allocated memory was 115.3MB in the beginning and 736.1MB in the end (delta: 620.8MB). Free memory was 88.1MB in the beginning and 523.7MB in the end (delta: -435.6MB). Peak memory consumption was 185.3MB. Max. memory is 16.1GB. [2023-02-18 01:37:58,857 INFO L158 Benchmark]: Witness Printer took 43.40ms. Allocated memory is still 736.1MB. Free memory was 523.7MB in the beginning and 520.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 01:37:58,858 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.73ms. Allocated memory is still 115.3MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.48ms. Allocated memory is still 115.3MB. Free memory was 72.7MB in the beginning and 61.5MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.92ms. Allocated memory is still 115.3MB. Free memory was 61.5MB in the beginning and 59.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.10ms. Allocated memory is still 115.3MB. Free memory was 59.8MB in the beginning and 58.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 301.18ms. Allocated memory is still 115.3MB. Free memory was 58.4MB in the beginning and 88.6MB in the end (delta: -30.2MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * TraceAbstraction took 732858.94ms. Allocated memory was 115.3MB in the beginning and 736.1MB in the end (delta: 620.8MB). Free memory was 88.1MB in the beginning and 523.7MB in the end (delta: -435.6MB). Peak memory consumption was 185.3MB. Max. memory is 16.1GB. * Witness Printer took 43.40ms. Allocated memory is still 736.1MB. Free memory was 523.7MB in the beginning and 520.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: 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 3 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 732.8s, OverallIterations: 10, TraceHistogramMax: 9, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 337.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 102 mSolverCounterUnknown, 228 SdHoareTripleChecker+Valid, 324.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 170 mSDsluCounter, 1376 SdHoareTripleChecker+Invalid, 323.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 105 IncrementalHoareTripleChecker+Unchecked, 984 mSDsCounter, 354 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2172 IncrementalHoareTripleChecker+Invalid, 2733 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 354 mSolverCounterUnsat, 392 mSDtfsCounter, 2172 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 659 GetRequests, 523 SyntacticMatches, 6 SemanticMatches, 130 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 80.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=3, InterpolantAutomatonStates: 92, 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, 48 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 96 PreInvPairs, 135 NumberOfFragments, 8827 HoareAnnotationTreeSize, 96 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 392.5s InterpolantComputationTime, 428 NumberOfCodeBlocks, 398 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 624 ConstructedInterpolants, 2 QuantifiedInterpolants, 20175 SizeOfPredicates, 32 NumberOfNonLiveVariables, 889 ConjunctsInSsa, 173 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 710/806 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: 30]: Loop Invariant Derived loop invariant: (((((((p == 0 && n % 4294967296 >= 0) && h == 0) && n % 4294967296 <= 1) && r % 4294967296 >= h % 4294967296) && 1 <= n % 4294967296) && 4 * 1 == q) && n == r) || (((((((((((p == 0 && n * q % 4294967296 == (p * p + q * r) % 4294967296) && ((((n / 4294967296 + -1 * (r / 4294967296) + (q + 2 * p) / 4294967296 <= 0 || n / 4294967296 * 4294967296 <= r) || !((q + 2 * p) / 4294967296 <= 0)) && (r <= n || !(n / 4294967296 + -1 * (r / 4294967296) + (q + 2 * p) / 4294967296 <= 0))) || q / 4294967296 + 1 <= 0)) && n % 4294967296 >= 0) && h == 0) && n % 4294967296 <= 1) && r % 4294967296 >= h % 4294967296) && q == 1) && n == r) && ((q % 1073741824 * 4 <= n % 4294967296 || (((p % 2 == 0 || (q % 1073741824 * p * p * 4294967287 + q % 1073741824 * 16 * p + q % 1073741824 * (q % 1073741824) * n * 4 + p * p * p + q % 1073741824 * 16 * n + q % 1073741824 * p * r * 12 + q % 1073741824 * 16 * n * (p % 4294967296 / 2) + q % 1073741824 * (q % 1073741824) * 12 + 4294967290 * (q % 1073741824) * (q % 1073741824) * p + q % 1073741824 * 16 * p * (p % 4294967296 / 2) + q % 1073741824 * (q % 1073741824) * 12 * (p % 4294967296 / 2) + q % 1073741824 * n * p * 4294967284 + 4294967292 * (q % 1073741824) * (q % 1073741824) * r + q % 1073741824 * r * (p % 4294967296 / 2) * 4294967280 + q % 1073741824 * r * 4294967280) % 4294967296 == 0) || !(p % 4294967296 < 0)) && ((q % 1073741824 * p * p * 4294967287 + q % 1073741824 * (q % 1073741824) * n * 4 + p * p * p + q % 1073741824 * p * r * 12 + q % 1073741824 * 16 * n * (p % 4294967296 / 2) + 4294967290 * (q % 1073741824) * (q % 1073741824) * p + q % 1073741824 * 16 * p * (p % 4294967296 / 2) + q % 1073741824 * (q % 1073741824) * 12 * (p % 4294967296 / 2) + q % 1073741824 * n * p * 4294967284 + 4294967292 * (q % 1073741824) * (q % 1073741824) * r + q % 1073741824 * r * (p % 4294967296 / 2) * 4294967280) % 4294967296 == 0 || (p % 4294967296 < 0 && !(p % 2 == 0))))) || q % 1073741824 * 4 == 1)) && (p * q * r * 4294967280 + 4294967292 * p * q * q + h * h * h + 16 * n * p * q + 4294967295 * h * q * q + h * n * q * 4294967284 + h * q * r * 12) % 4294967296 == 0) && -1 + q == 0) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((((((((((((((((q % 4294967296 <= n % 4294967296 || ((((q % 4 == 0 || q % 4294967296 / 4 + p + 1 < (q % 4294967296 / 4 + p + -4294967295) / 4294967296 * 4294967296 + 4294967296) || !(q % 4294967296 < 0)) || q % 4294967296 / 4 + p + -1 * (r % 4294967296) < (q % 4294967296 / 4 + p + -4294967295) / 4294967296 * 4294967296 + 4294967296) && ((q % 4294967296 / 4 + p < (q % 4294967296 / 4 + p) / 4294967296 * 4294967296 || (q % 4294967296 < 0 && !(q % 4 == 0))) || -1 + q % 4294967296 / 4 + p + -1 * (r % 4294967296) < (q % 4294967296 / 4 + p) / 4294967296 * 4294967296))) && (q + r) % 4294967296 >= q % 4294967296) && n == h + r) && !(4 <= n % 4294967296)) && (q + r) % 4294967296 <= 1) && n % 4294967296 >= 0) && -1 * q + h == 0) && n % 4294967296 <= 1) && q == 1) && !(4 * 1 <= n % 4294967296)) && n % 4294967296 >= (4294967295 * r + n) % 4294967296) && -1 * r + n + -1 * q == 0) && (((!((h + q) % 2 == 0) && -1 * q + p == (h + 4294967295 * q) % 4294967296 / 2 + 1) && (h + 4294967295 * q) % 4294967296 < 0) || (((h + q) % 2 == 0 || !((h + 4294967295 * q) % 4294967296 < 0)) && -1 * q + p == (h + 4294967295 * q) % 4294967296 / 2))) && ((-1 * q + p == (4294967295 * r + n + 4294967295 * q) % 4294967296 / 2 && ((n + q + r) % 2 == 0 || !((4294967295 * r + n + 4294967295 * q) % 4294967296 < 0))) || ((!((n + q + r) % 2 == 0) && (4294967295 * r + n + 4294967295 * q) % 4294967296 < 0) && (4294967295 * r + n + 4294967295 * q) % 4294967296 / 2 + 1 == -1 * q + p))) && (q + r) % 4294967296 >= 0) && -1 * q + p == 0) || ((((((((((((q / 4294967296 * 4294967296 + r + (q + 2 * p) / 4294967296 * 4294967296 <= -1 + q + r / 4294967296 * 4294967296 || r / 4294967296 * 4294967296 <= r + -4294967296 + (q + 2 * p) / 4294967296 * 4294967296) || q / 4294967296 + 1 <= 0) || !((q + 2 * p) / 4294967296 <= 0)) && p == 0) && n * q % 4294967296 == (p * p + q * r) % 4294967296) && ((((n / 4294967296 + -1 * (r / 4294967296) + (q + 2 * p) / 4294967296 <= 0 || n / 4294967296 * 4294967296 <= r) || !((q + 2 * p) / 4294967296 <= 0)) && (r <= n || !(n / 4294967296 + -1 * (r / 4294967296) + (q + 2 * p) / 4294967296 <= 0))) || q / 4294967296 + 1 <= 0)) && h == 0) && q == 1) && (!(q / 4294967296 + 1 <= 0) || q <= q / 4294967296 * 4294967296 + 4294967295)) && n == r) && (((q <= 4 || (q + 2 * p) / 4294967296 <= 0) && (((q / 4294967296 * 4294967296 + r / 4294967296 * 4294967296 <= r + -4294967296 + (q + 2 * p) / 4294967296 * 4294967296 || q / 4294967296 + 1 <= 0) && (!(q / 4294967296 + 1 <= 0) || 0 <= q / 4294967296)) || !((q + 2 * p) / 4294967296 <= 0))) || r + (q + 2 * p) / 4294967296 * 4294967296 <= -1 + q + r / 4294967296 * 4294967296)) && -1 + q == 0)) || ((((((((((p == 0 && n % 4294967296 >= 0) && h == 0) && n % 4294967296 <= 1) && 1 <= r % 4294967296) && r % 4294967296 >= h % 4294967296) && 1 <= n % 4294967296) && !(q % 4294967296 <= n % 4294967296)) && 4 * 1 == q) && n == r) && !(q % 4294967296 <= r % 4294967296)) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-02-18 01:37:59,036 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