./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound2.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_valuebound2.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 185af411ffb66b9762afca1cabf119211700e2cdb0b48054cece4906f7290e44 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 01:28:24,617 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 01:28:24,618 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 01:28:24,637 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 01:28:24,637 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 01:28:24,638 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 01:28:24,638 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 01:28:24,639 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 01:28:24,640 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 01:28:24,641 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 01:28:24,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 01:28:24,642 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 01:28:24,642 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 01:28:24,643 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 01:28:24,644 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 01:28:24,644 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 01:28:24,645 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 01:28:24,645 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 01:28:24,646 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 01:28:24,647 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 01:28:24,648 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 01:28:24,649 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 01:28:24,650 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 01:28:24,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 01:28:24,652 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 01:28:24,653 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 01:28:24,653 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 01:28:24,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 01:28:24,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 01:28:24,654 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 01:28:24,655 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 01:28:24,655 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 01:28:24,655 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 01:28:24,656 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 01:28:24,657 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 01:28:24,658 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 01:28:24,658 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 01:28:24,659 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 01:28:24,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 01:28:24,660 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 01:28:24,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 01:28:24,662 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:28:24,675 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 01:28:24,675 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 01:28:24,676 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 01:28:24,676 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 01:28:24,676 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 01:28:24,676 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 01:28:24,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 01:28:24,677 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 01:28:24,677 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 01:28:24,677 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 01:28:24,677 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 01:28:24,677 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 01:28:24,678 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 01:28:24,678 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 01:28:24,678 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 01:28:24,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 01:28:24,678 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 01:28:24,678 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 01:28:24,678 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 01:28:24,678 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 01:28:24,679 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 01:28:24,679 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 01:28:24,679 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 01:28:24,679 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 01:28:24,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 01:28:24,679 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 01:28:24,679 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 01:28:24,680 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 01:28:24,680 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 01:28:24,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 01:28:24,680 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 01:28:24,680 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 01:28:24,680 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 01:28:24,680 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 01:28:24,681 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 01:28:24,681 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 -> 185af411ffb66b9762afca1cabf119211700e2cdb0b48054cece4906f7290e44 [2023-02-18 01:28:24,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 01:28:24,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 01:28:24,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 01:28:24,879 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 01:28:24,880 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 01:28:24,881 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound2.c [2023-02-18 01:28:25,908 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 01:28:26,042 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 01:28:26,043 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound2.c [2023-02-18 01:28:26,047 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcb5d7e58/71a56957fb6641699ad96ebaa4207da5/FLAG70e6a61c8 [2023-02-18 01:28:26,056 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcb5d7e58/71a56957fb6641699ad96ebaa4207da5 [2023-02-18 01:28:26,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 01:28:26,059 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 01:28:26,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 01:28:26,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 01:28:26,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 01:28:26,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:28:26" (1/1) ... [2023-02-18 01:28:26,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e20faa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:28:26, skipping insertion in model container [2023-02-18 01:28:26,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:28:26" (1/1) ... [2023-02-18 01:28:26,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 01:28:26,086 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 01:28:26,172 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_valuebound2.c[525,538] [2023-02-18 01:28:26,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 01:28:26,215 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 01:28:26,225 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_valuebound2.c[525,538] [2023-02-18 01:28:26,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 01:28:26,261 INFO L208 MainTranslator]: Completed translation [2023-02-18 01:28:26,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:28:26 WrapperNode [2023-02-18 01:28:26,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 01:28:26,263 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 01:28:26,263 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 01:28:26,263 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 01:28:26,267 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:28:26" (1/1) ... [2023-02-18 01:28:26,280 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:28:26" (1/1) ... [2023-02-18 01:28:26,300 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2023-02-18 01:28:26,300 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 01:28:26,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 01:28:26,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 01:28:26,301 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 01:28:26,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:28:26" (1/1) ... [2023-02-18 01:28:26,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:28:26" (1/1) ... [2023-02-18 01:28:26,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:28:26" (1/1) ... [2023-02-18 01:28:26,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:28:26" (1/1) ... [2023-02-18 01:28:26,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:28:26" (1/1) ... [2023-02-18 01:28:26,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:28:26" (1/1) ... [2023-02-18 01:28:26,325 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:28:26" (1/1) ... [2023-02-18 01:28:26,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:28:26" (1/1) ... [2023-02-18 01:28:26,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 01:28:26,330 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 01:28:26,330 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 01:28:26,330 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 01:28:26,331 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:28:26" (1/1) ... [2023-02-18 01:28:26,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 01:28:26,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:28:26,352 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:28:26,359 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:28:26,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 01:28:26,381 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-18 01:28:26,381 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-18 01:28:26,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 01:28:26,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 01:28:26,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 01:28:26,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 01:28:26,382 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 01:28:26,423 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 01:28:26,425 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 01:28:26,605 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 01:28:26,617 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 01:28:26,617 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-18 01:28:26,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:28:26 BoogieIcfgContainer [2023-02-18 01:28:26,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 01:28:26,620 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 01:28:26,620 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 01:28:26,622 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 01:28:26,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 01:28:26" (1/3) ... [2023-02-18 01:28:26,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119e2dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:28:26, skipping insertion in model container [2023-02-18 01:28:26,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:28:26" (2/3) ... [2023-02-18 01:28:26,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119e2dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:28:26, skipping insertion in model container [2023-02-18 01:28:26,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:28:26" (3/3) ... [2023-02-18 01:28:26,624 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound2.c [2023-02-18 01:28:26,634 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 01:28:26,634 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 01:28:26,660 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 01:28:26,664 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;@73f72041, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 01:28:26,665 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 01:28:26,667 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:28:26,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-18 01:28:26,672 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:28:26,672 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:28:26,672 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:28:26,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:28:26,675 INFO L85 PathProgramCache]: Analyzing trace with hash -645822239, now seen corresponding path program 1 times [2023-02-18 01:28:26,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:28:26,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351193273] [2023-02-18 01:28:26,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:28:26,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:28:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:28:26,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:28:26,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351193273] [2023-02-18 01:28:26,750 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-18 01:28:26,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952681880] [2023-02-18 01:28:26,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:28:26,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:28:26,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:28:26,753 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:28:26,754 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:28:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:28:26,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-18 01:28:26,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:28:26,830 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:28:26,844 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 01:28:26,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952681880] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 01:28:26,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 01:28:26,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 01:28:26,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003098964] [2023-02-18 01:28:26,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 01:28:26,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 01:28:26,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:28:26,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 01:28:26,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 01:28:26,875 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:28:26,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:28:26,902 INFO L93 Difference]: Finished difference Result 63 states and 107 transitions. [2023-02-18 01:28:26,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 01:28:26,904 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:28:26,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:28:26,908 INFO L225 Difference]: With dead ends: 63 [2023-02-18 01:28:26,909 INFO L226 Difference]: Without dead ends: 29 [2023-02-18 01:28:26,912 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:28:26,916 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:28:26,917 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:28:26,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-18 01:28:26,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-18 01:28:26,944 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:28:26,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2023-02-18 01:28:26,947 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 19 [2023-02-18 01:28:26,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:28:26,947 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2023-02-18 01:28:26,948 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:28:26,948 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2023-02-18 01:28:26,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-18 01:28:26,950 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:28:26,951 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:28:26,957 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:28:27,155 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:28:27,155 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:28:27,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:28:27,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1757085840, now seen corresponding path program 1 times [2023-02-18 01:28:27,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:28:27,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068520124] [2023-02-18 01:28:27,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:28:27,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:28:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:28:27,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 01:28:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:28:27,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 01:28:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:28:27,469 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:28:27,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:28:27,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068520124] [2023-02-18 01:28:27,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068520124] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 01:28:27,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 01:28:27,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 01:28:27,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429023833] [2023-02-18 01:28:27,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 01:28:27,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 01:28:27,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:28:27,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 01:28:27,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 01:28:27,472 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:28:27,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:28:27,780 INFO L93 Difference]: Finished difference Result 64 states and 94 transitions. [2023-02-18 01:28:27,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 01:28:27,782 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:28:27,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:28:27,783 INFO L225 Difference]: With dead ends: 64 [2023-02-18 01:28:27,783 INFO L226 Difference]: Without dead ends: 46 [2023-02-18 01:28:27,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-18 01:28:27,784 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 01:28:27,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 157 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 01:28:27,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-18 01:28:27,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2023-02-18 01:28:27,801 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:28:27,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2023-02-18 01:28:27,805 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 20 [2023-02-18 01:28:27,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:28:27,805 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2023-02-18 01:28:27,805 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:28:27,806 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2023-02-18 01:28:27,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-18 01:28:27,806 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:28:27,807 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:28:27,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 01:28:27,807 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:28:27,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:28:27,808 INFO L85 PathProgramCache]: Analyzing trace with hash -332038773, now seen corresponding path program 1 times [2023-02-18 01:28:27,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:28:27,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283547046] [2023-02-18 01:28:27,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:28:27,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:28:27,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:28:28,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 01:28:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:28:28,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 01:28:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:28:28,011 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:28:28,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:28:28,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283547046] [2023-02-18 01:28:28,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283547046] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 01:28:28,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229352489] [2023-02-18 01:28:28,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:28:28,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:28:28,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:28:28,015 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:28:28,017 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:28:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:28:28,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 01:28:28,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:28:28,123 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:28:28,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:28:28,177 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:28:28,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229352489] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:28:28,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 01:28:28,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2023-02-18 01:28:28,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648286445] [2023-02-18 01:28:28,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 01:28:28,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 01:28:28,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:28:28,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 01:28:28,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2023-02-18 01:28:28,179 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:28:31,754 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:33,757 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:36,331 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:41,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:28:43,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:28:47,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:28:48,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:28:48,490 INFO L93 Difference]: Finished difference Result 121 states and 193 transitions. [2023-02-18 01:28:48,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 01:28:48,491 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:28:48,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:28:48,493 INFO L225 Difference]: With dead ends: 121 [2023-02-18 01:28:48,493 INFO L226 Difference]: Without dead ends: 101 [2023-02-18 01:28:48,494 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:28:48,494 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 37 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 112 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2023-02-18 01:28:48,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 366 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 421 Invalid, 4 Unknown, 0 Unchecked, 20.2s Time] [2023-02-18 01:28:48,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-02-18 01:28:48,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 63. [2023-02-18 01:28:48,512 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:28:48,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 89 transitions. [2023-02-18 01:28:48,513 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 89 transitions. Word has length 22 [2023-02-18 01:28:48,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:28:48,514 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 89 transitions. [2023-02-18 01:28:48,514 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:28:48,514 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 89 transitions. [2023-02-18 01:28:48,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-18 01:28:48,515 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:28:48,515 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:28:48,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-18 01:28:48,717 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:28:48,717 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:28:48,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:28:48,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1041809680, now seen corresponding path program 1 times [2023-02-18 01:28:48,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:28:48,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112418368] [2023-02-18 01:28:48,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:28:48,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:28:48,729 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:28:48,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [174070820] [2023-02-18 01:28:48,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:28:48,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:28:48,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:28:48,737 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:28:48,765 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:28:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:28:48,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 01:28:48,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:28:48,869 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:28:48,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:29:13,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:29:13,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112418368] [2023-02-18 01:29:13,189 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:29:13,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174070820] [2023-02-18 01:29:13,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174070820] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 01:29:13,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 01:29:13,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2023-02-18 01:29:13,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470517972] [2023-02-18 01:29:13,189 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 01:29:13,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 01:29:13,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:29:13,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 01:29:13,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=74, Unknown=10, NotChecked=0, Total=110 [2023-02-18 01:29:13,190 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:29:19,489 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:29:21,497 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:29:23,499 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:29:25,503 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:29:26,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:29:28,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:29:28,888 INFO L93 Difference]: Finished difference Result 80 states and 109 transitions. [2023-02-18 01:29:28,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 01:29:28,890 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:29:28,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:29:28,891 INFO L225 Difference]: With dead ends: 80 [2023-02-18 01:29:28,891 INFO L226 Difference]: Without dead ends: 57 [2023-02-18 01:29:28,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=39, Invalid=106, Unknown=11, NotChecked=0, Total=156 [2023-02-18 01:29:28,892 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 15 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 14 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2023-02-18 01:29:28,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 94 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 130 Invalid, 4 Unknown, 0 Unchecked, 12.5s Time] [2023-02-18 01:29:28,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-18 01:29:28,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-02-18 01:29:28,899 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:29:28,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 82 transitions. [2023-02-18 01:29:28,900 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 82 transitions. Word has length 30 [2023-02-18 01:29:28,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:29:28,901 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 82 transitions. [2023-02-18 01:29:28,901 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:29:28,901 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 82 transitions. [2023-02-18 01:29:28,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-18 01:29:28,901 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:29:28,902 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:29:28,906 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:29:29,106 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:29:29,106 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:29:29,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:29:29,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1015454531, now seen corresponding path program 1 times [2023-02-18 01:29:29,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:29:29,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681678943] [2023-02-18 01:29:29,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:29:29,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:29:29,115 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:29:29,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [770115073] [2023-02-18 01:29:29,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:29:29,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:29:29,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:29:29,118 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:29:29,121 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:29:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:29:29,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 01:29:29,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:29:29,190 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:29:29,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:29:29,225 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:29:29,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:29:29,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681678943] [2023-02-18 01:29:29,226 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:29:29,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770115073] [2023-02-18 01:29:29,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770115073] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:29:29,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:29:29,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2023-02-18 01:29:29,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773292709] [2023-02-18 01:29:29,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:29:29,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 01:29:29,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:29:29,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 01:29:29,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-02-18 01:29:29,228 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:29:32,275 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:29:34,929 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:29:38,136 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:29:40,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:29:42,638 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:29:45,198 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:29:48,517 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:29:49,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:29:51,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:29:51,086 INFO L93 Difference]: Finished difference Result 80 states and 112 transitions. [2023-02-18 01:29:51,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 01:29:51,087 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:29:51,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:29:51,087 INFO L225 Difference]: With dead ends: 80 [2023-02-18 01:29:51,087 INFO L226 Difference]: Without dead ends: 54 [2023-02-18 01:29:51,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-02-18 01:29:51,089 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 20 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 27 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.8s IncrementalHoareTripleChecker+Time [2023-02-18 01:29:51,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 111 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 150 Invalid, 6 Unknown, 0 Unchecked, 21.8s Time] [2023-02-18 01:29:51,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-02-18 01:29:51,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2023-02-18 01:29:51,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 26 states have internal predecessors, (26), 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:29:51,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 72 transitions. [2023-02-18 01:29:51,097 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 72 transitions. Word has length 29 [2023-02-18 01:29:51,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:29:51,097 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 72 transitions. [2023-02-18 01:29:51,097 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:29:51,097 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 72 transitions. [2023-02-18 01:29:51,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-18 01:29:51,098 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:29:51,098 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:29:51,109 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:29:51,305 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:29:51,305 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:29:51,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:29:51,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1797429611, now seen corresponding path program 1 times [2023-02-18 01:29:51,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:29:51,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125050026] [2023-02-18 01:29:51,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:29:51,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:29:51,317 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:29:51,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [525438973] [2023-02-18 01:29:51,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:29:51,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:29:51,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:29:51,320 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:29:51,331 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:29:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:29:51,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 01:29:51,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:29:51,490 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:29:51,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:29:55,161 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:29:55,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:29:55,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125050026] [2023-02-18 01:29:55,464 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:29:55,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525438973] [2023-02-18 01:29:55,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525438973] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 01:29:55,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 01:29:55,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2023-02-18 01:29:55,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271066735] [2023-02-18 01:29:55,464 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 01:29:55,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 01:29:55,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:29:55,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 01:29:55,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2023-02-18 01:29:55,465 INFO L87 Difference]: Start difference. First operand 52 states and 72 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:29:57,471 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:30:03,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:30:05,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:30:07,885 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:30:10,515 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:30:12,712 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:30:12,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:30:12,744 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2023-02-18 01:30:12,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 01:30:12,745 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:30:12,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:30:12,746 INFO L225 Difference]: With dead ends: 62 [2023-02-18 01:30:12,746 INFO L226 Difference]: Without dead ends: 60 [2023-02-18 01:30:12,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=37, Invalid=96, Unknown=3, NotChecked=20, Total=156 [2023-02-18 01:30:12,747 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 9 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2023-02-18 01:30:12,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 100 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 121 Invalid, 5 Unknown, 0 Unchecked, 13.3s Time] [2023-02-18 01:30:12,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-18 01:30:12,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-02-18 01:30:12,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 32 states have internal predecessors, (32), 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:30:12,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2023-02-18 01:30:12,756 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 78 transitions. Word has length 32 [2023-02-18 01:30:12,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:30:12,756 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 78 transitions. [2023-02-18 01:30:12,756 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:30:12,756 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2023-02-18 01:30:12,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-18 01:30:12,757 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:30:12,757 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:30:12,765 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:30:12,959 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:30:12,959 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:30:12,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:30:12,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1526883210, now seen corresponding path program 1 times [2023-02-18 01:30:12,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:30:12,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822439847] [2023-02-18 01:30:12,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:30:12,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:30:12,965 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:30:12,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [394462839] [2023-02-18 01:30:12,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:30:12,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:30:12,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:30:12,977 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:30:12,981 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:30:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:30:13,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-18 01:30:13,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:30:13,259 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:30:13,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:30:15,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:30:15,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822439847] [2023-02-18 01:30:15,812 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:30:15,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394462839] [2023-02-18 01:30:15,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394462839] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 01:30:15,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 01:30:15,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2023-02-18 01:30:15,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247886948] [2023-02-18 01:30:15,813 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 01:30:15,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 01:30:15,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:30:15,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 01:30:15,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=288, Unknown=1, NotChecked=0, Total=342 [2023-02-18 01:30:15,814 INFO L87 Difference]: Start difference. First operand 60 states and 78 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:30:21,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 [0] [2023-02-18 01:30:23,095 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:30:25,327 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:30:27,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 01:30:29,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:30:32,255 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:30:34,258 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:30:39,733 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:30:41,734 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:30:44,315 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:30:46,617 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:30:48,619 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:30:50,620 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:30:52,621 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:30:54,623 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:30:56,624 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:30:58,625 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:30:58,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:30:58,625 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2023-02-18 01:30:58,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 01:30:58,626 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:30:58,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:30:58,627 INFO L225 Difference]: With dead ends: 68 [2023-02-18 01:30:58,627 INFO L226 Difference]: Without dead ends: 59 [2023-02-18 01:30:58,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=82, Invalid=469, Unknown=1, NotChecked=0, Total=552 [2023-02-18 01:30:58,628 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 28 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 47 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.6s IncrementalHoareTripleChecker+Time [2023-02-18 01:30:58,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 143 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 598 Invalid, 15 Unknown, 0 Unchecked, 42.6s Time] [2023-02-18 01:30:58,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-18 01:30:58,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2023-02-18 01:30:58,634 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:30:58,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2023-02-18 01:30:58,634 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 55 [2023-02-18 01:30:58,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:30:58,635 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2023-02-18 01:30:58,635 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:30:58,635 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2023-02-18 01:30:58,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-18 01:30:58,635 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:30:58,636 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:30:58,643 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:30:58,837 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:30:58,837 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:30:58,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:30:58,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1584141512, now seen corresponding path program 1 times [2023-02-18 01:30:58,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:30:58,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536987997] [2023-02-18 01:30:58,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:30:58,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:30:58,845 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:30:58,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1099728769] [2023-02-18 01:30:58,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:30:58,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:30:58,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:30:58,848 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:30:58,850 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:30:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:30:58,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-18 01:30:58,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:30:58,956 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:30:58,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:30:59,128 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:30:59,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:30:59,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536987997] [2023-02-18 01:30:59,129 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:30:59,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099728769] [2023-02-18 01:30:59,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099728769] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:30:59,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:30:59,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-18 01:30:59,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550381782] [2023-02-18 01:30:59,129 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:30:59,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 01:30:59,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:30:59,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 01:30:59,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-18 01:30:59,131 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:31:01,351 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:31:03,828 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:31:05,833 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:31:07,841 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:31:10,265 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:31:12,270 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:31:15,746 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:31:18,225 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:31:19,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:31:21,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:31:21,332 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2023-02-18 01:31:21,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 01:31:21,333 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:31:21,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:31:21,334 INFO L225 Difference]: With dead ends: 63 [2023-02-18 01:31:21,334 INFO L226 Difference]: Without dead ends: 55 [2023-02-18 01:31:21,334 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:31:21,334 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 9 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 25 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.2s IncrementalHoareTripleChecker+Time [2023-02-18 01:31:21,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 101 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 112 Invalid, 8 Unknown, 0 Unchecked, 22.2s Time] [2023-02-18 01:31:21,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-18 01:31:21,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-02-18 01:31:21,341 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:31:21,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2023-02-18 01:31:21,342 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 55 [2023-02-18 01:31:21,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:31:21,343 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2023-02-18 01:31:21,343 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:31:21,344 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2023-02-18 01:31:21,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-18 01:31:21,347 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:31:21,347 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:31:21,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-18 01:31:21,552 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:31:21,553 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:31:21,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:31:21,554 INFO L85 PathProgramCache]: Analyzing trace with hash 657582233, now seen corresponding path program 2 times [2023-02-18 01:31:21,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:31:21,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101755982] [2023-02-18 01:31:21,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:31:21,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:31:21,559 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:31:21,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [238124615] [2023-02-18 01:31:21,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 01:31:21,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:31:21,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:31:21,565 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:31:21,567 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:31:21,669 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 01:31:21,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:31:21,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-18 01:31:21,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:31:21,799 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-02-18 01:31:21,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:31:56,185 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:31:56,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:31:56,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101755982] [2023-02-18 01:31:56,186 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:31:56,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238124615] [2023-02-18 01:31:56,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238124615] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:31:56,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:31:56,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2023-02-18 01:31:56,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860985696] [2023-02-18 01:31:56,186 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:31:56,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-18 01:31:56,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:31:56,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-18 01:31:56,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=264, Unknown=8, NotChecked=0, Total=342 [2023-02-18 01:31:56,188 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 17 states have internal predecessors, (36), 6 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-18 01:32:00,007 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:32:03,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:32:12,080 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:32:14,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:32:16,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:32:19,805 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:32:21,808 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:32:23,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:32:25,463 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:32:27,469 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:32:30,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:32:32,463 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:32:33,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:32:36,272 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:32:38,531 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:32:40,534 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:32:43,571 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:32:44,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:32:47,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:32:50,232 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:32:52,249 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:32:54,781 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:32:56,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:32:57,469 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:33:00,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 01:33:04,177 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:33:05,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:33:07,433 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:33:10,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:33:11,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:33:11,337 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2023-02-18 01:33:11,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 01:33:11,338 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 17 states have internal predecessors, (36), 6 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) Word has length 60 [2023-02-18 01:33:11,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:33:11,338 INFO L225 Difference]: With dead ends: 61 [2023-02-18 01:33:11,338 INFO L226 Difference]: Without dead ends: 59 [2023-02-18 01:33:11,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 33.5s TimeCoverageRelationStatistics Valid=85, Invalid=327, Unknown=8, NotChecked=0, Total=420 [2023-02-18 01:33:11,339 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 19 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 23 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 72.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 72.7s IncrementalHoareTripleChecker+Time [2023-02-18 01:33:11,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 121 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 242 Invalid, 20 Unknown, 0 Unchecked, 72.7s Time] [2023-02-18 01:33:11,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-18 01:33:11,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-02-18 01:33:11,356 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:33:11,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2023-02-18 01:33:11,356 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 60 [2023-02-18 01:33:11,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:33:11,357 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2023-02-18 01:33:11,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 17 states have internal predecessors, (36), 6 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-18 01:33:11,357 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2023-02-18 01:33:11,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-18 01:33:11,358 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:33:11,358 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:33:11,365 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:33:11,559 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:33:11,560 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:33:11,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:33:11,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1365029718, now seen corresponding path program 3 times [2023-02-18 01:33:11,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:33:11,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308810666] [2023-02-18 01:33:11,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:33:11,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:33:11,565 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:33:11,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [82633190] [2023-02-18 01:33:11,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 01:33:11,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:33:11,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:33:11,569 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:33:11,571 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:33:11,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-18 01:33:11,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:33:11,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-18 01:33:11,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:33:11,858 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:33:11,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:33:15,317 WARN L859 $PredicateComparison]: unable to prove that (= (mod (+ (* |c_ULTIMATE.start_main_~n~0#1| 16 |c_ULTIMATE.start_main_~q~0#1| |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~h~0#1| 15 |c_ULTIMATE.start_main_~q~0#1| |c_ULTIMATE.start_main_~q~0#1|) (* |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|) (* 4294967292 |c_ULTIMATE.start_main_~q~0#1| |c_ULTIMATE.start_main_~q~0#1| |c_ULTIMATE.start_main_~q~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|) (* |c_ULTIMATE.start_main_~h~0#1| |c_ULTIMATE.start_main_~h~0#1| 4294967284 |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~r~0#1| 4294967280 |c_ULTIMATE.start_main_~q~0#1| |c_ULTIMATE.start_main_~q~0#1|) (* |c_ULTIMATE.start_main_~p~0#1| 16 |c_ULTIMATE.start_main_~h~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) 0) is different from true [2023-02-18 01:33:39,482 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:33:39,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:33:39,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308810666] [2023-02-18 01:33:39,483 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:33:39,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82633190] [2023-02-18 01:33:39,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82633190] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:33:39,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:33:39,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-02-18 01:33:39,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573616430] [2023-02-18 01:33:39,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:33:39,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 01:33:39,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:33:39,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 01:33:39,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=161, Unknown=3, NotChecked=26, Total=240 [2023-02-18 01:33:39,485 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:33:41,648 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:33:43,651 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:33:45,654 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:33:47,657 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:33:49,664 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:33:52,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:33:53,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:33:58,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:34:00,306 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:02,309 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:04,595 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:06,992 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:10,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:34:12,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:34:14,733 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:19,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:34:21,302 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:24,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:34:26,885 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:28,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:34:30,533 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:32,568 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:33,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:34:35,033 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:34:37,040 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:39,043 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:41,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:34:42,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:34:46,129 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:48,130 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:50,834 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:52,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:34:54,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:34:55,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:34:58,023 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:00,028 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:00,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:35:00,938 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2023-02-18 01:35:00,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 01:35:00,938 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:35:00,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:35:00,939 INFO L225 Difference]: With dead ends: 59 [2023-02-18 01:35:00,939 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 01:35:00,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 31.7s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=4, NotChecked=30, Total=306 [2023-02-18 01:35:00,940 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 16 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 40 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 77.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 77.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:35:00,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 97 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 145 Invalid, 27 Unknown, 53 Unchecked, 77.1s Time] [2023-02-18 01:35:00,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 01:35:00,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 01:35:00,941 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:35:00,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 01:35:00,942 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2023-02-18 01:35:00,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:35:00,942 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 01:35:00,942 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:35:00,942 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 01:35:00,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 01:35:00,945 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 01:35:00,952 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:35:01,145 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:35:01,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 01:35:01,178 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 32) no Hoare annotation was computed. [2023-02-18 01:35:01,179 INFO L902 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: true [2023-02-18 01:35:01,179 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 2))) [2023-02-18 01:35:01,179 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 55) no Hoare annotation was computed. [2023-02-18 01:35:01,180 INFO L895 garLoopResultBuilder]: At program point L52-2(lines 38 56) the Hoare annotation is: (let ((.cse2 (mod |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse14 (= |ULTIMATE.start_main_~q~0#1| 1)) (.cse33 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse11 (>= .cse2 0)) (.cse13 (<= .cse2 2)) (.cse38 (= |ULTIMATE.start_main_~h~0#1| 0)) (.cse15 (<= 1 .cse2)) (.cse40 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse1 (mod |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse10 (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (or (let ((.cse12 (* (- 1) |ULTIMATE.start_main_~q~0#1|))) (let ((.cse21 (* 4294967295 |ULTIMATE.start_main_~q~0#1|)) (.cse0 (mod (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 4294967296)) (.cse17 (+ .cse12 |ULTIMATE.start_main_~p~0#1|))) (and (>= .cse0 .cse1) (= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~r~0#1|)) (not (<= 4 .cse2)) (<= .cse0 2) (or (let ((.cse6 (< .cse1 0)) (.cse3 (= (mod |ULTIMATE.start_main_~q~0#1| 4) 0)) (.cse7 (* (- 1) .cse10)) (.cse4 (div .cse1 4))) (and (let ((.cse5 (+ (* (div (+ .cse4 |ULTIMATE.start_main_~p~0#1| (- 4294967295)) 4294967296) 4294967296) 4294967296))) (or .cse3 (< (+ .cse4 |ULTIMATE.start_main_~p~0#1| 1) .cse5) (not .cse6) (< (+ .cse4 |ULTIMATE.start_main_~p~0#1| .cse7) .cse5))) (let ((.cse8 (+ .cse4 |ULTIMATE.start_main_~p~0#1|))) (let ((.cse9 (* (div .cse8 4294967296) 4294967296))) (or (< .cse8 .cse9) (and .cse6 (not .cse3)) (< (+ (- 1) .cse4 |ULTIMATE.start_main_~p~0#1| .cse7) .cse9)))))) (= .cse1 1)) .cse11 (= (+ .cse12 |ULTIMATE.start_main_~h~0#1|) 0) .cse13 .cse14 .cse15 (= (+ (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~n~0#1|) .cse12) 0) (let ((.cse20 (mod (+ |ULTIMATE.start_main_~h~0#1| .cse21) 4294967296))) (let ((.cse16 (= (mod (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~q~0#1|) 2) 0)) (.cse19 (< .cse20 0)) (.cse18 (div .cse20 2))) (or (and (not .cse16) (= .cse17 (+ .cse18 1)) .cse19) (and (or .cse16 (not .cse19)) (= .cse17 .cse18))))) (let ((.cse25 (mod (+ (* 4294967295 |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~n~0#1| .cse21) 4294967296))) (let ((.cse23 (= (mod (+ |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse24 (< .cse25 0)) (.cse22 (div .cse25 2))) (or (and (= .cse17 .cse22) (or .cse23 (not .cse24))) (and (not .cse23) .cse24 (= (+ .cse22 1) .cse17))))) (>= .cse0 0) (= .cse17 0)))) (let ((.cse42 (div |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse37 (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)) (.cse36 (div |ULTIMATE.start_main_~r~0#1| 4294967296))) (let ((.cse29 (* .cse36 4294967296)) (.cse41 (<= .cse37 0)) (.cse31 (<= (+ .cse42 1) 0)) (.cse27 (* .cse37 4294967296))) (let ((.cse26 (* .cse42 4294967296)) (.cse30 (+ |ULTIMATE.start_main_~r~0#1| (- 4294967296) .cse27)) (.cse39 (not .cse31)) (.cse32 (not .cse41)) (.cse28 (+ (- 1) |ULTIMATE.start_main_~q~0#1| .cse29))) (and (or (<= (+ .cse26 |ULTIMATE.start_main_~r~0#1| .cse27) .cse28) (<= .cse29 .cse30) .cse31 .cse32) .cse33 (= (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 ((.cse35 (div |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse34 (<= (+ .cse35 (* (- 1) .cse36) .cse37) 0))) (and (or .cse34 (<= (* .cse35 4294967296) |ULTIMATE.start_main_~r~0#1|) .cse32) (or (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (not .cse34))))) .cse31) .cse38 .cse14 (or .cse39 (<= |ULTIMATE.start_main_~q~0#1| (+ .cse26 4294967295))) .cse40 (or (and (or (<= |ULTIMATE.start_main_~q~0#1| 4) .cse41) (or (and (or (<= (+ .cse26 .cse29) .cse30) .cse31) (or .cse39 (<= 0 .cse42))) .cse32)) (<= (+ |ULTIMATE.start_main_~r~0#1| .cse27) .cse28)) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))))) (and .cse33 .cse11 .cse13 .cse38 (<= 1 .cse10) (>= .cse10 (mod |ULTIMATE.start_main_~h~0#1| 4294967296)) .cse15 (not (<= .cse1 .cse2)) (= (* 4 1) |ULTIMATE.start_main_~q~0#1|) .cse40 (not (<= .cse1 .cse10)))))) [2023-02-18 01:35:01,180 INFO L899 garLoopResultBuilder]: For program point L44(lines 38 56) no Hoare annotation was computed. [2023-02-18 01:35:01,180 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 19 61) the Hoare annotation is: true [2023-02-18 01:35:01,181 INFO L895 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: (let ((.cse11 (mod |ULTIMATE.start_main_~n~0#1| 4294967296)) (.cse2 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse5 (= |ULTIMATE.start_main_~q~0#1| 1)) (.cse6 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))) (let ((.cse1 (or (let ((.cse44 (div |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse41 (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)) (.cse40 (div |ULTIMATE.start_main_~r~0#1| 4294967296))) (let ((.cse34 (* .cse40 4294967296)) (.cse43 (<= .cse41 0)) (.cse36 (<= (+ .cse44 1) 0)) (.cse32 (* .cse41 4294967296))) (let ((.cse31 (* .cse44 4294967296)) (.cse35 (+ |ULTIMATE.start_main_~r~0#1| (- 4294967296) .cse32)) (.cse42 (not .cse36)) (.cse37 (not .cse43)) (.cse33 (+ (- 1) |ULTIMATE.start_main_~q~0#1| .cse34))) (and (or (<= (+ .cse31 |ULTIMATE.start_main_~r~0#1| .cse32) .cse33) (<= .cse34 .cse35) .cse36 .cse37) .cse2 (or (let ((.cse39 (div |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse38 (<= (+ .cse39 (* (- 1) .cse40) .cse41) 0))) (and (or .cse38 (<= (* .cse39 4294967296) |ULTIMATE.start_main_~r~0#1|) .cse37) (or (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (not .cse38))))) .cse36) .cse5 (or .cse42 (<= |ULTIMATE.start_main_~q~0#1| (+ .cse31 4294967295))) .cse6 (or (and (or (<= |ULTIMATE.start_main_~q~0#1| 4) .cse43) (or (and (or (<= (+ .cse31 .cse34) .cse35) .cse36) (or .cse42 (<= 0 .cse44))) .cse37)) (<= (+ |ULTIMATE.start_main_~r~0#1| .cse32) .cse33)) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))))) (and .cse2 .cse5 .cse6))) (.cse7 (= (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))) (.cse3 (>= .cse11 0)) (.cse4 (<= .cse11 2)) (.cse8 (= |ULTIMATE.start_main_~h~0#1| 0)) (.cse20 (<= 1 .cse11)) (.cse10 (mod |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse0 (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (or (and (<= .cse0 2) .cse1 .cse2 (= (+ |ULTIMATE.start_main_~q~0#1| 0) |ULTIMATE.start_main_~h~0#1|) (>= .cse0 0) .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse7 .cse8 .cse5) (let ((.cse19 (* (- 1) |ULTIMATE.start_main_~q~0#1|))) (let ((.cse26 (* 4294967295 |ULTIMATE.start_main_~q~0#1|)) (.cse9 (mod (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 4294967296)) (.cse22 (+ .cse19 |ULTIMATE.start_main_~p~0#1|))) (and (>= .cse9 .cse10) (= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~r~0#1|)) (not (<= 4 .cse11)) (<= .cse9 2) (or (let ((.cse15 (< .cse10 0)) (.cse12 (= (mod |ULTIMATE.start_main_~q~0#1| 4) 0)) (.cse16 (* (- 1) .cse0)) (.cse13 (div .cse10 4))) (and (let ((.cse14 (+ (* (div (+ .cse13 |ULTIMATE.start_main_~p~0#1| (- 4294967295)) 4294967296) 4294967296) 4294967296))) (or .cse12 (< (+ .cse13 |ULTIMATE.start_main_~p~0#1| 1) .cse14) (not .cse15) (< (+ .cse13 |ULTIMATE.start_main_~p~0#1| .cse16) .cse14))) (let ((.cse17 (+ .cse13 |ULTIMATE.start_main_~p~0#1|))) (let ((.cse18 (* (div .cse17 4294967296) 4294967296))) (or (< .cse17 .cse18) (and .cse15 (not .cse12)) (< (+ (- 1) .cse13 |ULTIMATE.start_main_~p~0#1| .cse16) .cse18)))))) (= .cse10 1)) .cse3 (= (+ .cse19 |ULTIMATE.start_main_~h~0#1|) 0) .cse4 .cse5 .cse20 (= (+ (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~n~0#1|) .cse19) 0) (let ((.cse25 (mod (+ |ULTIMATE.start_main_~h~0#1| .cse26) 4294967296))) (let ((.cse21 (= (mod (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~q~0#1|) 2) 0)) (.cse24 (< .cse25 0)) (.cse23 (div .cse25 2))) (or (and (not .cse21) (= .cse22 (+ .cse23 1)) .cse24) (and (or .cse21 (not .cse24)) (= .cse22 .cse23))))) (let ((.cse30 (mod (+ (* 4294967295 |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~n~0#1| .cse26) 4294967296))) (let ((.cse28 (= (mod (+ |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse29 (< .cse30 0)) (.cse27 (div .cse30 2))) (or (and (= .cse22 .cse27) (or .cse28 (not .cse29))) (and (not .cse28) .cse29 (= (+ .cse27 1) .cse22))))) (>= .cse9 0) (= .cse22 0)))) (and .cse2 .cse7 .cse3 .cse4 .cse8 (<= 1 .cse0) (>= .cse0 (mod |ULTIMATE.start_main_~h~0#1| 4294967296)) .cse20 (not (<= .cse10 .cse11)) (= (* 4 1) |ULTIMATE.start_main_~q~0#1|) .cse6 (not (<= .cse10 .cse0)))))) [2023-02-18 01:35:01,181 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 01:35:01,181 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 01:35:01,184 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~q~0#1| 1))) (or (and (= |ULTIMATE.start_main_~p~0#1| 0) .cse0 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) (let ((.cse11 (* (- 1) |ULTIMATE.start_main_~q~0#1|))) (let ((.cse2 (mod |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse3 (mod |ULTIMATE.start_main_~n~0#1| 4294967296)) (.cse17 (* 4294967295 |ULTIMATE.start_main_~q~0#1|)) (.cse1 (mod (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 4294967296)) (.cse13 (+ .cse11 |ULTIMATE.start_main_~p~0#1|))) (and (>= .cse1 .cse2) (= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~r~0#1|)) (not (<= 4 .cse3)) (<= .cse1 2) (or (let ((.cse7 (< .cse2 0)) (.cse4 (= (mod |ULTIMATE.start_main_~q~0#1| 4) 0)) (.cse8 (* (- 1) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (.cse5 (div .cse2 4))) (and (let ((.cse6 (+ (* (div (+ .cse5 |ULTIMATE.start_main_~p~0#1| (- 4294967295)) 4294967296) 4294967296) 4294967296))) (or .cse4 (< (+ .cse5 |ULTIMATE.start_main_~p~0#1| 1) .cse6) (not .cse7) (< (+ .cse5 |ULTIMATE.start_main_~p~0#1| .cse8) .cse6))) (let ((.cse9 (+ .cse5 |ULTIMATE.start_main_~p~0#1|))) (let ((.cse10 (* (div .cse9 4294967296) 4294967296))) (or (< .cse9 .cse10) (and .cse7 (not .cse4)) (< (+ (- 1) .cse5 |ULTIMATE.start_main_~p~0#1| .cse8) .cse10)))))) (= .cse2 1)) (>= .cse3 0) (= (+ .cse11 |ULTIMATE.start_main_~h~0#1|) 0) (<= .cse3 2) .cse0 (<= 1 .cse3) (= (+ (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~n~0#1|) .cse11) 0) (let ((.cse16 (mod (+ |ULTIMATE.start_main_~h~0#1| .cse17) 4294967296))) (let ((.cse12 (= (mod (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~q~0#1|) 2) 0)) (.cse15 (< .cse16 0)) (.cse14 (div .cse16 2))) (or (and (not .cse12) (= .cse13 (+ .cse14 1)) .cse15) (and (or .cse12 (not .cse15)) (= .cse13 .cse14))))) (let ((.cse21 (mod (+ (* 4294967295 |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~n~0#1| .cse17) 4294967296))) (let ((.cse19 (= (mod (+ |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse20 (< .cse21 0)) (.cse18 (div .cse21 2))) (or (and (= .cse13 .cse18) (or .cse19 (not .cse20))) (and (not .cse19) .cse20 (= (+ .cse18 1) .cse13))))) (>= .cse1 0) (= .cse13 0)))))) [2023-02-18 01:35:01,184 INFO L899 garLoopResultBuilder]: For program point L24(line 24) no Hoare annotation was computed. [2023-02-18 01:35:01,184 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (let ((.cse11 (mod |ULTIMATE.start_main_~n~0#1| 4294967296)) (.cse1 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse5 (= |ULTIMATE.start_main_~q~0#1| 1)) (.cse6 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))) (let ((.cse2 (or (and .cse1 .cse5 .cse6) (let ((.cse40 (div |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse36 (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296))) (let ((.cse35 (not (<= .cse36 0))) (.cse37 (div |ULTIMATE.start_main_~r~0#1| 4294967296)) (.cse34 (<= (+ .cse40 1) 0)) (.cse31 (* .cse40 4294967296))) (and (let ((.cse33 (* .cse37 4294967296)) (.cse32 (* .cse36 4294967296))) (or (<= (+ .cse31 |ULTIMATE.start_main_~r~0#1| .cse32) (+ (- 1) |ULTIMATE.start_main_~q~0#1| .cse33)) (<= .cse33 (+ |ULTIMATE.start_main_~r~0#1| (- 4294967296) .cse32)) .cse34 .cse35)) .cse1 (or (let ((.cse39 (div |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse38 (<= (+ .cse39 (* (- 1) .cse37) .cse36) 0))) (and (or .cse38 (<= (* .cse39 4294967296) |ULTIMATE.start_main_~r~0#1|) .cse35) (or (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (not .cse38))))) .cse34) .cse5 (or (not .cse34) (<= |ULTIMATE.start_main_~q~0#1| (+ .cse31 4294967295))) .cse6 (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0)))))) (.cse7 (= (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))) (.cse3 (>= .cse11 0)) (.cse4 (<= .cse11 2)) (.cse8 (= |ULTIMATE.start_main_~h~0#1| 0)) (.cse20 (<= 1 .cse11)) (.cse10 (mod |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse0 (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (or (and (<= .cse0 2) .cse1 (= (+ |ULTIMATE.start_main_~q~0#1| 0) |ULTIMATE.start_main_~h~0#1|) (>= .cse0 0) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse7 .cse2 .cse8 .cse5) (let ((.cse19 (* (- 1) |ULTIMATE.start_main_~q~0#1|))) (let ((.cse26 (* 4294967295 |ULTIMATE.start_main_~q~0#1|)) (.cse9 (mod (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 4294967296)) (.cse22 (+ .cse19 |ULTIMATE.start_main_~p~0#1|))) (and (>= .cse9 .cse10) (= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~r~0#1|)) (not (<= 4 .cse11)) (<= .cse9 2) (or (let ((.cse15 (< .cse10 0)) (.cse12 (= (mod |ULTIMATE.start_main_~q~0#1| 4) 0)) (.cse16 (* (- 1) .cse0)) (.cse13 (div .cse10 4))) (and (let ((.cse14 (+ (* (div (+ .cse13 |ULTIMATE.start_main_~p~0#1| (- 4294967295)) 4294967296) 4294967296) 4294967296))) (or .cse12 (< (+ .cse13 |ULTIMATE.start_main_~p~0#1| 1) .cse14) (not .cse15) (< (+ .cse13 |ULTIMATE.start_main_~p~0#1| .cse16) .cse14))) (let ((.cse17 (+ .cse13 |ULTIMATE.start_main_~p~0#1|))) (let ((.cse18 (* (div .cse17 4294967296) 4294967296))) (or (< .cse17 .cse18) (and .cse15 (not .cse12)) (< (+ (- 1) .cse13 |ULTIMATE.start_main_~p~0#1| .cse16) .cse18)))))) (= .cse10 1)) .cse3 (= (+ .cse19 |ULTIMATE.start_main_~h~0#1|) 0) .cse4 .cse5 .cse20 (= (+ (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~n~0#1|) .cse19) 0) (let ((.cse25 (mod (+ |ULTIMATE.start_main_~h~0#1| .cse26) 4294967296))) (let ((.cse21 (= (mod (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~q~0#1|) 2) 0)) (.cse24 (< .cse25 0)) (.cse23 (div .cse25 2))) (or (and (not .cse21) (= .cse22 (+ .cse23 1)) .cse24) (and (or .cse21 (not .cse24)) (= .cse22 .cse23))))) (let ((.cse30 (mod (+ (* 4294967295 |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~n~0#1| .cse26) 4294967296))) (let ((.cse28 (= (mod (+ |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse29 (< .cse30 0)) (.cse27 (div .cse30 2))) (or (and (= .cse22 .cse27) (or .cse28 (not .cse29))) (and (not .cse28) .cse29 (= (+ .cse27 1) .cse22))))) (>= .cse9 0) (= .cse22 0)))) (and .cse1 .cse7 .cse3 .cse4 .cse8 (<= 1 .cse0) (>= .cse0 (mod |ULTIMATE.start_main_~h~0#1| 4294967296)) .cse20 (not (<= .cse10 .cse11)) (= (* 4 1) |ULTIMATE.start_main_~q~0#1|) .cse6 (not (<= .cse10 .cse0)))))) [2023-02-18 01:35:01,185 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 01:35:01,185 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~q~0#1| 1))) (or (and (= |ULTIMATE.start_main_~p~0#1| 0) .cse0 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) (let ((.cse11 (* (- 1) |ULTIMATE.start_main_~q~0#1|))) (let ((.cse2 (mod |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse3 (mod |ULTIMATE.start_main_~n~0#1| 4294967296)) (.cse17 (* 4294967295 |ULTIMATE.start_main_~q~0#1|)) (.cse1 (mod (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 4294967296)) (.cse13 (+ .cse11 |ULTIMATE.start_main_~p~0#1|))) (and (>= .cse1 .cse2) (= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~r~0#1|)) (not (<= 4 .cse3)) (<= .cse1 2) (or (let ((.cse7 (< .cse2 0)) (.cse4 (= (mod |ULTIMATE.start_main_~q~0#1| 4) 0)) (.cse8 (* (- 1) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (.cse5 (div .cse2 4))) (and (let ((.cse6 (+ (* (div (+ .cse5 |ULTIMATE.start_main_~p~0#1| (- 4294967295)) 4294967296) 4294967296) 4294967296))) (or .cse4 (< (+ .cse5 |ULTIMATE.start_main_~p~0#1| 1) .cse6) (not .cse7) (< (+ .cse5 |ULTIMATE.start_main_~p~0#1| .cse8) .cse6))) (let ((.cse9 (+ .cse5 |ULTIMATE.start_main_~p~0#1|))) (let ((.cse10 (* (div .cse9 4294967296) 4294967296))) (or (< .cse9 .cse10) (and .cse7 (not .cse4)) (< (+ (- 1) .cse5 |ULTIMATE.start_main_~p~0#1| .cse8) .cse10)))))) (= .cse2 1)) (>= .cse3 0) (= (+ .cse11 |ULTIMATE.start_main_~h~0#1|) 0) (<= .cse3 2) .cse0 (<= 1 .cse3) (= (+ (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~n~0#1|) .cse11) 0) (let ((.cse16 (mod (+ |ULTIMATE.start_main_~h~0#1| .cse17) 4294967296))) (let ((.cse12 (= (mod (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~q~0#1|) 2) 0)) (.cse15 (< .cse16 0)) (.cse14 (div .cse16 2))) (or (and (not .cse12) (= .cse13 (+ .cse14 1)) .cse15) (and (or .cse12 (not .cse15)) (= .cse13 .cse14))))) (let ((.cse21 (mod (+ (* 4294967295 |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~n~0#1| .cse17) 4294967296))) (let ((.cse19 (= (mod (+ |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse20 (< .cse21 0)) (.cse18 (div .cse21 2))) (or (and (= .cse13 .cse18) (or .cse19 (not .cse20))) (and (not .cse19) .cse20 (= (+ .cse18 1) .cse13))))) (>= .cse1 0) (= .cse13 0)))))) [2023-02-18 01:35:01,185 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (let ((.cse11 (mod |ULTIMATE.start_main_~n~0#1| 4294967296)) (.cse1 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse5 (= |ULTIMATE.start_main_~q~0#1| 1)) (.cse6 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))) (let ((.cse2 (or (and .cse1 .cse5 .cse6) (let ((.cse40 (div |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse36 (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296))) (let ((.cse35 (not (<= .cse36 0))) (.cse37 (div |ULTIMATE.start_main_~r~0#1| 4294967296)) (.cse34 (<= (+ .cse40 1) 0)) (.cse31 (* .cse40 4294967296))) (and (let ((.cse33 (* .cse37 4294967296)) (.cse32 (* .cse36 4294967296))) (or (<= (+ .cse31 |ULTIMATE.start_main_~r~0#1| .cse32) (+ (- 1) |ULTIMATE.start_main_~q~0#1| .cse33)) (<= .cse33 (+ |ULTIMATE.start_main_~r~0#1| (- 4294967296) .cse32)) .cse34 .cse35)) .cse1 (or (let ((.cse39 (div |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse38 (<= (+ .cse39 (* (- 1) .cse37) .cse36) 0))) (and (or .cse38 (<= (* .cse39 4294967296) |ULTIMATE.start_main_~r~0#1|) .cse35) (or (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (not .cse38))))) .cse34) .cse5 (or (not .cse34) (<= |ULTIMATE.start_main_~q~0#1| (+ .cse31 4294967295))) .cse6 (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0)))))) (.cse7 (= (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))) (.cse3 (>= .cse11 0)) (.cse4 (<= .cse11 2)) (.cse8 (= |ULTIMATE.start_main_~h~0#1| 0)) (.cse20 (<= 1 .cse11)) (.cse10 (mod |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse0 (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (or (and (<= .cse0 2) .cse1 (= (+ |ULTIMATE.start_main_~q~0#1| 0) |ULTIMATE.start_main_~h~0#1|) (>= .cse0 0) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse7 .cse2 .cse8 .cse5) (let ((.cse19 (* (- 1) |ULTIMATE.start_main_~q~0#1|))) (let ((.cse26 (* 4294967295 |ULTIMATE.start_main_~q~0#1|)) (.cse9 (mod (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 4294967296)) (.cse22 (+ .cse19 |ULTIMATE.start_main_~p~0#1|))) (and (>= .cse9 .cse10) (= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~r~0#1|)) (not (<= 4 .cse11)) (<= .cse9 2) (or (let ((.cse15 (< .cse10 0)) (.cse12 (= (mod |ULTIMATE.start_main_~q~0#1| 4) 0)) (.cse16 (* (- 1) .cse0)) (.cse13 (div .cse10 4))) (and (let ((.cse14 (+ (* (div (+ .cse13 |ULTIMATE.start_main_~p~0#1| (- 4294967295)) 4294967296) 4294967296) 4294967296))) (or .cse12 (< (+ .cse13 |ULTIMATE.start_main_~p~0#1| 1) .cse14) (not .cse15) (< (+ .cse13 |ULTIMATE.start_main_~p~0#1| .cse16) .cse14))) (let ((.cse17 (+ .cse13 |ULTIMATE.start_main_~p~0#1|))) (let ((.cse18 (* (div .cse17 4294967296) 4294967296))) (or (< .cse17 .cse18) (and .cse15 (not .cse12)) (< (+ (- 1) .cse13 |ULTIMATE.start_main_~p~0#1| .cse16) .cse18)))))) (= .cse10 1)) .cse3 (= (+ .cse19 |ULTIMATE.start_main_~h~0#1|) 0) .cse4 .cse5 .cse20 (= (+ (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~n~0#1|) .cse19) 0) (let ((.cse25 (mod (+ |ULTIMATE.start_main_~h~0#1| .cse26) 4294967296))) (let ((.cse21 (= (mod (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~q~0#1|) 2) 0)) (.cse24 (< .cse25 0)) (.cse23 (div .cse25 2))) (or (and (not .cse21) (= .cse22 (+ .cse23 1)) .cse24) (and (or .cse21 (not .cse24)) (= .cse22 .cse23))))) (let ((.cse30 (mod (+ (* 4294967295 |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~n~0#1| .cse26) 4294967296))) (let ((.cse28 (= (mod (+ |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse29 (< .cse30 0)) (.cse27 (div .cse30 2))) (or (and (= .cse22 .cse27) (or .cse28 (not .cse29))) (and (not .cse28) .cse29 (= (+ .cse27 1) .cse22))))) (>= .cse9 0) (= .cse22 0)))) (and .cse1 .cse7 .cse3 .cse4 .cse8 (<= 1 .cse0) (>= .cse0 (mod |ULTIMATE.start_main_~h~0#1| 4294967296)) .cse20 (not (<= .cse10 .cse11)) (= (* 4 1) |ULTIMATE.start_main_~q~0#1|) .cse6 (not (<= .cse10 .cse0)))))) [2023-02-18 01:35:01,186 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 01:35:01,186 INFO L895 garLoopResultBuilder]: At program point L38-1(lines 38 56) the Hoare annotation is: (let ((.cse2 (mod |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse10 (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (.cse11 (>= .cse2 0)) (.cse13 (<= .cse2 2)) (.cse25 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse14 (= |ULTIMATE.start_main_~q~0#1| 1)) (.cse26 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))) (or (let ((.cse12 (* (- 1) |ULTIMATE.start_main_~q~0#1|))) (let ((.cse1 (mod |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse20 (* 4294967295 |ULTIMATE.start_main_~q~0#1|)) (.cse0 (mod (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 4294967296)) (.cse16 (+ .cse12 |ULTIMATE.start_main_~p~0#1|))) (and (>= .cse0 .cse1) (= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~r~0#1|)) (not (<= 4 .cse2)) (<= .cse0 2) (or (let ((.cse6 (< .cse1 0)) (.cse3 (= (mod |ULTIMATE.start_main_~q~0#1| 4) 0)) (.cse7 (* (- 1) .cse10)) (.cse4 (div .cse1 4))) (and (let ((.cse5 (+ (* (div (+ .cse4 |ULTIMATE.start_main_~p~0#1| (- 4294967295)) 4294967296) 4294967296) 4294967296))) (or .cse3 (< (+ .cse4 |ULTIMATE.start_main_~p~0#1| 1) .cse5) (not .cse6) (< (+ .cse4 |ULTIMATE.start_main_~p~0#1| .cse7) .cse5))) (let ((.cse8 (+ .cse4 |ULTIMATE.start_main_~p~0#1|))) (let ((.cse9 (* (div .cse8 4294967296) 4294967296))) (or (< .cse8 .cse9) (and .cse6 (not .cse3)) (< (+ (- 1) .cse4 |ULTIMATE.start_main_~p~0#1| .cse7) .cse9)))))) (= .cse1 1)) .cse11 (= (+ .cse12 |ULTIMATE.start_main_~h~0#1|) 0) .cse13 .cse14 (<= 1 .cse2) (= (+ (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~n~0#1|) .cse12) 0) (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 (+ (* 4294967295 |ULTIMATE.start_main_~r~0#1|) |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))))) (>= .cse0 0) (= .cse16 0)))) (and (<= .cse10 2) .cse25 (= (+ |ULTIMATE.start_main_~q~0#1| 0) |ULTIMATE.start_main_~h~0#1|) (>= .cse10 0) .cse11 .cse13 .cse14 .cse26) (and .cse25 (= (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) .cse14 .cse26)))) [2023-02-18 01:35:01,186 INFO L895 garLoopResultBuilder]: At program point L30-2(lines 30 35) the Hoare annotation is: (let ((.cse9 (mod |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse0 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse4 (>= .cse9 0)) (.cse5 (<= .cse9 2)) (.cse6 (= |ULTIMATE.start_main_~h~0#1| 0)) (.cse7 (>= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~h~0#1| 4294967296))) (.cse8 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))) (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)) (or (let ((.cse2 (div |ULTIMATE.start_main_~n~0#1| 4294967296)) (.cse3 (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296))) (let ((.cse1 (<= (+ .cse2 (* (- 1) (div |ULTIMATE.start_main_~r~0#1| 4294967296)) .cse3) 0))) (and (or .cse1 (<= (* .cse2 4294967296) |ULTIMATE.start_main_~r~0#1|) (not (<= .cse3 0))) (or (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (not .cse1))))) (<= (+ (div |ULTIMATE.start_main_~q~0#1| 4294967296) 1) 0)) .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~q~0#1| 1) .cse8 (= (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)) (and .cse0 .cse4 .cse5 .cse6 .cse7 (<= 1 .cse9) (= (* 4 1) |ULTIMATE.start_main_~q~0#1|) .cse8)))) [2023-02-18 01:35:01,187 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2023-02-18 01:35:01,187 INFO L895 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (let ((.cse11 (mod |ULTIMATE.start_main_~n~0#1| 4294967296)) (.cse1 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse5 (= |ULTIMATE.start_main_~q~0#1| 1)) (.cse6 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))) (let ((.cse2 (or (and .cse1 .cse5 .cse6) (let ((.cse40 (div |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse36 (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296))) (let ((.cse35 (not (<= .cse36 0))) (.cse37 (div |ULTIMATE.start_main_~r~0#1| 4294967296)) (.cse34 (<= (+ .cse40 1) 0)) (.cse31 (* .cse40 4294967296))) (and (let ((.cse33 (* .cse37 4294967296)) (.cse32 (* .cse36 4294967296))) (or (<= (+ .cse31 |ULTIMATE.start_main_~r~0#1| .cse32) (+ (- 1) |ULTIMATE.start_main_~q~0#1| .cse33)) (<= .cse33 (+ |ULTIMATE.start_main_~r~0#1| (- 4294967296) .cse32)) .cse34 .cse35)) .cse1 (or (let ((.cse39 (div |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse38 (<= (+ .cse39 (* (- 1) .cse37) .cse36) 0))) (and (or .cse38 (<= (* .cse39 4294967296) |ULTIMATE.start_main_~r~0#1|) .cse35) (or (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (not .cse38))))) .cse34) .cse5 (or (not .cse34) (<= |ULTIMATE.start_main_~q~0#1| (+ .cse31 4294967295))) .cse6 (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0)))))) (.cse7 (= (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))) (.cse3 (>= .cse11 0)) (.cse4 (<= .cse11 2)) (.cse8 (= |ULTIMATE.start_main_~h~0#1| 0)) (.cse20 (<= 1 .cse11)) (.cse10 (mod |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse0 (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (or (and (<= .cse0 2) .cse1 (= (+ |ULTIMATE.start_main_~q~0#1| 0) |ULTIMATE.start_main_~h~0#1|) (>= .cse0 0) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse7 .cse2 .cse8 .cse5) (let ((.cse19 (* (- 1) |ULTIMATE.start_main_~q~0#1|))) (let ((.cse26 (* 4294967295 |ULTIMATE.start_main_~q~0#1|)) (.cse9 (mod (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 4294967296)) (.cse22 (+ .cse19 |ULTIMATE.start_main_~p~0#1|))) (and (>= .cse9 .cse10) (= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~r~0#1|)) (not (<= 4 .cse11)) (<= .cse9 2) (or (let ((.cse15 (< .cse10 0)) (.cse12 (= (mod |ULTIMATE.start_main_~q~0#1| 4) 0)) (.cse16 (* (- 1) .cse0)) (.cse13 (div .cse10 4))) (and (let ((.cse14 (+ (* (div (+ .cse13 |ULTIMATE.start_main_~p~0#1| (- 4294967295)) 4294967296) 4294967296) 4294967296))) (or .cse12 (< (+ .cse13 |ULTIMATE.start_main_~p~0#1| 1) .cse14) (not .cse15) (< (+ .cse13 |ULTIMATE.start_main_~p~0#1| .cse16) .cse14))) (let ((.cse17 (+ .cse13 |ULTIMATE.start_main_~p~0#1|))) (let ((.cse18 (* (div .cse17 4294967296) 4294967296))) (or (< .cse17 .cse18) (and .cse15 (not .cse12)) (< (+ (- 1) .cse13 |ULTIMATE.start_main_~p~0#1| .cse16) .cse18)))))) (= .cse10 1)) .cse3 (= (+ .cse19 |ULTIMATE.start_main_~h~0#1|) 0) .cse4 .cse5 .cse20 (= (+ (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~n~0#1|) .cse19) 0) (let ((.cse25 (mod (+ |ULTIMATE.start_main_~h~0#1| .cse26) 4294967296))) (let ((.cse21 (= (mod (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~q~0#1|) 2) 0)) (.cse24 (< .cse25 0)) (.cse23 (div .cse25 2))) (or (and (not .cse21) (= .cse22 (+ .cse23 1)) .cse24) (and (or .cse21 (not .cse24)) (= .cse22 .cse23))))) (let ((.cse30 (mod (+ (* 4294967295 |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~n~0#1| .cse26) 4294967296))) (let ((.cse28 (= (mod (+ |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse29 (< .cse30 0)) (.cse27 (div .cse30 2))) (or (and (= .cse22 .cse27) (or .cse28 (not .cse29))) (and (not .cse28) .cse29 (= (+ .cse27 1) .cse22))))) (>= .cse9 0) (= .cse22 0)))) (and .cse1 .cse7 .cse3 .cse4 .cse8 (<= 1 .cse0) (>= .cse0 (mod |ULTIMATE.start_main_~h~0#1| 4294967296)) .cse20 (not (<= .cse10 .cse11)) (= (* 4 1) |ULTIMATE.start_main_~q~0#1|) .cse6 (not (<= .cse10 .cse0)))))) [2023-02-18 01:35:01,188 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse2 (mod |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse14 (= |ULTIMATE.start_main_~q~0#1| 1)) (.cse33 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse11 (>= .cse2 0)) (.cse13 (<= .cse2 2)) (.cse38 (= |ULTIMATE.start_main_~h~0#1| 0)) (.cse15 (<= 1 .cse2)) (.cse40 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse1 (mod |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse10 (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (or (let ((.cse12 (* (- 1) |ULTIMATE.start_main_~q~0#1|))) (let ((.cse21 (* 4294967295 |ULTIMATE.start_main_~q~0#1|)) (.cse0 (mod (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 4294967296)) (.cse17 (+ .cse12 |ULTIMATE.start_main_~p~0#1|))) (and (>= .cse0 .cse1) (= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~r~0#1|)) (not (<= 4 .cse2)) (<= .cse0 2) (or (let ((.cse6 (< .cse1 0)) (.cse3 (= (mod |ULTIMATE.start_main_~q~0#1| 4) 0)) (.cse7 (* (- 1) .cse10)) (.cse4 (div .cse1 4))) (and (let ((.cse5 (+ (* (div (+ .cse4 |ULTIMATE.start_main_~p~0#1| (- 4294967295)) 4294967296) 4294967296) 4294967296))) (or .cse3 (< (+ .cse4 |ULTIMATE.start_main_~p~0#1| 1) .cse5) (not .cse6) (< (+ .cse4 |ULTIMATE.start_main_~p~0#1| .cse7) .cse5))) (let ((.cse8 (+ .cse4 |ULTIMATE.start_main_~p~0#1|))) (let ((.cse9 (* (div .cse8 4294967296) 4294967296))) (or (< .cse8 .cse9) (and .cse6 (not .cse3)) (< (+ (- 1) .cse4 |ULTIMATE.start_main_~p~0#1| .cse7) .cse9)))))) (= .cse1 1)) .cse11 (= (+ .cse12 |ULTIMATE.start_main_~h~0#1|) 0) .cse13 .cse14 .cse15 (= (+ (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~n~0#1|) .cse12) 0) (let ((.cse20 (mod (+ |ULTIMATE.start_main_~h~0#1| .cse21) 4294967296))) (let ((.cse16 (= (mod (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~q~0#1|) 2) 0)) (.cse19 (< .cse20 0)) (.cse18 (div .cse20 2))) (or (and (not .cse16) (= .cse17 (+ .cse18 1)) .cse19) (and (or .cse16 (not .cse19)) (= .cse17 .cse18))))) (let ((.cse25 (mod (+ (* 4294967295 |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~n~0#1| .cse21) 4294967296))) (let ((.cse23 (= (mod (+ |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 2) 0)) (.cse24 (< .cse25 0)) (.cse22 (div .cse25 2))) (or (and (= .cse17 .cse22) (or .cse23 (not .cse24))) (and (not .cse23) .cse24 (= (+ .cse22 1) .cse17))))) (>= .cse0 0) (= .cse17 0)))) (let ((.cse42 (div |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse37 (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)) (.cse36 (div |ULTIMATE.start_main_~r~0#1| 4294967296))) (let ((.cse29 (* .cse36 4294967296)) (.cse41 (<= .cse37 0)) (.cse31 (<= (+ .cse42 1) 0)) (.cse27 (* .cse37 4294967296))) (let ((.cse26 (* .cse42 4294967296)) (.cse30 (+ |ULTIMATE.start_main_~r~0#1| (- 4294967296) .cse27)) (.cse39 (not .cse31)) (.cse32 (not .cse41)) (.cse28 (+ (- 1) |ULTIMATE.start_main_~q~0#1| .cse29))) (and (or (<= (+ .cse26 |ULTIMATE.start_main_~r~0#1| .cse27) .cse28) (<= .cse29 .cse30) .cse31 .cse32) .cse33 (= (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 ((.cse35 (div |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse34 (<= (+ .cse35 (* (- 1) .cse36) .cse37) 0))) (and (or .cse34 (<= (* .cse35 4294967296) |ULTIMATE.start_main_~r~0#1|) .cse32) (or (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (not .cse34))))) .cse31) .cse38 .cse14 (or .cse39 (<= |ULTIMATE.start_main_~q~0#1| (+ .cse26 4294967295))) .cse40 (or (and (or (<= |ULTIMATE.start_main_~q~0#1| 4) .cse41) (or (and (or (<= (+ .cse26 .cse29) .cse30) .cse31) (or .cse39 (<= 0 .cse42))) .cse32)) (<= (+ |ULTIMATE.start_main_~r~0#1| .cse27) .cse28)) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))))) (and .cse33 .cse11 .cse13 .cse38 (<= 1 .cse10) (>= .cse10 (mod |ULTIMATE.start_main_~h~0#1| 4294967296)) .cse15 (not (<= .cse1 .cse2)) (= (* 4 1) |ULTIMATE.start_main_~q~0#1|) .cse40 (not (<= .cse1 .cse10)))))) [2023-02-18 01:35:01,189 INFO L895 garLoopResultBuilder]: At program point L39-1(line 39) the Hoare annotation is: (let ((.cse10 (mod |ULTIMATE.start_main_~n~0#1| 4294967296)) (.cse2 (= |ULTIMATE.start_main_~p~0#1| 0)) (.cse5 (= |ULTIMATE.start_main_~q~0#1| 1)) (.cse6 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))) (let ((.cse1 (or (let ((.cse43 (div |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse40 (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)) (.cse39 (div |ULTIMATE.start_main_~r~0#1| 4294967296))) (let ((.cse33 (* .cse39 4294967296)) (.cse42 (<= .cse40 0)) (.cse35 (<= (+ .cse43 1) 0)) (.cse31 (* .cse40 4294967296))) (let ((.cse30 (* .cse43 4294967296)) (.cse34 (+ |ULTIMATE.start_main_~r~0#1| (- 4294967296) .cse31)) (.cse41 (not .cse35)) (.cse36 (not .cse42)) (.cse32 (+ (- 1) |ULTIMATE.start_main_~q~0#1| .cse33))) (and (or (<= (+ .cse30 |ULTIMATE.start_main_~r~0#1| .cse31) .cse32) (<= .cse33 .cse34) .cse35 .cse36) .cse2 (or (let ((.cse38 (div |ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse37 (<= (+ .cse38 (* (- 1) .cse39) .cse40) 0))) (and (or .cse37 (<= (* .cse38 4294967296) |ULTIMATE.start_main_~r~0#1|) .cse36) (or (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (not .cse37))))) .cse35) .cse5 (or .cse41 (<= |ULTIMATE.start_main_~q~0#1| (+ .cse30 4294967295))) .cse6 (or (and (or (<= |ULTIMATE.start_main_~q~0#1| 4) .cse42) (or (and (or (<= (+ .cse30 .cse33) .cse34) .cse35) (or .cse41 (<= 0 .cse43))) .cse36)) (<= (+ |ULTIMATE.start_main_~r~0#1| .cse31) .cse32)) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))))) (and .cse2 .cse5 .cse6))) (.cse3 (>= .cse10 0)) (.cse4 (<= .cse10 2)) (.cse7 (= |ULTIMATE.start_main_~h~0#1| 0)) (.cse19 (<= 1 .cse10)) (.cse9 (mod |ULTIMATE.start_main_~q~0#1| 4294967296)) (.cse0 (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (or (and (<= .cse0 2) .cse1 .cse2 (= (+ |ULTIMATE.start_main_~q~0#1| 0) |ULTIMATE.start_main_~h~0#1|) (>= .cse0 0) .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 (= (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)) .cse7 .cse5) (let ((.cse18 (* (- 1) |ULTIMATE.start_main_~q~0#1|))) (let ((.cse25 (* 4294967295 |ULTIMATE.start_main_~q~0#1|)) (.cse8 (mod (+ |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) 4294967296)) (.cse21 (+ .cse18 |ULTIMATE.start_main_~p~0#1|))) (and (>= .cse8 .cse9) (= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~h~0#1| |ULTIMATE.start_main_~r~0#1|)) (not (<= 4 .cse10)) (<= .cse8 2) (or (let ((.cse14 (< .cse9 0)) (.cse11 (= (mod |ULTIMATE.start_main_~q~0#1| 4) 0)) (.cse15 (* (- 1) .cse0)) (.cse12 (div .cse9 4))) (and (let ((.cse13 (+ (* (div (+ .cse12 |ULTIMATE.start_main_~p~0#1| (- 4294967295)) 4294967296) 4294967296) 4294967296))) (or .cse11 (< (+ .cse12 |ULTIMATE.start_main_~p~0#1| 1) .cse13) (not .cse14) (< (+ .cse12 |ULTIMATE.start_main_~p~0#1| .cse15) .cse13))) (let ((.cse16 (+ .cse12 |ULTIMATE.start_main_~p~0#1|))) (let ((.cse17 (* (div .cse16 4294967296) 4294967296))) (or (< .cse16 .cse17) (and .cse14 (not .cse11)) (< (+ (- 1) .cse12 |ULTIMATE.start_main_~p~0#1| .cse15) .cse17)))))) (= .cse9 1)) .cse3 (= (+ .cse18 |ULTIMATE.start_main_~h~0#1|) 0) .cse4 .cse5 .cse19 (= (+ (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~n~0#1|) .cse18) 0) (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 (+ (* 4294967295 |ULTIMATE.start_main_~r~0#1|) |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))))) (>= .cse8 0) (= .cse21 0)))) (and .cse2 .cse3 .cse4 .cse7 (<= 1 .cse0) (>= .cse0 (mod |ULTIMATE.start_main_~h~0#1| 4294967296)) .cse19 (not (<= .cse9 .cse10)) (= (* 4 1) |ULTIMATE.start_main_~q~0#1|) .cse6 (not (<= .cse9 .cse0)))))) [2023-02-18 01:35:01,189 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 8 10) the Hoare annotation is: true [2023-02-18 01:35:01,189 INFO L899 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2023-02-18 01:35:01,189 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2023-02-18 01:35:01,189 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2023-02-18 01:35:01,189 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2023-02-18 01:35:01,190 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2023-02-18 01:35:01,190 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2023-02-18 01:35:01,190 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2023-02-18 01:35:01,190 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 11 17) the Hoare annotation is: true [2023-02-18 01:35:01,190 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2023-02-18 01:35:01,193 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:35:01,195 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 01:35:01,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 01:35:01 BoogieIcfgContainer [2023-02-18 01:35:01,221 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 01:35:01,221 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 01:35:01,221 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 01:35:01,221 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 01:35:01,222 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:28:26" (3/4) ... [2023-02-18 01:35:01,224 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 01:35:01,230 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-02-18 01:35:01,230 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-18 01:35:01,233 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-02-18 01:35:01,233 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 01:35:01,233 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 01:35:01,233 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 01:35:01,264 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 01:35:01,264 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 01:35:01,265 INFO L158 Benchmark]: Toolchain (without parser) took 395205.47ms. Allocated memory was 117.4MB in the beginning and 276.8MB in the end (delta: 159.4MB). Free memory was 73.6MB in the beginning and 233.4MB in the end (delta: -159.7MB). Peak memory consumption was 1.6MB. Max. memory is 16.1GB. [2023-02-18 01:35:01,265 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 94.4MB. Free memory is still 45.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 01:35:01,265 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.24ms. Allocated memory is still 117.4MB. Free memory was 73.6MB in the beginning and 62.0MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-18 01:35:01,265 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.79ms. Allocated memory is still 117.4MB. Free memory was 62.0MB in the beginning and 60.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 01:35:01,266 INFO L158 Benchmark]: Boogie Preprocessor took 27.65ms. Allocated memory is still 117.4MB. Free memory was 60.2MB in the beginning and 59.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 01:35:01,266 INFO L158 Benchmark]: RCFGBuilder took 289.01ms. Allocated memory is still 117.4MB. Free memory was 59.2MB in the beginning and 87.5MB in the end (delta: -28.3MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2023-02-18 01:35:01,266 INFO L158 Benchmark]: TraceAbstraction took 394600.97ms. Allocated memory was 117.4MB in the beginning and 276.8MB in the end (delta: 159.4MB). Free memory was 86.9MB in the beginning and 236.5MB in the end (delta: -149.6MB). Peak memory consumption was 163.1MB. Max. memory is 16.1GB. [2023-02-18 01:35:01,267 INFO L158 Benchmark]: Witness Printer took 43.03ms. Allocated memory is still 276.8MB. Free memory was 236.5MB in the beginning and 233.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 01:35:01,268 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.14ms. Allocated memory is still 94.4MB. Free memory is still 45.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.24ms. Allocated memory is still 117.4MB. Free memory was 73.6MB in the beginning and 62.0MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.79ms. Allocated memory is still 117.4MB. Free memory was 62.0MB in the beginning and 60.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.65ms. Allocated memory is still 117.4MB. Free memory was 60.2MB in the beginning and 59.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 289.01ms. Allocated memory is still 117.4MB. Free memory was 59.2MB in the beginning and 87.5MB in the end (delta: -28.3MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * TraceAbstraction took 394600.97ms. Allocated memory was 117.4MB in the beginning and 276.8MB in the end (delta: 159.4MB). Free memory was 86.9MB in the beginning and 236.5MB in the end (delta: -149.6MB). Peak memory consumption was 163.1MB. Max. memory is 16.1GB. * Witness Printer took 43.03ms. Allocated memory is still 276.8MB. Free memory was 236.5MB in the beginning and 233.4MB 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: 394.5s, OverallIterations: 10, TraceHistogramMax: 9, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 297.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 89 mSolverCounterUnknown, 221 SdHoareTripleChecker+Valid, 282.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 165 mSDsluCounter, 1334 SdHoareTripleChecker+Invalid, 282.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 53 IncrementalHoareTripleChecker+Unchecked, 931 mSDsCounter, 315 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2008 IncrementalHoareTripleChecker+Invalid, 2465 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 315 mSolverCounterUnsat, 403 mSDtfsCounter, 2008 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 656 GetRequests, 526 SyntacticMatches, 5 SemanticMatches, 125 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 103.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=3, InterpolantAutomatonStates: 86, 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, 45 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 85 PreInvPairs, 122 NumberOfFragments, 7297 HoareAnnotationTreeSize, 85 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 94.4s InterpolantComputationTime, 428 NumberOfCodeBlocks, 398 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 624 ConstructedInterpolants, 2 QuantifiedInterpolants, 18227 SizeOfPredicates, 31 NumberOfNonLiveVariables, 889 ConjunctsInSsa, 168 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 713/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 * 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) && n % 4294967296 <= 2) && h == 0) && r % 4294967296 >= h % 4294967296) && q == 1) && n == r) && (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) || (((((((p == 0 && n % 4294967296 >= 0) && n % 4294967296 <= 2) && h == 0) && r % 4294967296 >= h % 4294967296) && 1 <= n % 4294967296) && 4 * 1 == q) && n == r) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((((((((((((((((q + r) % 4294967296 >= q % 4294967296 && n == h + r) && !(4 <= n % 4294967296)) && (q + r) % 4294967296 <= 2) && (((((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 % 4294967296 == 1)) && n % 4294967296 >= 0) && -1 * q + h == 0) && n % 4294967296 <= 2) && q == 1) && 1 <= 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) && n % 4294967296 <= 2) && h == 0) && 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:35:01,335 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