./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound20.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/ps4-ll_valuebound20.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 1fbe6596ea58bb65874b731661e9f9f596a91893af06dcebaa497157579c7f46 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 03:57:24,820 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 03:57:24,822 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 03:57:24,857 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 03:57:24,857 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 03:57:24,858 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 03:57:24,859 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 03:57:24,860 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 03:57:24,869 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 03:57:24,870 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 03:57:24,871 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 03:57:24,872 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 03:57:24,873 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 03:57:24,875 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 03:57:24,876 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 03:57:24,877 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 03:57:24,878 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 03:57:24,880 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 03:57:24,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 03:57:24,881 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 03:57:24,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 03:57:24,883 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 03:57:24,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 03:57:24,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 03:57:24,886 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 03:57:24,886 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 03:57:24,886 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 03:57:24,886 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 03:57:24,887 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 03:57:24,887 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 03:57:24,887 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 03:57:24,888 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 03:57:24,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 03:57:24,888 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 03:57:24,889 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 03:57:24,889 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 03:57:24,889 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 03:57:24,890 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 03:57:24,890 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 03:57:24,890 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 03:57:24,890 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 03:57:24,892 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 03:57:24,914 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 03:57:24,914 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 03:57:24,915 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 03:57:24,915 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 03:57:24,916 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 03:57:24,916 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 03:57:24,916 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 03:57:24,916 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 03:57:24,916 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 03:57:24,917 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 03:57:24,917 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 03:57:24,917 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 03:57:24,917 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 03:57:24,917 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 03:57:24,917 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 03:57:24,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 03:57:24,918 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 03:57:24,918 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 03:57:24,918 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 03:57:24,918 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 03:57:24,918 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 03:57:24,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 03:57:24,918 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 03:57:24,918 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 03:57:24,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 03:57:24,918 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 03:57:24,918 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 03:57:24,919 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 03:57:24,919 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 03:57:24,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 03:57:24,919 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 03:57:24,919 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 03:57:24,919 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 03:57:24,919 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 03:57:24,919 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 03:57:24,919 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 -> 1fbe6596ea58bb65874b731661e9f9f596a91893af06dcebaa497157579c7f46 [2023-02-18 03:57:25,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 03:57:25,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 03:57:25,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 03:57:25,107 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 03:57:25,107 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 03:57:25,108 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound20.c [2023-02-18 03:57:26,006 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 03:57:26,171 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 03:57:26,172 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound20.c [2023-02-18 03:57:26,176 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0b74ada3/8910839a96ea47ef96e486ddc4db60ab/FLAG71495a088 [2023-02-18 03:57:26,185 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0b74ada3/8910839a96ea47ef96e486ddc4db60ab [2023-02-18 03:57:26,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 03:57:26,188 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 03:57:26,188 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 03:57:26,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 03:57:26,190 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 03:57:26,191 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 03:57:26" (1/1) ... [2023-02-18 03:57:26,191 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18c4c3bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:57:26, skipping insertion in model container [2023-02-18 03:57:26,192 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 03:57:26" (1/1) ... [2023-02-18 03:57:26,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 03:57:26,204 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 03:57:26,281 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/ps4-ll_valuebound20.c[458,471] [2023-02-18 03:57:26,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 03:57:26,304 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 03:57:26,313 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/ps4-ll_valuebound20.c[458,471] [2023-02-18 03:57:26,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 03:57:26,331 INFO L208 MainTranslator]: Completed translation [2023-02-18 03:57:26,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:57:26 WrapperNode [2023-02-18 03:57:26,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 03:57:26,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 03:57:26,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 03:57:26,332 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 03:57:26,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:57:26" (1/1) ... [2023-02-18 03:57:26,341 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:57:26" (1/1) ... [2023-02-18 03:57:26,353 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2023-02-18 03:57:26,354 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 03:57:26,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 03:57:26,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 03:57:26,355 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 03:57:26,360 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:57:26" (1/1) ... [2023-02-18 03:57:26,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:57:26" (1/1) ... [2023-02-18 03:57:26,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:57:26" (1/1) ... [2023-02-18 03:57:26,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:57:26" (1/1) ... [2023-02-18 03:57:26,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:57:26" (1/1) ... [2023-02-18 03:57:26,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:57:26" (1/1) ... [2023-02-18 03:57:26,382 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:57:26" (1/1) ... [2023-02-18 03:57:26,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:57:26" (1/1) ... [2023-02-18 03:57:26,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 03:57:26,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 03:57:26,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 03:57:26,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 03:57:26,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:57:26" (1/1) ... [2023-02-18 03:57:26,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 03:57:26,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:57:26,407 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 03:57:26,408 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 03:57:26,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 03:57:26,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 03:57:26,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 03:57:26,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 03:57:26,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 03:57:26,433 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 03:57:26,476 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 03:57:26,478 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 03:57:26,593 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 03:57:26,599 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 03:57:26,600 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-18 03:57:26,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 03:57:26 BoogieIcfgContainer [2023-02-18 03:57:26,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 03:57:26,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 03:57:26,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 03:57:26,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 03:57:26,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 03:57:26" (1/3) ... [2023-02-18 03:57:26,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a3e335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 03:57:26, skipping insertion in model container [2023-02-18 03:57:26,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:57:26" (2/3) ... [2023-02-18 03:57:26,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a3e335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 03:57:26, skipping insertion in model container [2023-02-18 03:57:26,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 03:57:26" (3/3) ... [2023-02-18 03:57:26,608 INFO L112 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound20.c [2023-02-18 03:57:26,626 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 03:57:26,626 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 03:57:26,653 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 03:57:26,658 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;@3d7061bf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 03:57:26,658 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 03:57:26,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 03:57:26,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 03:57:26,664 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:57:26,665 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:57:26,665 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:57:26,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:57:26,668 INFO L85 PathProgramCache]: Analyzing trace with hash -589436290, now seen corresponding path program 1 times [2023-02-18 03:57:26,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:57:26,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647158118] [2023-02-18 03:57:26,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:57:26,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:57:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:57:26,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:57:26,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647158118] [2023-02-18 03:57:26,752 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-18 03:57:26,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165349675] [2023-02-18 03:57:26,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:57:26,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:57:26,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:57:26,755 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 03:57:26,756 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 03:57:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:57:26,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-18 03:57:26,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:57:26,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 03:57:26,825 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 03:57:26,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165349675] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 03:57:26,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 03:57:26,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 03:57:26,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702271573] [2023-02-18 03:57:26,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 03:57:26,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 03:57:26,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:57:26,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 03:57:26,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 03:57:26,851 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 03:57:26,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:57:26,865 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2023-02-18 03:57:26,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 03:57:26,877 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-18 03:57:26,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:57:26,882 INFO L225 Difference]: With dead ends: 35 [2023-02-18 03:57:26,882 INFO L226 Difference]: Without dead ends: 15 [2023-02-18 03:57:26,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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 03:57:26,889 INFO L413 NwaCegarLoop]: 21 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, 21 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 03:57:26,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 03:57:26,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-02-18 03:57:26,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-02-18 03:57:26,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 03:57:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2023-02-18 03:57:26,914 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 9 [2023-02-18 03:57:26,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:57:26,915 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-02-18 03:57:26,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 03:57:26,915 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2023-02-18 03:57:26,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 03:57:26,916 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:57:26,916 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:57:26,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-18 03:57:27,121 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 03:57:27,121 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:57:27,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:57:27,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1187358532, now seen corresponding path program 1 times [2023-02-18 03:57:27,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:57:27,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388237493] [2023-02-18 03:57:27,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:57:27,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:57:27,131 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:57:27,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [119885192] [2023-02-18 03:57:27,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:57:27,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:57:27,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:57:27,133 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 03:57:27,135 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 03:57:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:57:27,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 03:57:27,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:57:27,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 03:57:27,274 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 03:57:27,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:57:27,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388237493] [2023-02-18 03:57:27,275 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:57:27,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119885192] [2023-02-18 03:57:27,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119885192] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 03:57:27,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 03:57:27,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 03:57:27,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844522480] [2023-02-18 03:57:27,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 03:57:27,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 03:57:27,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:57:27,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 03:57:27,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 03:57:27,281 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 03:57:27,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:57:27,450 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2023-02-18 03:57:27,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 03:57:27,451 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-18 03:57:27,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:57:27,451 INFO L225 Difference]: With dead ends: 26 [2023-02-18 03:57:27,451 INFO L226 Difference]: Without dead ends: 22 [2023-02-18 03:57:27,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-18 03:57:27,453 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 03:57:27,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 45 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 03:57:27,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-18 03:57:27,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-18 03:57:27,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 03:57:27,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2023-02-18 03:57:27,458 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 9 [2023-02-18 03:57:27,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:57:27,459 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2023-02-18 03:57:27,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 03:57:27,459 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2023-02-18 03:57:27,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-18 03:57:27,459 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:57:27,459 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:57:27,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 03:57:27,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-02-18 03:57:27,662 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:57:27,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:57:27,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1781398469, now seen corresponding path program 1 times [2023-02-18 03:57:27,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:57:27,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855432831] [2023-02-18 03:57:27,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:57:27,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:57:27,674 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:57:27,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [321345687] [2023-02-18 03:57:27,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:57:27,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:57:27,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:57:27,675 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 03:57:27,677 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 03:57:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:57:27,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 03:57:27,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:57:27,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 03:57:27,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:57:27,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 03:57:27,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:57:27,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855432831] [2023-02-18 03:57:27,890 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:57:27,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321345687] [2023-02-18 03:57:27,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321345687] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 03:57:27,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 03:57:27,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2023-02-18 03:57:27,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530929881] [2023-02-18 03:57:27,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 03:57:27,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 03:57:27,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:57:27,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 03:57:27,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-02-18 03:57:27,893 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 03:57:27,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:57:27,974 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2023-02-18 03:57:27,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 03:57:27,974 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2023-02-18 03:57:27,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:57:27,977 INFO L225 Difference]: With dead ends: 33 [2023-02-18 03:57:27,977 INFO L226 Difference]: Without dead ends: 27 [2023-02-18 03:57:27,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-02-18 03:57:27,980 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 03:57:27,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 58 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 03:57:27,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-18 03:57:27,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2023-02-18 03:57:27,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 03:57:27,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2023-02-18 03:57:27,994 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 16 [2023-02-18 03:57:27,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:57:27,994 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2023-02-18 03:57:27,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 03:57:27,995 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2023-02-18 03:57:27,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-18 03:57:27,995 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:57:27,995 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:57:28,002 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 03:57:28,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:57:28,206 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:57:28,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:57:28,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1711372296, now seen corresponding path program 1 times [2023-02-18 03:57:28,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:57:28,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566749456] [2023-02-18 03:57:28,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:57:28,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:57:28,213 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:57:28,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [411806344] [2023-02-18 03:57:28,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:57:28,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:57:28,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:57:28,214 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 03:57:28,216 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 03:57:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:57:28,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-18 03:57:28,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:57:28,319 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 03:57:28,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:57:42,046 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8|))) (or (= (+ (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8|) (- .cse0)) 0) (= (mod (+ .cse0 (* 2 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8|)) 4) 0))))) is different from true [2023-02-18 03:57:48,515 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8|))) (or (= (+ (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8|) (- .cse0)) 0) (= (mod (+ .cse0 (* 2 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8|)) 4) 0)))) (= c___VERIFIER_assert_~cond 0)) is different from true [2023-02-18 03:57:50,530 WARN L837 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1| 1))) (+ (* |ULTIMATE.start_main_~k~0#1| .cse0) (- (* .cse0 .cse0)))) 0) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|)))) is different from false [2023-02-18 03:57:50,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:57:50,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566749456] [2023-02-18 03:57:50,537 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:57:50,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411806344] [2023-02-18 03:57:50,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411806344] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 03:57:50,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 03:57:50,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2023-02-18 03:57:50,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893449427] [2023-02-18 03:57:50,538 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 03:57:50,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 03:57:50,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:57:50,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 03:57:50,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=120, Unknown=6, NotChecked=72, Total=240 [2023-02-18 03:57:50,539 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 03:57:50,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:57:50,605 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2023-02-18 03:57:50,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 03:57:50,606 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2023-02-18 03:57:50,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:57:50,607 INFO L225 Difference]: With dead ends: 31 [2023-02-18 03:57:50,607 INFO L226 Difference]: Without dead ends: 26 [2023-02-18 03:57:50,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=62, Invalid=184, Unknown=6, NotChecked=90, Total=342 [2023-02-18 03:57:50,608 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 03:57:50,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 60 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 03:57:50,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-18 03:57:50,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-02-18 03:57:50,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 03:57:50,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2023-02-18 03:57:50,617 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 22 [2023-02-18 03:57:50,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:57:50,617 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2023-02-18 03:57:50,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 03:57:50,618 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2023-02-18 03:57:50,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-18 03:57:50,619 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:57:50,619 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:57:50,626 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 03:57:50,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:57:50,824 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:57:50,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:57:50,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1075497887, now seen corresponding path program 2 times [2023-02-18 03:57:50,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:57:50,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910443469] [2023-02-18 03:57:50,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:57:50,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:57:50,837 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:57:50,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [151318357] [2023-02-18 03:57:50,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 03:57:50,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:57:50,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:57:50,841 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 03:57:50,843 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 03:57:50,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 03:57:50,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 03:57:50,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-18 03:57:50,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:57:50,947 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 03:57:50,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:58:05,026 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_8| Int)) (or (= (let ((.cse0 (+ |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_14| 1))) (+ (- (* .cse0 .cse0)) (* .cse0 |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_8|))) 0) (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_14| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_14|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_14| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_14| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_14| 2) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_14| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_14| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_14| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_14|)) 4) 0)))) is different from true [2023-02-18 03:58:11,050 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_8| Int)) (or (= (let ((.cse0 (+ |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_14| 1))) (+ (- (* .cse0 .cse0)) (* .cse0 |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_8|))) 0) (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_14| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_14|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_14| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_14| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_14| 2) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_14| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_14| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_14| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_14|)) 4) 0))) (= c___VERIFIER_assert_~cond 0)) is different from true [2023-02-18 03:58:13,058 WARN L837 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~c~0#1| 1))) (or (< (+ 1 .cse0) |ULTIMATE.start_main_~k~0#1|) (= (let ((.cse1 (+ 1 (+ |c_ULTIMATE.start_main_~y~0#1| 1)))) (+ (* .cse1 |ULTIMATE.start_main_~k~0#1|) (- (* .cse1 .cse1)))) 0) (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (not (< .cse0 |ULTIMATE.start_main_~k~0#1|)))))) is different from false [2023-02-18 03:58:13,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:58:13,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910443469] [2023-02-18 03:58:13,067 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:58:13,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151318357] [2023-02-18 03:58:13,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151318357] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 03:58:13,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 03:58:13,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2023-02-18 03:58:13,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801009414] [2023-02-18 03:58:13,068 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 03:58:13,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 03:58:13,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:58:13,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 03:58:13,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=170, Unknown=5, NotChecked=84, Total=306 [2023-02-18 03:58:13,069 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 03:58:13,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:58:13,165 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2023-02-18 03:58:13,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 03:58:13,165 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2023-02-18 03:58:13,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:58:13,166 INFO L225 Difference]: With dead ends: 34 [2023-02-18 03:58:13,166 INFO L226 Difference]: Without dead ends: 29 [2023-02-18 03:58:13,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=66, Invalid=247, Unknown=5, NotChecked=102, Total=420 [2023-02-18 03:58:13,167 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 03:58:13,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 76 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 03:58:13,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-18 03:58:13,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-18 03:58:13,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 03:58:13,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2023-02-18 03:58:13,171 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2023-02-18 03:58:13,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:58:13,172 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2023-02-18 03:58:13,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 03:58:13,172 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2023-02-18 03:58:13,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-18 03:58:13,173 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:58:13,173 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:58:13,181 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 03:58:13,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:58:13,374 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:58:13,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:58:13,374 INFO L85 PathProgramCache]: Analyzing trace with hash 817917912, now seen corresponding path program 3 times [2023-02-18 03:58:13,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:58:13,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001845916] [2023-02-18 03:58:13,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:58:13,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:58:13,380 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:58:13,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1215346848] [2023-02-18 03:58:13,380 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 03:58:13,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:58:13,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:58:13,381 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 03:58:13,383 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 03:58:13,431 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-18 03:58:13,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 03:58:13,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-18 03:58:13,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:58:13,506 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 16 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-18 03:58:13,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:58:26,844 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_20| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_20| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_20|))) (or (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_20| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_20| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_20| 2) .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_20| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_20| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_20| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_20|)) 4) 0) (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_20| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_11|) (- .cse0)) 0))))) is different from true [2023-02-18 03:58:32,863 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (= c___VERIFIER_assert_~cond 0) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_20| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_20| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_20|))) (or (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_20| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_20| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_20| 2) .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_20| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_20| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_20| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_20|)) 4) 0) (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_20| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_11|) (- .cse0)) 0))))) is different from true [2023-02-18 03:58:34,869 WARN L837 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1| 1))) (+ (* |ULTIMATE.start_main_~k~0#1| .cse0) (- (* .cse0 .cse0)))) 0) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|)))) is different from false [2023-02-18 03:58:34,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:58:34,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001845916] [2023-02-18 03:58:34,874 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:58:34,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215346848] [2023-02-18 03:58:34,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215346848] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 03:58:34,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 03:58:34,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-02-18 03:58:34,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321709106] [2023-02-18 03:58:34,875 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 03:58:34,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 03:58:34,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:58:34,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 03:58:34,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=170, Unknown=6, NotChecked=84, Total=306 [2023-02-18 03:58:34,876 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 03:58:34,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:58:34,992 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2023-02-18 03:58:34,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 03:58:34,993 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2023-02-18 03:58:34,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:58:34,993 INFO L225 Difference]: With dead ends: 37 [2023-02-18 03:58:34,993 INFO L226 Difference]: Without dead ends: 32 [2023-02-18 03:58:34,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=66, Invalid=246, Unknown=6, NotChecked=102, Total=420 [2023-02-18 03:58:34,994 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 03:58:34,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 85 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 03:58:34,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-18 03:58:34,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-18 03:58:34,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-18 03:58:34,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2023-02-18 03:58:34,999 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 36 [2023-02-18 03:58:34,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:58:34,999 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2023-02-18 03:58:34,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 03:58:35,000 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2023-02-18 03:58:35,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-18 03:58:35,000 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:58:35,000 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:58:35,017 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 03:58:35,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:58:35,201 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:58:35,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:58:35,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1384689793, now seen corresponding path program 4 times [2023-02-18 03:58:35,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:58:35,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511510683] [2023-02-18 03:58:35,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:58:35,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:58:35,207 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:58:35,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [975648757] [2023-02-18 03:58:35,207 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 03:58:35,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:58:35,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:58:35,211 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 03:58:35,211 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 03:58:35,245 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 03:58:35,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 03:58:35,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-18 03:58:35,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:58:37,294 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (+ (+ 0 1) 1) 1))) (let ((.cse0 (+ .cse1 1))) (and (<= |c_ULTIMATE.start_main_~c~0#1| .cse0) (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0) (= |c_ULTIMATE.start_main_~y~0#1| .cse0) (< .cse1 |c_ULTIMATE.start_main_~k~0#1|)))) is different from true [2023-02-18 03:58:37,319 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 21 proven. 27 refuted. 0 times theorem prover too weak. 28 trivial. 4 not checked. [2023-02-18 03:58:37,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:58:50,906 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_27| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_14| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_27| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_27|))) (or (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_27| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_27| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_27| 2) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_27| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_27| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_27| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_27|) .cse0) 4) 0) (= (+ (- .cse0) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_27| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_14|)) 0))))) is different from true [2023-02-18 03:58:56,921 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_27| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_14| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_27| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_27|))) (or (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_27| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_27| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_27| 2) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_27| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_27| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_27| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_27|) .cse0) 4) 0) (= (+ (- .cse0) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_27| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_14|)) 0)))) (= c___VERIFIER_assert_~cond 0)) is different from true [2023-02-18 03:58:58,927 WARN L837 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1| 1))) (+ (* |ULTIMATE.start_main_~k~0#1| .cse0) (- (* .cse0 .cse0)))) 0) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|)))) is different from false [2023-02-18 03:58:58,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:58:58,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511510683] [2023-02-18 03:58:58,931 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:58:58,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975648757] [2023-02-18 03:58:58,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975648757] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 03:58:58,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 03:58:58,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2023-02-18 03:58:58,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503878437] [2023-02-18 03:58:58,932 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 03:58:58,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-18 03:58:58,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:58:58,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 03:58:58,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=199, Unknown=7, NotChecked=124, Total=380 [2023-02-18 03:58:58,933 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-18 03:59:00,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 03:59:02,977 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 03:59:05,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 03:59:05,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:59:05,062 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2023-02-18 03:59:05,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 03:59:05,063 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 43 [2023-02-18 03:59:05,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:59:05,063 INFO L225 Difference]: With dead ends: 40 [2023-02-18 03:59:05,063 INFO L226 Difference]: Without dead ends: 35 [2023-02-18 03:59:05,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=63, Invalid=252, Unknown=7, NotChecked=140, Total=462 [2023-02-18 03:59:05,064 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2023-02-18 03:59:05,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 114 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 198 Invalid, 3 Unknown, 33 Unchecked, 6.1s Time] [2023-02-18 03:59:05,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-18 03:59:05,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-02-18 03:59:05,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-18 03:59:05,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-02-18 03:59:05,078 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 43 [2023-02-18 03:59:05,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:59:05,079 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-02-18 03:59:05,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-18 03:59:05,079 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-02-18 03:59:05,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-18 03:59:05,080 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:59:05,080 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:59:05,087 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 03:59:05,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:59:05,288 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:59:05,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:59:05,288 INFO L85 PathProgramCache]: Analyzing trace with hash -23130184, now seen corresponding path program 5 times [2023-02-18 03:59:05,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:59:05,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505845019] [2023-02-18 03:59:05,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:59:05,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:59:05,303 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:59:05,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1657608034] [2023-02-18 03:59:05,303 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-18 03:59:05,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:59:05,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:59:05,304 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 03:59:05,306 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 03:59:05,365 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-02-18 03:59:05,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 03:59:05,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-18 03:59:05,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:59:05,448 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 14 proven. 58 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-02-18 03:59:05,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:59:05,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:59:05,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505845019] [2023-02-18 03:59:05,503 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:59:05,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657608034] [2023-02-18 03:59:05,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657608034] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 03:59:05,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 03:59:05,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2023-02-18 03:59:05,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945181551] [2023-02-18 03:59:05,504 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 03:59:05,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-18 03:59:05,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:59:05,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 03:59:05,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2023-02-18 03:59:05,505 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-18 03:59:05,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:59:05,662 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2023-02-18 03:59:05,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 03:59:05,663 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2023-02-18 03:59:05,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:59:05,663 INFO L225 Difference]: With dead ends: 43 [2023-02-18 03:59:05,663 INFO L226 Difference]: Without dead ends: 38 [2023-02-18 03:59:05,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2023-02-18 03:59:05,664 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 03:59:05,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 136 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 03:59:05,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-18 03:59:05,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-02-18 03:59:05,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 03:59:05,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2023-02-18 03:59:05,669 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 50 [2023-02-18 03:59:05,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:59:05,670 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2023-02-18 03:59:05,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-18 03:59:05,670 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2023-02-18 03:59:05,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-18 03:59:05,671 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:59:05,671 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:59:05,677 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 03:59:05,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-02-18 03:59:05,878 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:59:05,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:59:05,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1898941279, now seen corresponding path program 6 times [2023-02-18 03:59:05,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:59:05,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762717861] [2023-02-18 03:59:05,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:59:05,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:59:05,884 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:59:05,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1207344781] [2023-02-18 03:59:05,884 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-18 03:59:05,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:59:05,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:59:05,885 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 03:59:05,887 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 03:59:05,991 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-02-18 03:59:05,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 03:59:05,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 43 conjunts are in the unsatisfiable core [2023-02-18 03:59:05,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:59:08,041 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 1))) (and (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0) (= |c_ULTIMATE.start_main_~y~0#1| (+ 5 1)) (<= |c_ULTIMATE.start_main_~c~0#1| (+ .cse0 1)) (< .cse0 |c_ULTIMATE.start_main_~k~0#1|) (< 1 |c_ULTIMATE.start_main_~k~0#1|))) is different from true [2023-02-18 03:59:08,073 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 31 proven. 58 refuted. 0 times theorem prover too weak. 66 trivial. 6 not checked. [2023-02-18 03:59:08,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:59:18,140 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_24| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44|))) (or (= (mod (+ .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| 2) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44|)) 4) 0) (= (+ (- .cse0) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_24|)) 0))))) is different from true [2023-02-18 03:59:24,161 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_24| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44|))) (or (= (mod (+ .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| 2) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44|)) 4) 0) (= (+ (- .cse0) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_24|)) 0)))) (= c___VERIFIER_assert_~cond 0)) is different from true [2023-02-18 03:59:26,193 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~c~0#1| 1))) (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0)) (= (let ((.cse0 (+ 1 (+ |c_ULTIMATE.start_main_~y~0#1| 1)))) (+ (* .cse0 |c_ULTIMATE.start_main_~k~0#1|) (- (* .cse0 .cse0)))) 0) (< (+ 1 .cse1) |c_ULTIMATE.start_main_~k~0#1|) (not (< .cse1 |c_ULTIMATE.start_main_~k~0#1|)))) is different from false [2023-02-18 03:59:28,204 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1 (+ |c_ULTIMATE.start_main_~c~0#1| 1)))) (or (= (let ((.cse0 (+ (+ 1 (+ |c_ULTIMATE.start_main_~y~0#1| 1)) 1))) (+ (* .cse0 |c_ULTIMATE.start_main_~k~0#1|) (- (* .cse0 .cse0)))) 0) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0)) (not (< .cse1 |c_ULTIMATE.start_main_~k~0#1|)) (< (+ .cse1 1) |c_ULTIMATE.start_main_~k~0#1|))) is different from false [2023-02-18 03:59:30,216 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (+ 1 (+ |c_ULTIMATE.start_main_~c~0#1| 1)) 1))) (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0)) (= (let ((.cse0 (+ (+ (+ 1 (+ |c_ULTIMATE.start_main_~y~0#1| 1)) 1) 1))) (+ (* .cse0 |c_ULTIMATE.start_main_~k~0#1|) (- (* .cse0 .cse0)))) 0) (< (+ 1 .cse1) |c_ULTIMATE.start_main_~k~0#1|) (not (< .cse1 |c_ULTIMATE.start_main_~k~0#1|)))) is different from false [2023-02-18 03:59:32,228 WARN L837 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (let ((.cse1 (+ 1 (+ (+ 1 (+ |c_ULTIMATE.start_main_~c~0#1| 1)) 1)))) (or (= (let ((.cse0 (+ (+ (+ (+ 1 (+ |c_ULTIMATE.start_main_~y~0#1| 1)) 1) 1) 1))) (+ (- (* .cse0 .cse0)) (* |ULTIMATE.start_main_~k~0#1| .cse0))) 0) (< (+ .cse1 1) |ULTIMATE.start_main_~k~0#1|) (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (not (< .cse1 |ULTIMATE.start_main_~k~0#1|)))))) is different from false [2023-02-18 03:59:32,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:59:32,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762717861] [2023-02-18 03:59:32,232 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:59:32,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207344781] [2023-02-18 03:59:32,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207344781] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 03:59:32,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 03:59:32,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2023-02-18 03:59:32,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184104184] [2023-02-18 03:59:32,233 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 03:59:32,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 03:59:32,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:59:32,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 03:59:32,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=291, Unknown=9, NotChecked=280, Total=650 [2023-02-18 03:59:32,234 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 03:59:34,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 03:59:36,274 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 03:59:38,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 03:59:40,320 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 03:59:42,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 03:59:44,385 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 03:59:46,404 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 03:59:46,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:59:46,407 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2023-02-18 03:59:46,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-18 03:59:46,407 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 57 [2023-02-18 03:59:46,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:59:46,408 INFO L225 Difference]: With dead ends: 46 [2023-02-18 03:59:46,408 INFO L226 Difference]: Without dead ends: 41 [2023-02-18 03:59:46,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=83, Invalid=356, Unknown=9, NotChecked=308, Total=756 [2023-02-18 03:59:46,408 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2023-02-18 03:59:46,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 148 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 284 Invalid, 7 Unknown, 41 Unchecked, 14.1s Time] [2023-02-18 03:59:46,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-02-18 03:59:46,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-02-18 03:59:46,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-18 03:59:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2023-02-18 03:59:46,414 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 57 [2023-02-18 03:59:46,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:59:46,414 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2023-02-18 03:59:46,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 03:59:46,415 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2023-02-18 03:59:46,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-18 03:59:46,415 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:59:46,415 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:59:46,423 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 03:59:46,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:59:46,616 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:59:46,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:59:46,616 INFO L85 PathProgramCache]: Analyzing trace with hash 385378200, now seen corresponding path program 7 times [2023-02-18 03:59:46,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:59:46,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016328689] [2023-02-18 03:59:46,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:59:46,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:59:46,622 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:59:46,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [515891088] [2023-02-18 03:59:46,622 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-18 03:59:46,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:59:46,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:59:46,623 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 03:59:46,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-18 03:59:46,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:59:46,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-18 03:59:46,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:59:46,784 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 36 proven. 85 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-02-18 03:59:46,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:59:48,818 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (not (= (mod (+ .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0)) (< |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~k~0#1|) (= (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~k~0#1|) (- .cse0)) 0))) is different from false [2023-02-18 03:59:52,849 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_58| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_37| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_58| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_58|))) (or (= (+ (- .cse0) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_58| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_37|)) 0) (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_58| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_58| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_58| 2) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_58| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_58| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_58| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_58|) .cse0) 4) 0))))) is different from true [2023-02-18 03:59:58,863 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_58| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_37| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_58| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_58|))) (or (= (+ (- .cse0) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_58| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_37|)) 0) (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_58| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_58| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_58| 2) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_58| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_58| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_58| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_58|) .cse0) 4) 0)))) (= c___VERIFIER_assert_~cond 0)) is different from true [2023-02-18 04:00:00,867 WARN L837 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0)) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1| 1))) (+ (- (* .cse0 .cse0)) (* |c_ULTIMATE.start_main_~k~0#1| .cse0))) 0) (not (< |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~k~0#1|)) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |c_ULTIMATE.start_main_~k~0#1|)) is different from false [2023-02-18 04:00:46,967 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (+ 1 (+ |c_ULTIMATE.start_main_~c~0#1| 1)) 1))) (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0)) (= (let ((.cse0 (+ (+ (+ 1 (+ |c_ULTIMATE.start_main_~y~0#1| 1)) 1) 1))) (+ (* .cse0 |c_ULTIMATE.start_main_~k~0#1|) (- (* .cse0 .cse0)))) 0) (< (+ 1 .cse1) |c_ULTIMATE.start_main_~k~0#1|) (not (< .cse1 |c_ULTIMATE.start_main_~k~0#1|)))) is different from false [2023-02-18 04:00:48,978 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 1 (+ (+ 1 (+ |c_ULTIMATE.start_main_~c~0#1| 1)) 1)))) (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0)) (< (+ .cse0 1) |c_ULTIMATE.start_main_~k~0#1|) (not (< .cse0 |c_ULTIMATE.start_main_~k~0#1|)) (= (let ((.cse1 (+ (+ (+ (+ 1 (+ |c_ULTIMATE.start_main_~y~0#1| 1)) 1) 1) 1))) (+ (* .cse1 |c_ULTIMATE.start_main_~k~0#1|) (- (* .cse1 .cse1)))) 0))) is different from false [2023-02-18 04:00:50,991 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (+ 1 (+ (+ 1 (+ |c_ULTIMATE.start_main_~c~0#1| 1)) 1)) 1))) (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0)) (= (let ((.cse0 (+ (+ (+ (+ (+ 1 (+ |c_ULTIMATE.start_main_~y~0#1| 1)) 1) 1) 1) 1))) (+ (- (* .cse0 .cse0)) (* |c_ULTIMATE.start_main_~k~0#1| .cse0))) 0) (< (+ .cse1 1) |c_ULTIMATE.start_main_~k~0#1|) (not (< .cse1 |c_ULTIMATE.start_main_~k~0#1|)))) is different from false [2023-02-18 04:00:53,015 WARN L837 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (let ((.cse1 (+ (+ (+ 1 (+ (+ 1 (+ |c_ULTIMATE.start_main_~c~0#1| 1)) 1)) 1) 1))) (or (= (let ((.cse0 (+ 1 (+ (+ (+ (+ (+ 1 (+ |c_ULTIMATE.start_main_~y~0#1| 1)) 1) 1) 1) 1)))) (+ (* .cse0 |ULTIMATE.start_main_~k~0#1|) (- (* .cse0 .cse0)))) 0) (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse1 1) |ULTIMATE.start_main_~k~0#1|) (not (< .cse1 |ULTIMATE.start_main_~k~0#1|)))))) is different from false [2023-02-18 04:00:53,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:00:53,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016328689] [2023-02-18 04:00:53,019 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 04:00:53,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515891088] [2023-02-18 04:00:53,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515891088] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:00:53,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 04:00:53,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2023-02-18 04:00:53,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613793546] [2023-02-18 04:00:53,020 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 04:00:53,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 04:00:53,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:00:53,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 04:00:53,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=319, Unknown=17, NotChecked=344, Total=756 [2023-02-18 04:00:53,021 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-18 04:00:55,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:00:55,242 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2023-02-18 04:00:55,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-18 04:00:55,242 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 64 [2023-02-18 04:00:55,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:00:55,243 INFO L225 Difference]: With dead ends: 49 [2023-02-18 04:00:55,243 INFO L226 Difference]: Without dead ends: 44 [2023-02-18 04:00:55,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 62.2s TimeCoverageRelationStatistics Valid=95, Invalid=425, Unknown=18, NotChecked=392, Total=930 [2023-02-18 04:00:55,244 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 04:00:55,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 173 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 04:00:55,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-18 04:00:55,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-02-18 04:00:55,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-18 04:00:55,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2023-02-18 04:00:55,250 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 64 [2023-02-18 04:00:55,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:00:55,251 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2023-02-18 04:00:55,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-18 04:00:55,251 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2023-02-18 04:00:55,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-18 04:00:55,252 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:00:55,252 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:00:55,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-18 04:00:55,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-18 04:00:55,458 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:00:55,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:00:55,458 INFO L85 PathProgramCache]: Analyzing trace with hash 2073985217, now seen corresponding path program 8 times [2023-02-18 04:00:55,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:00:55,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576622534] [2023-02-18 04:00:55,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:00:55,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:00:55,475 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 04:00:55,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1395924907] [2023-02-18 04:00:55,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 04:00:55,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:00:55,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:00:55,476 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:00:55,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-18 04:00:55,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 04:00:55,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:00:55,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-18 04:00:55,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:00:55,689 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 23 proven. 127 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-02-18 04:00:55,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:00:55,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:00:55,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576622534] [2023-02-18 04:00:55,799 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 04:00:55,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395924907] [2023-02-18 04:00:55,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395924907] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:00:55,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 04:00:55,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2023-02-18 04:00:55,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600733541] [2023-02-18 04:00:55,800 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 04:00:55,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 04:00:55,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:00:55,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 04:00:55,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2023-02-18 04:00:55,801 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-18 04:00:56,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:00:56,088 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2023-02-18 04:00:56,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-18 04:00:56,088 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 71 [2023-02-18 04:00:56,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:00:56,089 INFO L225 Difference]: With dead ends: 52 [2023-02-18 04:00:56,089 INFO L226 Difference]: Without dead ends: 47 [2023-02-18 04:00:56,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2023-02-18 04:00:56,090 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 04:00:56,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 214 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 04:00:56,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-18 04:00:56,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-02-18 04:00:56,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 11 states have call successors, (11), 3 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 04:00:56,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2023-02-18 04:00:56,101 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 71 [2023-02-18 04:00:56,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:00:56,102 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2023-02-18 04:00:56,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-18 04:00:56,102 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2023-02-18 04:00:56,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-02-18 04:00:56,104 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:00:56,104 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:00:56,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-18 04:00:56,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-18 04:00:56,309 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:00:56,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:00:56,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1353348984, now seen corresponding path program 9 times [2023-02-18 04:00:56,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:00:56,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967793030] [2023-02-18 04:00:56,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:00:56,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:00:56,315 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 04:00:56,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2119574195] [2023-02-18 04:00:56,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 04:00:56,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:00:56,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:00:56,316 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:00:56,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-18 04:00:56,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2023-02-18 04:00:56,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:00:56,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 61 conjunts are in the unsatisfiable core [2023-02-18 04:00:56,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:01:00,372 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 63 proven. 140 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2023-02-18 04:01:00,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:01:05,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:01:05,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967793030] [2023-02-18 04:01:05,705 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 04:01:05,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119574195] [2023-02-18 04:01:05,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119574195] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:01:05,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 04:01:05,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2023-02-18 04:01:05,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92620705] [2023-02-18 04:01:05,705 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 04:01:05,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-18 04:01:05,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:01:05,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-18 04:01:05,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=521, Unknown=2, NotChecked=0, Total=600 [2023-02-18 04:01:05,707 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 16 states have internal predecessors, (33), 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 04:01:07,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 04:01:08,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 04:01:12,684 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 04:01:14,717 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 04:01:16,359 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 04:01:18,381 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 04:01:20,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 04:01:22,529 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 04:01:24,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 04:01:26,548 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 04:01:28,590 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 04:01:30,443 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 04:01:30,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:01:30,444 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2023-02-18 04:01:30,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-18 04:01:30,444 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 16 states have internal predecessors, (33), 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) Word has length 78 [2023-02-18 04:01:30,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:01:30,445 INFO L225 Difference]: With dead ends: 59 [2023-02-18 04:01:30,445 INFO L226 Difference]: Without dead ends: 54 [2023-02-18 04:01:30,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=100, Invalid=654, Unknown=2, NotChecked=0, Total=756 [2023-02-18 04:01:30,446 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 2 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.9s IncrementalHoareTripleChecker+Time [2023-02-18 04:01:30,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 271 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 604 Invalid, 7 Unknown, 0 Unchecked, 22.9s Time] [2023-02-18 04:01:30,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-02-18 04:01:30,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-02-18 04:01:30,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-18 04:01:30,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2023-02-18 04:01:30,471 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 78 [2023-02-18 04:01:30,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:01:30,471 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2023-02-18 04:01:30,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 16 states have internal predecessors, (33), 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 04:01:30,472 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2023-02-18 04:01:30,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-02-18 04:01:30,476 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:01:30,476 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:01:30,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-18 04:01:30,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-18 04:01:30,681 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:01:30,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:01:30,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1817498849, now seen corresponding path program 10 times [2023-02-18 04:01:30,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:01:30,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418677731] [2023-02-18 04:01:30,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:01:30,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:01:30,687 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 04:01:30,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1167499877] [2023-02-18 04:01:30,687 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 04:01:30,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:01:30,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:01:30,689 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:01:30,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-18 04:01:30,826 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 04:01:30,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:01:30,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 62 conjunts are in the unsatisfiable core [2023-02-18 04:01:30,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:01:31,038 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 74 proven. 167 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2023-02-18 04:01:31,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:01:57,153 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~y~0#1| 1))) (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (.cse1 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (.cse3 (* .cse2 .cse2))) (or (not (= (mod (+ .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) .cse1) 4) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (= (+ (* |ULTIMATE.start_main_~k~0#1| .cse2) (- .cse3)) 0) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|))) (not (let ((.cse4 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (>= (+ (div (+ (* .cse0 13) .cse1 (* 6 .cse4)) 4) (* |c_ULTIMATE.start_main_~y~0#1| 3) 1) (+ (div (+ (* 2 .cse4) .cse0 .cse1) 4) (* .cse3 .cse2)))))))) is different from false [2023-02-18 04:01:57,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:01:57,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418677731] [2023-02-18 04:01:57,155 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 04:01:57,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167499877] [2023-02-18 04:01:57,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167499877] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:01:57,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 04:01:57,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2023-02-18 04:01:57,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849962897] [2023-02-18 04:01:57,155 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 04:01:57,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-18 04:01:57,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:01:57,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-18 04:01:57,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=567, Unknown=5, NotChecked=48, Total=702 [2023-02-18 04:01:57,156 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 17 states have internal predecessors, (35), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-18 04:01:59,168 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 04:02:01,179 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 04:02:03,185 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 04:02:05,301 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 04:02:07,357 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 04:02:09,377 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 04:02:11,555 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 04:02:13,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:02:13,737 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2023-02-18 04:02:13,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-18 04:02:13,737 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 17 states have internal predecessors, (35), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 85 [2023-02-18 04:02:13,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:02:13,738 INFO L225 Difference]: With dead ends: 62 [2023-02-18 04:02:13,738 INFO L226 Difference]: Without dead ends: 57 [2023-02-18 04:02:13,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 28.3s TimeCoverageRelationStatistics Valid=105, Invalid=706, Unknown=5, NotChecked=54, Total=870 [2023-02-18 04:02:13,738 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2023-02-18 04:02:13,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 291 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 683 Invalid, 7 Unknown, 0 Unchecked, 14.5s Time] [2023-02-18 04:02:13,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-18 04:02:13,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-02-18 04:02:13,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-02-18 04:02:13,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2023-02-18 04:02:13,747 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 85 [2023-02-18 04:02:13,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:02:13,747 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2023-02-18 04:02:13,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 17 states have internal predecessors, (35), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-18 04:02:13,748 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2023-02-18 04:02:13,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-02-18 04:02:13,748 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:02:13,749 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:02:13,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-18 04:02:13,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-18 04:02:13,954 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:02:13,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:02:13,954 INFO L85 PathProgramCache]: Analyzing trace with hash 638795608, now seen corresponding path program 11 times [2023-02-18 04:02:13,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:02:13,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709365661] [2023-02-18 04:02:13,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:02:13,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:02:13,959 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 04:02:13,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1522950435] [2023-02-18 04:02:13,960 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-18 04:02:13,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:02:13,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:02:13,961 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:02:13,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-18 04:02:14,056 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2023-02-18 04:02:14,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:02:14,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 61 conjunts are in the unsatisfiable core [2023-02-18 04:02:14,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:02:16,101 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 0 1))) (and (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0) (= |c_ULTIMATE.start_main_~y~0#1| (+ 5 1)) (< .cse0 |c_ULTIMATE.start_main_~k~0#1|) (= (+ .cse0 1) (+ (- 1) (+ (- 1) (+ (- 1) (+ |c_ULTIMATE.start_main_~c~0#1| (- 1)))))))) is different from true [2023-02-18 04:02:16,202 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 41 proven. 203 refuted. 0 times theorem prover too weak. 231 trivial. 11 not checked. [2023-02-18 04:02:16,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:02:28,455 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_69| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_119| Int)) (or (= (let ((.cse0 (+ (+ (+ (+ (+ |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_119| 1) 1) 1) 1) 1))) (+ (- (* .cse0 .cse0)) (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_69| .cse0))) 0) (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_119| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_119|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_119| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_119| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_119| 2) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_119| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_119| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_119| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_119|)) 4) 0)))) is different from true [2023-02-18 04:02:34,489 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_69| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_119| Int)) (or (= (let ((.cse0 (+ (+ (+ (+ (+ |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_119| 1) 1) 1) 1) 1))) (+ (- (* .cse0 .cse0)) (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_69| .cse0))) 0) (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_119| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_119|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_119| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_119| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_119| 2) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_119| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_119| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_119| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_119|)) 4) 0))) (= c___VERIFIER_assert_~cond 0)) is different from true [2023-02-18 04:02:52,546 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (+ (+ 1 (+ (+ 1 (+ |c_ULTIMATE.start_main_~c~0#1| 1)) 1)) 1) 1))) (or (< (+ .cse0 1) |c_ULTIMATE.start_main_~k~0#1|) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0)) (= (let ((.cse1 (+ 1 (+ (+ (+ (+ (+ 1 (+ |c_ULTIMATE.start_main_~y~0#1| 1)) 1) 1) 1) 1)))) (+ (- (* .cse1 .cse1)) (* .cse1 |c_ULTIMATE.start_main_~k~0#1|))) 0) (not (< .cse0 |c_ULTIMATE.start_main_~k~0#1|)))) is different from false [2023-02-18 04:03:10,111 WARN L837 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (let ((.cse0 (+ (+ (+ (+ (+ (+ 1 (+ (+ 1 (+ |c_ULTIMATE.start_main_~c~0#1| 1)) 1)) 1) 1) 1) 1) 1))) (or (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (not (< .cse0 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse0 1) |ULTIMATE.start_main_~k~0#1|) (= (let ((.cse1 (+ (+ (+ (+ 1 (+ (+ (+ (+ (+ 1 (+ |c_ULTIMATE.start_main_~y~0#1| 1)) 1) 1) 1) 1)) 1) 1) 1))) (+ (* .cse1 |ULTIMATE.start_main_~k~0#1|) (- (* .cse1 .cse1)))) 0))))) is different from false [2023-02-18 04:03:10,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:03:10,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709365661] [2023-02-18 04:03:10,119 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 04:03:10,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522950435] [2023-02-18 04:03:10,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522950435] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:03:10,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 04:03:10,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2023-02-18 04:03:10,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967249955] [2023-02-18 04:03:10,120 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 04:03:10,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-18 04:03:10,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:03:10,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-18 04:03:10,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=764, Unknown=8, NotChecked=310, Total=1260 [2023-02-18 04:03:10,122 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-02-18 04:03:10,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:03:10,521 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2023-02-18 04:03:10,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-18 04:03:10,522 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 92 [2023-02-18 04:03:10,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:03:10,522 INFO L225 Difference]: With dead ends: 65 [2023-02-18 04:03:10,522 INFO L226 Difference]: Without dead ends: 60 [2023-02-18 04:03:10,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 50.0s TimeCoverageRelationStatistics Valid=197, Invalid=937, Unknown=8, NotChecked=340, Total=1482 [2023-02-18 04:03:10,523 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 04:03:10,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 310 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 724 Invalid, 0 Unknown, 62 Unchecked, 0.3s Time] [2023-02-18 04:03:10,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-18 04:03:10,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-02-18 04:03:10,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-02-18 04:03:10,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2023-02-18 04:03:10,533 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 92 [2023-02-18 04:03:10,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:03:10,533 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2023-02-18 04:03:10,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-02-18 04:03:10,533 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2023-02-18 04:03:10,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-02-18 04:03:10,534 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:03:10,534 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:03:10,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-18 04:03:10,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:03:10,741 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:03:10,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:03:10,742 INFO L85 PathProgramCache]: Analyzing trace with hash 550859009, now seen corresponding path program 12 times [2023-02-18 04:03:10,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:03:10,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204222095] [2023-02-18 04:03:10,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:03:10,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:03:10,747 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 04:03:10,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1960225721] [2023-02-18 04:03:10,747 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-18 04:03:10,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:03:10,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:03:10,749 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:03:10,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-18 04:03:11,054 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2023-02-18 04:03:11,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:03:11,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 64 conjunts are in the unsatisfiable core [2023-02-18 04:03:11,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:03:11,220 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 43 proven. 253 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-18 04:03:11,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:03:11,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:03:11,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204222095] [2023-02-18 04:03:11,352 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 04:03:11,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960225721] [2023-02-18 04:03:11,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960225721] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:03:11,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 04:03:11,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2023-02-18 04:03:11,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96536205] [2023-02-18 04:03:11,353 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 04:03:11,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-18 04:03:11,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:03:11,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-18 04:03:11,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2023-02-18 04:03:11,354 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-02-18 04:03:11,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:03:11,738 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2023-02-18 04:03:11,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-18 04:03:11,738 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 99 [2023-02-18 04:03:11,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:03:11,739 INFO L225 Difference]: With dead ends: 68 [2023-02-18 04:03:11,739 INFO L226 Difference]: Without dead ends: 63 [2023-02-18 04:03:11,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2023-02-18 04:03:11,740 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 04:03:11,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 328 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 04:03:11,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-18 04:03:11,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-02-18 04:03:11,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-02-18 04:03:11,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2023-02-18 04:03:11,752 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 99 [2023-02-18 04:03:11,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:03:11,753 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2023-02-18 04:03:11,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-02-18 04:03:11,753 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2023-02-18 04:03:11,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-02-18 04:03:11,754 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:03:11,754 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:03:11,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-18 04:03:11,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-18 04:03:11,959 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:03:11,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:03:11,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1794064584, now seen corresponding path program 13 times [2023-02-18 04:03:11,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:03:11,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104820153] [2023-02-18 04:03:11,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:03:11,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:03:11,965 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 04:03:11,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1942835725] [2023-02-18 04:03:11,965 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-18 04:03:11,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:03:11,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:03:11,969 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:03:11,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-18 04:03:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:03:12,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 68 conjunts are in the unsatisfiable core [2023-02-18 04:03:12,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:03:12,271 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 66 proven. 274 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-02-18 04:03:12,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:03:30,375 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_154| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_79| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_154| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_154|))) (or (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_154| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_154| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_154| 2) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_154| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_154| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_154| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_154|) .cse0) 4) 0) (= (+ (- .cse0) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_154| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_79|)) 0))))) is different from true [2023-02-18 04:03:36,388 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_154| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_79| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_154| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_154|))) (or (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_154| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_154| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_154| 2) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_154| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_154| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_154| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_154|) .cse0) 4) 0) (= (+ (- .cse0) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_154| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_79|)) 0)))) (= c___VERIFIER_assert_~cond 0)) is different from true [2023-02-18 04:03:38,407 WARN L837 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1| 1))) (+ (* |ULTIMATE.start_main_~k~0#1| .cse0) (- (* .cse0 .cse0)))) 0) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|)))) is different from false [2023-02-18 04:03:38,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:03:38,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104820153] [2023-02-18 04:03:38,410 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 04:03:38,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942835725] [2023-02-18 04:03:38,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942835725] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:03:38,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 04:03:38,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2023-02-18 04:03:38,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880771171] [2023-02-18 04:03:38,411 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 04:03:38,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-18 04:03:38,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:03:38,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-18 04:03:38,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=538, Unknown=8, NotChecked=144, Total=756 [2023-02-18 04:03:38,412 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 21 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-02-18 04:03:38,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:03:38,917 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2023-02-18 04:03:38,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-18 04:03:38,917 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 106 [2023-02-18 04:03:38,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:03:38,918 INFO L225 Difference]: With dead ends: 71 [2023-02-18 04:03:38,918 INFO L226 Difference]: Without dead ends: 66 [2023-02-18 04:03:38,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=86, Invalid=674, Unknown=8, NotChecked=162, Total=930 [2023-02-18 04:03:38,919 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 04:03:38,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 384 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 04:03:38,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-02-18 04:03:38,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2023-02-18 04:03:38,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 16 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-18 04:03:38,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2023-02-18 04:03:38,941 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 106 [2023-02-18 04:03:38,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:03:38,942 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2023-02-18 04:03:38,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-02-18 04:03:38,942 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2023-02-18 04:03:38,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-02-18 04:03:38,944 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:03:38,944 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:03:38,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-02-18 04:03:39,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-18 04:03:39,151 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:03:39,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:03:39,151 INFO L85 PathProgramCache]: Analyzing trace with hash -444443359, now seen corresponding path program 14 times [2023-02-18 04:03:39,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:03:39,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23542170] [2023-02-18 04:03:39,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:03:39,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:03:39,157 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 04:03:39,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2094337509] [2023-02-18 04:03:39,157 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 04:03:39,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:03:39,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:03:39,163 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:03:39,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-18 04:03:39,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 04:03:39,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:03:39,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 72 conjunts are in the unsatisfiable core [2023-02-18 04:03:39,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:03:41,370 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3 1))) (and (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0) (= .cse0 (+ |c_ULTIMATE.start_main_~c~0#1| (- 1))) (= (+ (- 1) |c_ULTIMATE.start_main_~y~0#1|) .cse0))) is different from true [2023-02-18 04:03:42,725 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 44 proven. 329 refuted. 0 times theorem prover too weak. 378 trivial. 14 not checked. [2023-02-18 04:03:42,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:03:43,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:03:43,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23542170] [2023-02-18 04:03:43,987 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 04:03:43,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094337509] [2023-02-18 04:03:43,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094337509] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:03:43,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 04:03:43,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2023-02-18 04:03:43,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95669778] [2023-02-18 04:03:43,987 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 04:03:43,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-18 04:03:43,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:03:43,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-18 04:03:43,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=580, Unknown=1, NotChecked=48, Total=702 [2023-02-18 04:03:43,988 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 states have internal predecessors, (43), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-18 04:03:45,990 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 04:03:48,106 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 04:03:50,141 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 04:03:52,163 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 04:03:53,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 04:03:56,061 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 04:03:56,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:03:56,259 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2023-02-18 04:03:56,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-18 04:03:56,259 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 states have internal predecessors, (43), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Word has length 113 [2023-02-18 04:03:56,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:03:56,260 INFO L225 Difference]: With dead ends: 74 [2023-02-18 04:03:56,260 INFO L226 Difference]: Without dead ends: 69 [2023-02-18 04:03:56,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=92, Invalid=723, Unknown=1, NotChecked=54, Total=870 [2023-02-18 04:03:56,260 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 7 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2023-02-18 04:03:56,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 404 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 979 Invalid, 5 Unknown, 74 Unchecked, 12.2s Time] [2023-02-18 04:03:56,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-02-18 04:03:56,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-02-18 04:03:56,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 17 states have call successors, (17), 4 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 04:03:56,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2023-02-18 04:03:56,272 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 113 [2023-02-18 04:03:56,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:03:56,272 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2023-02-18 04:03:56,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 states have internal predecessors, (43), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-18 04:03:56,272 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2023-02-18 04:03:56,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-02-18 04:03:56,273 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:03:56,273 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:03:56,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-02-18 04:03:56,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-18 04:03:56,479 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:03:56,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:03:56,479 INFO L85 PathProgramCache]: Analyzing trace with hash -16713960, now seen corresponding path program 15 times [2023-02-18 04:03:56,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:03:56,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487488816] [2023-02-18 04:03:56,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:03:56,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:03:56,487 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 04:03:56,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1734128575] [2023-02-18 04:03:56,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 04:03:56,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:03:56,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:03:56,488 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:03:56,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-18 04:03:56,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2023-02-18 04:03:56,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:03:56,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 77 conjunts are in the unsatisfiable core [2023-02-18 04:03:56,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:03:56,938 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 55 proven. 382 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-02-18 04:03:56,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:03:59,209 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (+ (+ 1 (+ (+ 1 (+ |c_ULTIMATE.start_main_~c~0#1| 1)) 1)) 1) 1))) (or (< (+ .cse0 1) |c_ULTIMATE.start_main_~k~0#1|) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0)) (= (let ((.cse1 (+ 1 (+ (+ (+ (+ (+ 1 (+ |c_ULTIMATE.start_main_~y~0#1| 1)) 1) 1) 1) 1)))) (+ (- (* .cse1 .cse1)) (* .cse1 |c_ULTIMATE.start_main_~k~0#1|))) 0) (not (< .cse0 |c_ULTIMATE.start_main_~k~0#1|)))) is different from false [2023-02-18 04:04:03,224 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_196| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_106| Int)) (or (= (let ((.cse0 (+ (+ (+ (+ 1 (+ (+ (+ |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_196| 1) 1) 1)) 1) 1) 1))) (+ (- (* .cse0 .cse0)) (* .cse0 |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_106|))) 0) (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_196| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_196|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_196| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_196| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_196| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_196|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_196| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_196| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_196| 2)) 4) 0)))) is different from true [2023-02-18 04:04:09,236 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_196| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_106| Int)) (or (= (let ((.cse0 (+ (+ (+ (+ 1 (+ (+ (+ |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_196| 1) 1) 1)) 1) 1) 1))) (+ (- (* .cse0 .cse0)) (* .cse0 |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_106|))) 0) (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_196| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_196|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_196| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_196| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_196| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_196|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_196| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_196| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_196| 2)) 4) 0))) (= c___VERIFIER_assert_~cond 0)) is different from true [2023-02-18 04:04:11,241 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (+ (+ (+ 1 (+ (+ 1 (+ |c_ULTIMATE.start_main_~c~0#1| 1)) 1)) 1) 1) 1))) (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0)) (not (< .cse0 |c_ULTIMATE.start_main_~k~0#1|)) (< (+ .cse0 1) |c_ULTIMATE.start_main_~k~0#1|) (= (let ((.cse1 (+ (+ 1 (+ (+ (+ (+ (+ 1 (+ |c_ULTIMATE.start_main_~y~0#1| 1)) 1) 1) 1) 1)) 1))) (+ (* .cse1 |c_ULTIMATE.start_main_~k~0#1|) (- (* .cse1 .cse1)))) 0))) is different from false [2023-02-18 04:05:23,258 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (+ (+ (+ (+ (+ (+ (+ (+ (+ 1 (+ (+ 1 (+ |c_ULTIMATE.start_main_~c~0#1| 1)) 1)) 1) 1) 1) 1) 1) 1) 1) 1) 1))) (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0)) (= (let ((.cse0 (+ (+ (+ (+ (+ (+ (+ (+ 1 (+ (+ (+ (+ (+ 1 (+ |c_ULTIMATE.start_main_~y~0#1| 1)) 1) 1) 1) 1)) 1) 1) 1) 1) 1) 1) 1))) (+ (* .cse0 |c_ULTIMATE.start_main_~k~0#1|) (- (* .cse0 .cse0)))) 0) (< (+ .cse1 1) |c_ULTIMATE.start_main_~k~0#1|) (not (< .cse1 |c_ULTIMATE.start_main_~k~0#1|)))) is different from false [2023-02-18 04:05:25,271 WARN L837 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (let ((.cse1 (+ (+ (+ (+ (+ (+ (+ (+ (+ (+ (+ 1 (+ (+ 1 (+ |c_ULTIMATE.start_main_~c~0#1| 1)) 1)) 1) 1) 1) 1) 1) 1) 1) 1) 1) 1))) (or (= (let ((.cse0 (+ (+ (+ (+ (+ (+ (+ (+ (+ 1 (+ (+ (+ (+ (+ 1 (+ |c_ULTIMATE.start_main_~y~0#1| 1)) 1) 1) 1) 1)) 1) 1) 1) 1) 1) 1) 1) 1))) (+ (* |ULTIMATE.start_main_~k~0#1| .cse0) (- (* .cse0 .cse0)))) 0) (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse1 1) |ULTIMATE.start_main_~k~0#1|) (not (< .cse1 |ULTIMATE.start_main_~k~0#1|)))))) is different from false [2023-02-18 04:05:25,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:05:25,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487488816] [2023-02-18 04:05:25,275 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 04:05:25,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734128575] [2023-02-18 04:05:25,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734128575] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:05:25,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 04:05:25,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2023-02-18 04:05:25,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809236451] [2023-02-18 04:05:25,276 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 04:05:25,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-18 04:05:25,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:05:25,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-18 04:05:25,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1148, Unknown=8, NotChecked=462, Total=1892 [2023-02-18 04:05:25,277 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-02-18 04:05:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:05:25,834 INFO L93 Difference]: Finished difference Result 77 states and 91 transitions. [2023-02-18 04:05:25,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-18 04:05:25,835 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Word has length 120 [2023-02-18 04:05:25,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:05:25,835 INFO L225 Difference]: With dead ends: 77 [2023-02-18 04:05:25,835 INFO L226 Difference]: Without dead ends: 72 [2023-02-18 04:05:25,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 82.4s TimeCoverageRelationStatistics Valid=293, Invalid=1363, Unknown=8, NotChecked=498, Total=2162 [2023-02-18 04:05:25,836 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 7 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 04:05:25,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 445 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 04:05:25,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-02-18 04:05:25,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-02-18 04:05:25,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-02-18 04:05:25,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2023-02-18 04:05:25,848 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 120 [2023-02-18 04:05:25,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:05:25,848 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2023-02-18 04:05:25,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-02-18 04:05:25,848 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2023-02-18 04:05:25,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-02-18 04:05:25,849 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:05:25,849 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:05:25,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-02-18 04:05:26,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-18 04:05:26,065 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:05:26,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:05:26,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1287814847, now seen corresponding path program 16 times [2023-02-18 04:05:26,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:05:26,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672711206] [2023-02-18 04:05:26,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:05:26,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:05:26,071 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 04:05:26,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [691542022] [2023-02-18 04:05:26,071 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 04:05:26,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:05:26,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:05:26,072 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:05:26,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-02-18 04:05:26,287 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 04:05:26,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:05:26,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 80 conjunts are in the unsatisfiable core [2023-02-18 04:05:26,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:05:26,493 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 81 proven. 409 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-02-18 04:05:26,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:05:28,548 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (not (= (mod (+ .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0)) (< |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~k~0#1|) (= (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~k~0#1|) (- .cse0)) 0))) is different from false [2023-02-18 04:05:32,561 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_222| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_116| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_222| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_222|))) (or (= (mod (+ .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_222| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_222| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_222| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_222|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_222| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_222| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_222| 2)) 4) 0) (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_222| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_116|) (- .cse0)) 0))))) is different from true [2023-02-18 04:05:38,576 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_222| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_116| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_222| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_222|))) (or (= (mod (+ .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_222| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_222| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_222| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_222|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_222| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_222| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_222| 2)) 4) 0) (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_222| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_116|) (- .cse0)) 0)))) (= c___VERIFIER_assert_~cond 0)) is different from true [2023-02-18 04:05:40,580 WARN L837 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1| 1))) (+ (* |ULTIMATE.start_main_~k~0#1| .cse0) (- (* .cse0 .cse0)))) 0) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|)))) is different from false [2023-02-18 04:05:40,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:05:40,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672711206] [2023-02-18 04:05:40,584 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 04:05:40,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691542022] [2023-02-18 04:05:40,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691542022] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:05:40,584 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 04:05:40,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2023-02-18 04:05:40,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417497988] [2023-02-18 04:05:40,584 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 04:05:40,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-18 04:05:40,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:05:40,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-18 04:05:40,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=647, Unknown=4, NotChecked=212, Total=930 [2023-02-18 04:05:40,585 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-02-18 04:05:41,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:05:41,225 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2023-02-18 04:05:41,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-18 04:05:41,226 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Word has length 127 [2023-02-18 04:05:41,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:05:41,227 INFO L225 Difference]: With dead ends: 80 [2023-02-18 04:05:41,227 INFO L226 Difference]: Without dead ends: 75 [2023-02-18 04:05:41,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=86, Invalid=796, Unknown=4, NotChecked=236, Total=1122 [2023-02-18 04:05:41,228 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 1291 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-18 04:05:41,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 510 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1291 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-18 04:05:41,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-18 04:05:41,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-02-18 04:05:41,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-02-18 04:05:41,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2023-02-18 04:05:41,240 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 127 [2023-02-18 04:05:41,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:05:41,241 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2023-02-18 04:05:41,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-02-18 04:05:41,241 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2023-02-18 04:05:41,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-02-18 04:05:41,241 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:05:41,242 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:05:41,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-02-18 04:05:41,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:05:41,447 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:05:41,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:05:41,447 INFO L85 PathProgramCache]: Analyzing trace with hash 146925304, now seen corresponding path program 17 times [2023-02-18 04:05:41,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:05:41,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455680363] [2023-02-18 04:05:41,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:05:41,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:05:41,453 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 04:05:41,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1197612784] [2023-02-18 04:05:41,454 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-18 04:05:41,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:05:41,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:05:41,455 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:05:41,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-02-18 04:05:41,761 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2023-02-18 04:05:41,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:05:41,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 84 conjunts are in the unsatisfiable core [2023-02-18 04:05:41,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:05:41,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 83 proven. 463 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-02-18 04:05:41,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:05:44,126 WARN L837 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1| 1))) (+ (* |ULTIMATE.start_main_~k~0#1| .cse0) (- (* .cse0 .cse0)))) 0) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|)))) is different from false [2023-02-18 04:05:44,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:05:44,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455680363] [2023-02-18 04:05:44,128 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 04:05:44,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197612784] [2023-02-18 04:05:44,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197612784] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:05:44,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 04:05:44,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2023-02-18 04:05:44,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560884332] [2023-02-18 04:05:44,129 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 04:05:44,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-18 04:05:44,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:05:44,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-18 04:05:44,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=733, Unknown=1, NotChecked=54, Total=870 [2023-02-18 04:05:44,130 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-02-18 04:05:44,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:05:44,774 INFO L93 Difference]: Finished difference Result 83 states and 99 transitions. [2023-02-18 04:05:44,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-18 04:05:44,774 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Word has length 134 [2023-02-18 04:05:44,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:05:44,775 INFO L225 Difference]: With dead ends: 83 [2023-02-18 04:05:44,775 INFO L226 Difference]: Without dead ends: 78 [2023-02-18 04:05:44,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=101, Invalid=894, Unknown=1, NotChecked=60, Total=1056 [2023-02-18 04:05:44,776 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 7 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-18 04:05:44,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 533 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1360 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-18 04:05:44,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-18 04:05:44,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-02-18 04:05:44,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-02-18 04:05:44,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2023-02-18 04:05:44,790 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 134 [2023-02-18 04:05:44,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:05:44,790 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2023-02-18 04:05:44,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-02-18 04:05:44,791 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2023-02-18 04:05:44,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-02-18 04:05:44,791 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:05:44,791 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:05:44,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-02-18 04:05:44,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:05:44,993 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:05:44,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:05:44,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1332278625, now seen corresponding path program 18 times [2023-02-18 04:05:44,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:05:44,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988193739] [2023-02-18 04:05:44,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:05:44,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:05:45,003 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 04:05:45,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [849872488] [2023-02-18 04:05:45,004 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-18 04:05:45,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:05:45,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:05:45,005 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:05:45,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-02-18 04:05:45,612 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2023-02-18 04:05:45,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:05:45,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 88 conjunts are in the unsatisfiable core [2023-02-18 04:05:45,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:05:45,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 82 proven. 523 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2023-02-18 04:05:45,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:05:46,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:05:46,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988193739] [2023-02-18 04:05:46,058 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 04:05:46,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849872488] [2023-02-18 04:05:46,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849872488] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:05:46,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 04:05:46,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2023-02-18 04:05:46,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140681668] [2023-02-18 04:05:46,058 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 04:05:46,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-18 04:05:46,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:05:46,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-18 04:05:46,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=787, Unknown=0, NotChecked=0, Total=870 [2023-02-18 04:05:46,059 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand has 26 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-02-18 04:05:46,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:05:46,795 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2023-02-18 04:05:46,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-18 04:05:46,796 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Word has length 141 [2023-02-18 04:05:46,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:05:46,797 INFO L225 Difference]: With dead ends: 86 [2023-02-18 04:05:46,797 INFO L226 Difference]: Without dead ends: 81 [2023-02-18 04:05:46,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=954, Unknown=0, NotChecked=0, Total=1056 [2023-02-18 04:05:46,798 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 1553 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-18 04:05:46,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 604 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1553 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-18 04:05:46,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-18 04:05:46,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-02-18 04:05:46,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-18 04:05:46,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2023-02-18 04:05:46,811 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 98 transitions. Word has length 141 [2023-02-18 04:05:46,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:05:46,811 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 98 transitions. [2023-02-18 04:05:46,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-02-18 04:05:46,811 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2023-02-18 04:05:46,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-02-18 04:05:46,812 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:05:46,812 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:05:46,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-02-18 04:05:47,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:05:47,018 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:05:47,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:05:47,018 INFO L85 PathProgramCache]: Analyzing trace with hash 2058456792, now seen corresponding path program 19 times [2023-02-18 04:05:47,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:05:47,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158235369] [2023-02-18 04:05:47,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:05:47,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:05:47,024 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 04:05:47,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1717691454] [2023-02-18 04:05:47,024 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-18 04:05:47,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:05:47,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:05:47,026 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:05:47,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-02-18 04:05:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:05:47,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 92 conjunts are in the unsatisfiable core [2023-02-18 04:05:47,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:05:47,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 96 proven. 571 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-02-18 04:05:47,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:05:59,627 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_125| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_285| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_285| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_285|))) (or (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_285| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_125|) (- .cse0)) 0) (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_285| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_285| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_285| 2) .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_285| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_285| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_285| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_285|)) 4) 0))))) is different from true [2023-02-18 04:06:05,637 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_125| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_285| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_285| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_285|))) (or (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_285| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_125|) (- .cse0)) 0) (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_285| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_285| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_285| 2) .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_285| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_285| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_285| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_285|)) 4) 0)))) (= c___VERIFIER_assert_~cond 0)) is different from true [2023-02-18 04:06:07,644 WARN L837 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1| 1))) (+ (* |ULTIMATE.start_main_~k~0#1| .cse0) (- (* .cse0 .cse0)))) 0) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|)))) is different from false [2023-02-18 04:06:07,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:06:07,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158235369] [2023-02-18 04:06:07,647 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 04:06:07,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717691454] [2023-02-18 04:06:07,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717691454] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:06:07,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 04:06:07,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2023-02-18 04:06:07,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897717355] [2023-02-18 04:06:07,648 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 04:06:07,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-18 04:06:07,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:06:07,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-18 04:06:07,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=858, Unknown=6, NotChecked=180, Total=1122 [2023-02-18 04:06:07,649 INFO L87 Difference]: Start difference. First operand 81 states and 98 transitions. Second operand has 27 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-18 04:06:08,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:06:08,440 INFO L93 Difference]: Finished difference Result 89 states and 107 transitions. [2023-02-18 04:06:08,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-18 04:06:08,442 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Word has length 148 [2023-02-18 04:06:08,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:06:08,443 INFO L225 Difference]: With dead ends: 89 [2023-02-18 04:06:08,443 INFO L226 Difference]: Without dead ends: 84 [2023-02-18 04:06:08,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=98, Invalid=1030, Unknown=6, NotChecked=198, Total=1332 [2023-02-18 04:06:08,443 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 1693 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-18 04:06:08,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 654 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1693 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-18 04:06:08,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-18 04:06:08,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-02-18 04:06:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-02-18 04:06:08,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2023-02-18 04:06:08,457 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 148 [2023-02-18 04:06:08,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:06:08,457 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2023-02-18 04:06:08,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-18 04:06:08,457 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2023-02-18 04:06:08,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-02-18 04:06:08,458 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:06:08,458 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:06:08,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-02-18 04:06:08,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:06:08,661 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:06:08,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:06:08,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1810280833, now seen corresponding path program 20 times [2023-02-18 04:06:08,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:06:08,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753641280] [2023-02-18 04:06:08,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:06:08,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:06:08,667 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 04:06:08,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [824733108] [2023-02-18 04:06:08,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 04:06:08,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:06:08,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:06:08,668 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:06:08,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-02-18 04:06:08,957 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 04:06:08,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:06:08,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 79 conjunts are in the unsatisfiable core [2023-02-18 04:06:08,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:06:09,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 65 proven. 667 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-02-18 04:06:09,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:06:51,343 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_320| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_160| Int)) (or (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_320| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_320| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_320| 2) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_320| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_320|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_320| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_320| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_320| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_320|)) 4) 0) (= (let ((.cse0 (+ (+ (+ (+ (+ (+ (+ (+ (+ (+ (+ (+ |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_320| 1) 1) 1) 1) 1) 1) 1) 1) 1) 1) 1) 1))) (+ (- (* .cse0 .cse0)) (* .cse0 |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_160|))) 0)))) is different from true [2023-02-18 04:06:57,358 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_320| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_160| Int)) (or (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_320| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_320| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_320| 2) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_320| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_320|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_320| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_320| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_320| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_320|)) 4) 0) (= (let ((.cse0 (+ (+ (+ (+ (+ (+ (+ (+ (+ (+ (+ (+ |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_320| 1) 1) 1) 1) 1) 1) 1) 1) 1) 1) 1) 1))) (+ (- (* .cse0 .cse0)) (* .cse0 |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_160|))) 0))) (= c___VERIFIER_assert_~cond 0)) is different from true [2023-02-18 04:08:05,437 WARN L837 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0)) (= (let ((.cse0 (+ 1 (+ (+ (+ (+ (+ (+ (+ (+ (+ 1 (+ (+ (+ (+ (+ 1 (+ |c_ULTIMATE.start_main_~y~0#1| 1)) 1) 1) 1) 1)) 1) 1) 1) 1) 1) 1) 1) 1)))) (+ (* |c_ULTIMATE.start_main_~k~0#1| .cse0) (- (* .cse0 .cse0)))) 0) (< (+ (- 15) |c_ULTIMATE.start_main_~k~0#1|) (+ |c_ULTIMATE.start_main_~c~0#1| 1))) is different from false [2023-02-18 04:08:07,447 WARN L837 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0)) (< (+ (- 16) |c_ULTIMATE.start_main_~k~0#1|) (+ |c_ULTIMATE.start_main_~c~0#1| 1)) (= (let ((.cse0 (+ (+ 1 (+ (+ (+ (+ (+ (+ (+ (+ (+ 1 (+ (+ (+ (+ (+ 1 (+ |c_ULTIMATE.start_main_~y~0#1| 1)) 1) 1) 1) 1)) 1) 1) 1) 1) 1) 1) 1) 1)) 1))) (+ (* .cse0 |c_ULTIMATE.start_main_~k~0#1|) (- (* .cse0 .cse0)))) 0)) is different from false [2023-02-18 04:09:34,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 65 proven. 513 refuted. 36 times theorem prover too weak. 780 trivial. 118 not checked. [2023-02-18 04:09:34,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:09:34,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753641280] [2023-02-18 04:09:34,391 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 04:09:34,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824733108] [2023-02-18 04:09:34,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824733108] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:09:34,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 04:09:34,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 56 [2023-02-18 04:09:34,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329708842] [2023-02-18 04:09:34,391 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 04:09:34,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-02-18 04:09:34,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:09:34,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-02-18 04:09:34,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=2251, Unknown=47, NotChecked=412, Total=3080 [2023-02-18 04:09:34,393 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand has 56 states, 56 states have (on average 1.875) internal successors, (105), 54 states have internal predecessors, (105), 42 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-02-18 04:09:36,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:09:36,400 INFO L93 Difference]: Finished difference Result 94 states and 113 transitions. [2023-02-18 04:09:36,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-18 04:09:36,401 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.875) internal successors, (105), 54 states have internal predecessors, (105), 42 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Word has length 155 [2023-02-18 04:09:36,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:09:36,401 INFO L225 Difference]: With dead ends: 94 [2023-02-18 04:09:36,401 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 04:09:36,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 253 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 200.1s TimeCoverageRelationStatistics Valid=767, Invalid=4902, Unknown=47, NotChecked=604, Total=6320 [2023-02-18 04:09:36,403 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 68 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 1869 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 2187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 259 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:09:36,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 652 Invalid, 2187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1869 Invalid, 0 Unknown, 259 Unchecked, 1.1s Time] [2023-02-18 04:09:36,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 04:09:36,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 04:09:36,403 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 04:09:36,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 04:09:36,403 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 155 [2023-02-18 04:09:36,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:09:36,403 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 04:09:36,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 1.875) internal successors, (105), 54 states have internal predecessors, (105), 42 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-02-18 04:09:36,404 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 04:09:36,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 04:09:36,405 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 04:09:36,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-02-18 04:09:36,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:09:36,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 04:09:36,627 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 04:09:36,628 INFO L895 garLoopResultBuilder]: At program point L27-2(lines 27 36) the Hoare annotation is: (let ((.cse64 (+ |ULTIMATE.start_main_~y~0#1| 1))) (let ((.cse59 (+ .cse64 1))) (let ((.cse79 (+ .cse59 1))) (let ((.cse78 (+ .cse79 1))) (let ((.cse71 (+ .cse78 1))) (let ((.cse68 (+ .cse71 1))) (let ((.cse69 (+ .cse68 1))) (let ((.cse70 (+ .cse69 1))) (let ((.cse65 (+ .cse70 1))) (let ((.cse72 (+ .cse65 1))) (let ((.cse75 (+ .cse72 1))) (let ((.cse73 (+ .cse75 1))) (let ((.cse76 (+ .cse73 1)) (.cse92 (+ 6 1))) (let ((.cse100 (+ .cse92 1)) (.cse49 (+ 4 1)) (.cse4 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)) (.cse5 (+ 13 1)) (.cse77 (+ .cse76 1))) (let ((.cse67 (+ .cse77 1)) (.cse2 (+ .cse5 1)) (.cse101 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse55 (+ 3 1)) (.cse8 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (.cse13 (+ (- 1) .cse4)) (.cse17 (+ 0 1)) (.cse46 (+ 2 1)) (.cse87 (+ .cse49 1)) (.cse25 (+ 8 1)) (.cse90 (+ 1 .cse100)) (.cse31 (+ 9 1))) (let ((.cse27 (+ .cse31 1)) (.cse45 (+ .cse90 1)) (.cse19 (+ .cse25 1)) (.cse95 (+ .cse87 1)) (.cse56 (+ .cse46 1)) (.cse48 (+ .cse17 1)) (.cse58 (+ 1 1)) (.cse44 (+ (- 1) .cse13)) (.cse11 (+ (- 1) .cse8)) (.cse47 (+ .cse55 1)) (.cse37 (+ 5 1)) (.cse83 (= (mod (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 2 |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) .cse101) 4) 0)) (.cse81 (+ .cse2 1)) (.cse104 (+ .cse67 1)) (.cse102 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse103 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (let ((.cse41 (* |ULTIMATE.start_main_~y~0#1| .cse101)) (.cse82 (or .cse102 .cse103)) (.cse16 (= |ULTIMATE.start_main_~y~0#1| .cse17)) (.cse89 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)) (.cse15 (<= |ULTIMATE.start_main_~k~0#1| 20)) (.cse0 (>= |ULTIMATE.start_main_~k~0#1| 0)) (.cse80 (+ .cse104 1)) (.cse36 (+ .cse81 1)) (.cse63 (not .cse83)) (.cse61 (+ |ULTIMATE.start_main_~c~0#1| 1)) (.cse93 (+ .cse37 1)) (.cse86 (+ .cse47 1)) (.cse24 (+ (- 1) .cse11)) (.cse20 (+ (- 1) .cse44)) (.cse51 (+ .cse58 1)) (.cse54 (+ .cse48 1)) (.cse52 (+ .cse56 1)) (.cse40 (+ 7 1)) (.cse99 (+ .cse95 1)) (.cse6 (+ 14 1)) (.cse30 (+ .cse19 1)) (.cse94 (+ .cse45 1)) (.cse21 (+ .cse27 1)) (.cse12 (+ 12 1))) (let ((.cse9 (+ .cse12 1)) (.cse18 (+ .cse21 1)) (.cse22 (+ .cse94 1)) (.cse23 (+ 11 1)) (.cse26 (+ .cse30 1)) (.cse35 (+ .cse6 1)) (.cse39 (+ .cse99 1)) (.cse28 (+ .cse40 1)) (.cse29 (+ 10 1)) (.cse84 (+ .cse52 1)) (.cse50 (+ .cse54 1)) (.cse57 (+ .cse51 1)) (.cse85 (+ (- 1) .cse20)) (.cse38 (+ (- 1) .cse24)) (.cse43 (+ .cse86 1)) (.cse91 (+ .cse93 1)) (.cse96 (+ 17 1)) (.cse7 (or (= (+ (* |ULTIMATE.start_main_~k~0#1| .cse104) (- (* .cse104 .cse104))) 0) .cse63 (< (+ (- 15) |ULTIMATE.start_main_~k~0#1|) .cse61))) (.cse32 (+ 16 1)) (.cse97 (+ .cse36 1)) (.cse33 (+ 15 1)) (.cse14 (or (< (+ (- 16) |ULTIMATE.start_main_~k~0#1|) .cse61) .cse63 (= (+ (* |ULTIMATE.start_main_~k~0#1| .cse80) (- (* .cse80 .cse80))) 0))) (.cse1 (or (and .cse102 .cse0 .cse15) (and (or (not .cse15) (not .cse0)) .cse103))) (.cse3 (or (and (= (+ (+ (- (* (* (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|)) (+ (- (* .cse41 |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))) (- .cse101)) 0) .cse82) (and .cse82 .cse16 (= 0 .cse89)))) (.cse53 (< 1 |ULTIMATE.start_main_~k~0#1|)) (.cse42 (< .cse17 |ULTIMATE.start_main_~k~0#1|)) (.cse10 (< 0 |ULTIMATE.start_main_~k~0#1|))) (or (and .cse0 .cse1 (= .cse2 |ULTIMATE.start_main_~c~0#1|) .cse3 (= .cse4 .cse5) (= .cse6 |ULTIMATE.start_main_~c~0#1|) .cse7 (= .cse8 .cse9) (= .cse6 |ULTIMATE.start_main_~y~0#1|) .cse10 (<= |ULTIMATE.start_main_~c~0#1| .cse2) (<= 14 .cse4) (= .cse11 .cse12) (= .cse13 .cse12) (< .cse5 |ULTIMATE.start_main_~k~0#1|) (= .cse2 |ULTIMATE.start_main_~y~0#1|) .cse14 .cse15) (and .cse0 .cse1 (<= 0 .cse4) .cse3 (< .cse4 |ULTIMATE.start_main_~k~0#1|) (= .cse4 0) (= .cse8 0) .cse16 (<= |ULTIMATE.start_main_~c~0#1| .cse17) .cse10 (= |ULTIMATE.start_main_~c~0#1| .cse17) .cse15) (and .cse0 .cse1 (< .cse18 |ULTIMATE.start_main_~k~0#1|) (= .cse5 |ULTIMATE.start_main_~y~0#1|) .cse3 (= .cse5 |ULTIMATE.start_main_~c~0#1|) (= .cse9 |ULTIMATE.start_main_~y~0#1|) (= .cse4 .cse12) (= .cse8 .cse12) (<= 13 .cse4) .cse7 (= .cse19 .cse20) .cse10 (<= |ULTIMATE.start_main_~c~0#1| (+ .cse18 1)) (= .cse21 .cse11) .cse14 .cse15) (and .cse0 .cse1 (= .cse22 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~c~0#1| .cse23) (= .cse24 .cse25) .cse3 (= .cse26 |ULTIMATE.start_main_~c~0#1|) (<= 11 .cse4) .cse7 (< .cse27 |ULTIMATE.start_main_~k~0#1|) (= .cse24 .cse28) (= .cse8 .cse29) (<= |ULTIMATE.start_main_~c~0#1| .cse21) (= .cse21 |ULTIMATE.start_main_~y~0#1|) (= .cse30 .cse4) (= .cse11 .cse31) (= .cse4 .cse29) .cse10 (= .cse21 |ULTIMATE.start_main_~c~0#1|) .cse14 (= .cse13 .cse19) .cse15) (let ((.cse34 (+ .cse35 1))) (and .cse0 .cse1 (= |ULTIMATE.start_main_~c~0#1| .cse32) (= .cse11 .cse2) (<= 16 .cse4) .cse3 (= .cse8 .cse33) (= .cse34 |ULTIMATE.start_main_~y~0#1|) (= .cse11 .cse6) .cse7 (<= |ULTIMATE.start_main_~c~0#1| .cse34) (< .cse35 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~c~0#1| .cse36) .cse14 .cse15)) (and .cse0 .cse1 (= .cse8 .cse28) (<= 9 .cse4) (= .cse37 .cse38) .cse3 (= .cse31 |ULTIMATE.start_main_~y~0#1|) (= .cse4 .cse25) (< .cse39 |ULTIMATE.start_main_~k~0#1|) (= .cse31 |ULTIMATE.start_main_~c~0#1|) (= .cse13 .cse40) (>= |ULTIMATE.start_main_~x~0#1| (+ 2025 .cse41)) .cse7 (= |ULTIMATE.start_main_~c~0#1| .cse19) (<= |ULTIMATE.start_main_~c~0#1| (+ .cse39 1)) .cse42 (= .cse8 .cse25) .cse10 (= .cse43 .cse44) (= .cse45 |ULTIMATE.start_main_~y~0#1|) .cse14 .cse15) (and .cse0 .cse1 (= .cse11 .cse46) (= .cse47 |ULTIMATE.start_main_~c~0#1|) (<= 4 .cse4) (= .cse17 .cse20) (= .cse48 .cse44) (<= |ULTIMATE.start_main_~c~0#1| .cse49) .cse3 (= .cse8 .cse50) (= |ULTIMATE.start_main_~c~0#1| .cse49) (= .cse17 .cse38) (< 4 |ULTIMATE.start_main_~k~0#1|) (= .cse11 .cse51) (= .cse52 |ULTIMATE.start_main_~c~0#1|) .cse53 (= .cse13 .cse51) (= .cse54 .cse13) .cse7 (= .cse48 .cse24) (= .cse4 .cse55) (= .cse8 .cse56) (= .cse8 .cse57) .cse42 (= .cse58 .cse24) (= |ULTIMATE.start_main_~y~0#1| .cse49) (= .cse52 |ULTIMATE.start_main_~y~0#1|) .cse10 (= .cse4 .cse56) (= .cse4 .cse50) (= .cse8 .cse55) .cse14 .cse15) (and .cse0 .cse1 (= .cse19 .cse44) .cse3 (= .cse18 |ULTIMATE.start_main_~c~0#1|) (= .cse28 .cse38) (= .cse13 .cse30) .cse7 (< .cse23 |ULTIMATE.start_main_~k~0#1|) (<= 12 .cse4) (= .cse21 .cse8) (= .cse12 |ULTIMATE.start_main_~y~0#1|) .cse10 (= .cse12 |ULTIMATE.start_main_~c~0#1|) (= .cse22 .cse8) (= .cse13 .cse29) (<= |ULTIMATE.start_main_~c~0#1| (+ .cse23 1)) .cse14 .cse15 (= .cse4 .cse26)) (let ((.cse62 (+ .cse80 1))) (let ((.cse60 (+ (- 1) |ULTIMATE.start_main_~k~0#1|)) (.cse66 (+ .cse62 1))) (and .cse0 (or (= (+ (- (* .cse59 .cse59)) (* |ULTIMATE.start_main_~k~0#1| .cse59)) 0) (< .cse60 .cse61)) .cse1 (<= 19 .cse60) (or (< (+ (- 17) |ULTIMATE.start_main_~k~0#1|) .cse61) (= (+ (- (* .cse62 .cse62)) (* .cse62 |ULTIMATE.start_main_~k~0#1|)) 0) .cse63) (or (= (+ (- (* .cse64 .cse64)) (* .cse64 |ULTIMATE.start_main_~k~0#1|)) 0) (not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))) .cse3 (or (< (+ |ULTIMATE.start_main_~k~0#1| (- 8)) .cse61) (= (+ (* .cse65 |ULTIMATE.start_main_~k~0#1|) (- (* .cse65 .cse65))) 0)) (or .cse63 (= (+ (* |ULTIMATE.start_main_~k~0#1| .cse66) (- (* .cse66 .cse66))) 0) (< (+ |ULTIMATE.start_main_~k~0#1| (- 18)) .cse61)) (or (= (+ (* |ULTIMATE.start_main_~k~0#1| .cse67) (- (* .cse67 .cse67))) 0) (< (+ (- 14) |ULTIMATE.start_main_~k~0#1|) .cse61) .cse63) (or (= (+ (- (* .cse68 .cse68)) (* |ULTIMATE.start_main_~k~0#1| .cse68)) 0) (< (+ |ULTIMATE.start_main_~k~0#1| (- 5)) .cse61)) .cse7 (or (< (+ |ULTIMATE.start_main_~k~0#1| (- 6)) .cse61) (= (+ (* .cse69 |ULTIMATE.start_main_~k~0#1|) (- (* .cse69 .cse69))) 0)) (or (= (+ (- (* .cse70 .cse70)) (* .cse70 |ULTIMATE.start_main_~k~0#1|)) 0) (< (+ (- 7) |ULTIMATE.start_main_~k~0#1|) .cse61)) (or (< (+ |ULTIMATE.start_main_~k~0#1| (- 4)) .cse61) (= (+ (- (* .cse71 .cse71)) (* .cse71 |ULTIMATE.start_main_~k~0#1|)) 0)) (or (= (+ (- (* .cse72 .cse72)) (* |ULTIMATE.start_main_~k~0#1| .cse72)) 0) (< (+ (- 9) |ULTIMATE.start_main_~k~0#1|) .cse61)) (or (< (+ (- 11) |ULTIMATE.start_main_~k~0#1|) .cse61) (= (+ (- (* .cse73 .cse73)) (* .cse73 |ULTIMATE.start_main_~k~0#1|)) 0)) (or (< (+ |ULTIMATE.start_main_~k~0#1| (- 19)) .cse61) .cse63 (= (let ((.cse74 (+ .cse66 1))) (+ (- (* .cse74 .cse74)) (* .cse74 |ULTIMATE.start_main_~k~0#1|))) 0)) (or (< (+ |ULTIMATE.start_main_~k~0#1| (- 10)) .cse61) (= (+ (* .cse75 |ULTIMATE.start_main_~k~0#1|) (- (* .cse75 .cse75))) 0)) (or (< (+ |ULTIMATE.start_main_~k~0#1| (- 12)) .cse61) .cse63 (= (+ (* .cse76 |ULTIMATE.start_main_~k~0#1|) (- (* .cse76 .cse76))) 0)) (or .cse63 (< (+ (- 13) |ULTIMATE.start_main_~k~0#1|) .cse61) (= (+ (* |ULTIMATE.start_main_~k~0#1| .cse77) (- (* .cse77 .cse77))) 0)) .cse14 (or (= (+ (- (* .cse78 .cse78)) (* .cse78 |ULTIMATE.start_main_~k~0#1|)) 0) (< (+ (- 3) |ULTIMATE.start_main_~k~0#1|) .cse61)) (= |ULTIMATE.start_main_~y~0#1| (+ 19 1)) .cse15 (or (< (+ (- 2) |ULTIMATE.start_main_~k~0#1|) .cse61) (= (+ (- (* .cse79 .cse79)) (* .cse79 |ULTIMATE.start_main_~k~0#1|)) 0))))) (and (= .cse35 |ULTIMATE.start_main_~c~0#1|) .cse0 .cse1 .cse3 (= .cse8 .cse2) (< 15 |ULTIMATE.start_main_~k~0#1|) .cse7 (= .cse8 .cse6) (= .cse12 .cse44) (= |ULTIMATE.start_main_~c~0#1| .cse81) (<= |ULTIMATE.start_main_~c~0#1| .cse33) (= .cse35 |ULTIMATE.start_main_~y~0#1|) (<= 15 .cse4) (= |ULTIMATE.start_main_~y~0#1| .cse33) .cse14 .cse15) (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 .cse1 (= |ULTIMATE.start_main_~y~0#1| 0) (>= |ULTIMATE.start_main_~c~0#1| 0) .cse82 (= |ULTIMATE.start_main_~x~0#1| 0) .cse15) (and (= .cse48 .cse20) .cse0 .cse1 (<= 5 .cse4) .cse3 (= .cse52 .cse4) (= .cse37 |ULTIMATE.start_main_~c~0#1|) .cse83 (= .cse84 |ULTIMATE.start_main_~y~0#1|) (= .cse13 .cse50) .cse53 (= .cse85 .cse17) (= .cse52 .cse8) .cse7 (= .cse44 .cse51) (= |ULTIMATE.start_main_~c~0#1| .cse86) .cse42 .cse10 (= .cse87 |ULTIMATE.start_main_~c~0#1|) (< .cse49 |ULTIMATE.start_main_~k~0#1|) (= .cse37 |ULTIMATE.start_main_~y~0#1|) (= .cse87 |ULTIMATE.start_main_~y~0#1|) (= .cse13 .cse55) (= .cse11 .cse55) .cse14 (<= |ULTIMATE.start_main_~c~0#1| .cse87) .cse15) (and .cse0 .cse1 (= |ULTIMATE.start_main_~y~0#1| .cse28) (= 0 (let ((.cse88 (* .cse11 .cse11))) (+ (- .cse88) (+ (+ (* (+ (* (- 1) .cse8 .cse8 .cse8) .cse89) 4) (- (* .cse11 (* .cse11 .cse88)))) (- (* .cse11 (* .cse11 (* .cse11 2)))))))) (= .cse43 .cse13) (= (+ (- 1) .cse38) .cse55) .cse3 (= .cse4 .cse40) (= .cse8 .cse40) (= |ULTIMATE.start_main_~y~0#1| .cse25) (= .cse39 |ULTIMATE.start_main_~c~0#1|) (= .cse37 .cse24) .cse7 (= .cse90 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| (+ .cse91 1)) (< .cse91 |ULTIMATE.start_main_~k~0#1|) .cse42 .cse10 (= .cse13 .cse92) (= |ULTIMATE.start_main_~c~0#1| .cse25) (= .cse11 .cse93) (<= 8 .cse4) .cse14 .cse15) (and .cse0 .cse1 (<= |ULTIMATE.start_main_~c~0#1| .cse27) (= .cse30 |ULTIMATE.start_main_~c~0#1|) .cse3 (= .cse11 .cse28) (= |ULTIMATE.start_main_~c~0#1| .cse27) (= |ULTIMATE.start_main_~c~0#1| .cse29) (= .cse11 .cse25) (< .cse31 |ULTIMATE.start_main_~k~0#1|) (= .cse43 .cse20) (<= 10 .cse4) (= |ULTIMATE.start_main_~y~0#1| .cse27) .cse7 (= .cse94 |ULTIMATE.start_main_~y~0#1|) (= .cse8 .cse31) .cse42 .cse10 (= |ULTIMATE.start_main_~y~0#1| .cse29) .cse14 (= .cse4 .cse19) .cse15) (and .cse0 .cse1 (= .cse51 .cse20) .cse3 (= |ULTIMATE.start_main_~y~0#1| .cse92) (= .cse84 .cse8) (= |ULTIMATE.start_main_~c~0#1| .cse93) (= |ULTIMATE.start_main_~c~0#1| .cse95) (<= 6 .cse4) (= .cse24 .cse55) .cse7 (= .cse11 .cse52) (= |ULTIMATE.start_main_~y~0#1| .cse93) (= .cse44 .cse55) .cse42 .cse10 (<= |ULTIMATE.start_main_~c~0#1| .cse92) (< 6 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~c~0#1| .cse92) (= .cse43 |ULTIMATE.start_main_~c~0#1|) (= .cse37 .cse8) (= .cse37 .cse4) (= .cse8 .cse87) .cse14 .cse15) (and .cse0 .cse1 (= |ULTIMATE.start_main_~c~0#1| .cse51) (= .cse46 |ULTIMATE.start_main_~c~0#1|) .cse3 (= .cse13 .cse17) (= .cse48 .cse8) .cse53 (= .cse54 |ULTIMATE.start_main_~c~0#1|) (= .cse46 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| .cse46) (= .cse54 |ULTIMATE.start_main_~y~0#1|) .cse42 (= .cse58 .cse8) .cse10 (< 2 |ULTIMATE.start_main_~k~0#1|) (= .cse11 .cse17) (= |ULTIMATE.start_main_~y~0#1| .cse51) (= .cse24 0) (= .cse48 .cse4) (<= 2 .cse4) .cse14 .cse15) (and .cse0 .cse1 .cse3 (= .cse8 .cse96) (<= |ULTIMATE.start_main_~c~0#1| (+ .cse97 1)) (= (+ 18 1) |ULTIMATE.start_main_~y~0#1|) (<= 18 .cse4) .cse7 (< .cse97 |ULTIMATE.start_main_~k~0#1|) .cse14 .cse15) (and .cse0 .cse1 (= .cse11 .cse58) (= .cse50 |ULTIMATE.start_main_~c~0#1|) .cse3 (= |ULTIMATE.start_main_~c~0#1| .cse56) (= .cse11 .cse48) (= |ULTIMATE.start_main_~c~0#1| .cse55) (<= |ULTIMATE.start_main_~c~0#1| .cse50) (= .cse54 .cse4) (= .cse8 .cse51) .cse53 (= |ULTIMATE.start_main_~y~0#1| .cse55) .cse7 (= .cse48 .cse13) (<= 3 .cse4) (= .cse44 .cse17) .cse42 (= .cse8 .cse46) .cse10 (= .cse4 .cse51) (< .cse54 |ULTIMATE.start_main_~k~0#1|) (= .cse50 |ULTIMATE.start_main_~y~0#1|) (= .cse38 0) (= |ULTIMATE.start_main_~y~0#1| .cse56) (= .cse24 .cse17) .cse14 (= |ULTIMATE.start_main_~y~0#1| .cse57) .cse15) (and .cse0 .cse1 .cse3 (= .cse8 .cse93) (= (let ((.cse98 (* .cse8 .cse8))) (+ (- .cse98) (+ (- (* (* (* .cse8 2) .cse8) .cse8)) (+ (- (* (* .cse98 .cse8) .cse8)) (* 4 .cse89))))) 0) (= |ULTIMATE.start_main_~y~0#1| .cse40) (= .cse99 |ULTIMATE.start_main_~c~0#1|) .cse7 (= .cse85 .cse51) (= .cse38 .cse55) (= .cse43 .cse4) (<= 7 .cse4) (= |ULTIMATE.start_main_~c~0#1| .cse40) .cse42 (= .cse37 .cse13) (= .cse11 .cse37) .cse10 (= |ULTIMATE.start_main_~y~0#1| .cse100) (= .cse4 .cse92) (< 7 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| .cse40) .cse14 (= .cse91 |ULTIMATE.start_main_~c~0#1|) .cse15) (and .cse0 .cse1 (= .cse24 .cse2) .cse3 (= |ULTIMATE.start_main_~y~0#1| .cse96) .cse7 (<= 17 .cse4) (<= |ULTIMATE.start_main_~c~0#1| (+ 1 .cse32)) (< .cse32 |ULTIMATE.start_main_~k~0#1|) (= .cse97 |ULTIMATE.start_main_~c~0#1|) (= .cse11 .cse33) .cse14 .cse15) (and .cse0 .cse1 (= .cse58 |ULTIMATE.start_main_~y~0#1|) .cse3 (= .cse48 |ULTIMATE.start_main_~y~0#1|) (<= 1 .cse4) (= .cse58 |ULTIMATE.start_main_~c~0#1|) .cse53 (= .cse13 0) (<= |ULTIMATE.start_main_~c~0#1| .cse58) (= .cse11 0) (= .cse48 |ULTIMATE.start_main_~c~0#1|) .cse42 .cse10 (= .cse8 .cse17) (= .cse4 .cse17) (< (+ (- 1) 1) |ULTIMATE.start_main_~k~0#1|) .cse15)))))))))))))))))))) [2023-02-18 04:09:36,631 INFO L895 garLoopResultBuilder]: At program point L27-3(lines 27 36) the Hoare annotation is: (let ((.cse65 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse6 (+ 9 1)) (.cse7 (+ 0 1)) (.cse20 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse22 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (.cse66 (* |ULTIMATE.start_main_~y~0#1| .cse65))) (let ((.cse58 (- (* (* (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|))) (.cse59 (- (* .cse66 |ULTIMATE.start_main_~y~0#1|))) (.cse62 (- .cse65)) (.cse14 (or .cse20 .cse22)) (.cse68 (= |ULTIMATE.start_main_~y~0#1| .cse7)) (.cse55 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)) (.cse15 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (.cse60 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse56 (* 2 |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse48 (+ 5 1)) (.cse9 (+ 13 1)) (.cse1 (+ 2 1)) (.cse5 (+ .cse6 1))) (let ((.cse10 (+ .cse5 1)) (.cse12 (+ .cse1 1)) (.cse50 (+ 15 1)) (.cse45 (+ 12 1)) (.cse44 (+ .cse9 1)) (.cse49 (+ .cse48 1)) (.cse61 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse47 (+ 4 1)) (.cse43 (= (mod (+ .cse60 .cse56 .cse65) 4) 0)) (.cse46 (< 1 |ULTIMATE.start_main_~k~0#1|)) (.cse2 (+ 1 1)) (.cse11 (+ (- 1) .cse15)) (.cse0 (or (and (= (+ (+ .cse58 (+ .cse59 (* |ULTIMATE.start_main_~x~0#1| 4))) .cse62) 0) .cse14) (and .cse14 .cse68 (= 0 .cse55)))) (.cse13 (< 0 |ULTIMATE.start_main_~k~0#1|))) (or (and .cse0 (<= |ULTIMATE.start_main_~c~0#1| .cse1) (<= |ULTIMATE.start_main_~k~0#1| 3) (< 2 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ .cse2 1))) (let ((.cse4 (+ (+ 14 1) 1))) (let ((.cse3 (+ .cse4 1))) (and .cse0 (<= |ULTIMATE.start_main_~k~0#1| 17) (= .cse3 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| .cse3) (< .cse4 |ULTIMATE.start_main_~k~0#1|)))) (and (<= |ULTIMATE.start_main_~c~0#1| .cse5) .cse0 (< .cse6 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| .cse5) (< .cse7 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 11)) (let ((.cse8 (+ .cse10 1))) (and (< .cse8 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 14) (= .cse9 |ULTIMATE.start_main_~y~0#1|) .cse0 (<= |ULTIMATE.start_main_~c~0#1| (+ .cse8 1)))) (and .cse0 (= .cse11 (+ .cse12 1)) .cse13 (<= |ULTIMATE.start_main_~k~0#1| 7) (<= |ULTIMATE.start_main_~c~0#1| (+ 6 1)) (< 6 |ULTIMATE.start_main_~k~0#1|)) (and (= |ULTIMATE.start_main_~y~0#1| 0) .cse14 (= |ULTIMATE.start_main_~x~0#1| 0)) (and .cse0 (< .cse5 |ULTIMATE.start_main_~k~0#1|) (= .cse15 (+ 10 1)) (<= |ULTIMATE.start_main_~c~0#1| .cse10) (<= |ULTIMATE.start_main_~k~0#1| 12)) (let ((.cse25 (+ |ULTIMATE.start_main_~y~0#1| 1))) (let ((.cse17 (+ .cse25 1))) (let ((.cse42 (+ .cse17 1))) (let ((.cse41 (+ .cse42 1))) (let ((.cse33 (+ .cse41 1))) (let ((.cse29 (+ .cse33 1))) (let ((.cse31 (+ .cse29 1))) (let ((.cse32 (+ .cse31 1))) (let ((.cse26 (+ .cse32 1))) (let ((.cse34 (+ .cse26 1))) (let ((.cse37 (+ .cse34 1))) (let ((.cse35 (+ .cse37 1))) (let ((.cse38 (+ .cse35 1))) (let ((.cse39 (+ .cse38 1))) (let ((.cse28 (+ .cse39 1))) (let ((.cse30 (+ .cse28 1))) (let ((.cse40 (+ .cse30 1))) (let ((.cse23 (+ .cse40 1))) (let ((.cse16 (>= |ULTIMATE.start_main_~k~0#1| 0)) (.cse18 (+ (- 1) |ULTIMATE.start_main_~k~0#1|)) (.cse27 (+ .cse23 1)) (.cse24 (not .cse43)) (.cse21 (<= |ULTIMATE.start_main_~k~0#1| 20)) (.cse19 (+ |ULTIMATE.start_main_~c~0#1| 1))) (and .cse16 (or (= (+ (- (* .cse17 .cse17)) (* |ULTIMATE.start_main_~k~0#1| .cse17)) 0) (< .cse18 .cse19)) (or (and .cse20 .cse16 .cse21) (and (or (not .cse21) (not .cse16)) .cse22)) (<= 19 .cse18) (or (< (+ (- 17) |ULTIMATE.start_main_~k~0#1|) .cse19) (= (+ (- (* .cse23 .cse23)) (* .cse23 |ULTIMATE.start_main_~k~0#1|)) 0) .cse24) (or (= (+ (- (* .cse25 .cse25)) (* .cse25 |ULTIMATE.start_main_~k~0#1|)) 0) (not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))) .cse0 (or (< (+ |ULTIMATE.start_main_~k~0#1| (- 8)) .cse19) (= (+ (* .cse26 |ULTIMATE.start_main_~k~0#1|) (- (* .cse26 .cse26))) 0)) (or .cse24 (= (+ (* |ULTIMATE.start_main_~k~0#1| .cse27) (- (* .cse27 .cse27))) 0) (< (+ |ULTIMATE.start_main_~k~0#1| (- 18)) .cse19)) (or (= (+ (* |ULTIMATE.start_main_~k~0#1| .cse28) (- (* .cse28 .cse28))) 0) (< (+ (- 14) |ULTIMATE.start_main_~k~0#1|) .cse19) .cse24) (or (= (+ (- (* .cse29 .cse29)) (* |ULTIMATE.start_main_~k~0#1| .cse29)) 0) (< (+ |ULTIMATE.start_main_~k~0#1| (- 5)) .cse19)) (or (= (+ (* |ULTIMATE.start_main_~k~0#1| .cse30) (- (* .cse30 .cse30))) 0) .cse24 (< (+ (- 15) |ULTIMATE.start_main_~k~0#1|) .cse19)) (or (< (+ |ULTIMATE.start_main_~k~0#1| (- 6)) .cse19) (= (+ (* .cse31 |ULTIMATE.start_main_~k~0#1|) (- (* .cse31 .cse31))) 0)) (or (= (+ (- (* .cse32 .cse32)) (* .cse32 |ULTIMATE.start_main_~k~0#1|)) 0) (< (+ (- 7) |ULTIMATE.start_main_~k~0#1|) .cse19)) (or (< (+ |ULTIMATE.start_main_~k~0#1| (- 4)) .cse19) (= (+ (- (* .cse33 .cse33)) (* .cse33 |ULTIMATE.start_main_~k~0#1|)) 0)) (or (= (+ (- (* .cse34 .cse34)) (* |ULTIMATE.start_main_~k~0#1| .cse34)) 0) (< (+ (- 9) |ULTIMATE.start_main_~k~0#1|) .cse19)) (or (< (+ (- 11) |ULTIMATE.start_main_~k~0#1|) .cse19) (= (+ (- (* .cse35 .cse35)) (* .cse35 |ULTIMATE.start_main_~k~0#1|)) 0)) (or (< (+ |ULTIMATE.start_main_~k~0#1| (- 19)) .cse19) .cse24 (= (let ((.cse36 (+ .cse27 1))) (+ (- (* .cse36 .cse36)) (* .cse36 |ULTIMATE.start_main_~k~0#1|))) 0)) (or (< (+ |ULTIMATE.start_main_~k~0#1| (- 10)) .cse19) (= (+ (* .cse37 |ULTIMATE.start_main_~k~0#1|) (- (* .cse37 .cse37))) 0)) (or (< (+ |ULTIMATE.start_main_~k~0#1| (- 12)) .cse19) .cse24 (= (+ (* .cse38 |ULTIMATE.start_main_~k~0#1|) (- (* .cse38 .cse38))) 0)) (or .cse24 (< (+ (- 13) |ULTIMATE.start_main_~k~0#1|) .cse19) (= (+ (* |ULTIMATE.start_main_~k~0#1| .cse39) (- (* .cse39 .cse39))) 0)) (or (< (+ (- 16) |ULTIMATE.start_main_~k~0#1|) .cse19) .cse24 (= (+ (* |ULTIMATE.start_main_~k~0#1| .cse40) (- (* .cse40 .cse40))) 0)) (or (= (+ (- (* .cse41 .cse41)) (* .cse41 |ULTIMATE.start_main_~k~0#1|)) 0) (< (+ (- 3) |ULTIMATE.start_main_~k~0#1|) .cse19)) (= |ULTIMATE.start_main_~y~0#1| (+ 19 1)) .cse21 (or (< (+ (- 2) |ULTIMATE.start_main_~k~0#1|) .cse19) (= (+ (- (* .cse42 .cse42)) (* .cse42 |ULTIMATE.start_main_~k~0#1|)) 0)))))))))))))))))))))) (and .cse0 .cse13 (<= |ULTIMATE.start_main_~k~0#1| 15) (<= |ULTIMATE.start_main_~c~0#1| .cse44) (= .cse11 .cse45) (< .cse9 |ULTIMATE.start_main_~k~0#1|)) (and .cse0 (<= |ULTIMATE.start_main_~k~0#1| 6) .cse43 .cse46 (< .cse47 |ULTIMATE.start_main_~k~0#1|) (= .cse48 |ULTIMATE.start_main_~y~0#1|)) (and .cse0 (= .cse15 .cse49) (<= |ULTIMATE.start_main_~k~0#1| 8) (< 7 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| (+ 7 1))) (and (<= |ULTIMATE.start_main_~c~0#1| .cse47) .cse0 (< 4 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5) (= .cse15 .cse12)) (and (<= |ULTIMATE.start_main_~k~0#1| 16) .cse0 (< 15 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| .cse50) (= |ULTIMATE.start_main_~y~0#1| .cse50)) (let ((.cse51 (+ 16 1))) (and .cse0 (<= |ULTIMATE.start_main_~k~0#1| 18) (<= |ULTIMATE.start_main_~c~0#1| (+ 1 .cse51)) (< .cse51 |ULTIMATE.start_main_~k~0#1|) (= .cse11 .cse50))) (let ((.cse52 (+ 11 1))) (and .cse0 (<= |ULTIMATE.start_main_~k~0#1| 13) (< .cse52 |ULTIMATE.start_main_~k~0#1|) (= .cse45 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| (+ .cse52 1)))) (let ((.cse53 (+ (+ (+ .cse44 1) 1) 1))) (and .cse0 (<= |ULTIMATE.start_main_~c~0#1| (+ .cse53 1)) (= (+ 18 1) |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 19) (< .cse53 |ULTIMATE.start_main_~k~0#1|))) (let ((.cse57 (+ .cse49 1))) (and (= 0 (let ((.cse54 (* .cse11 .cse11))) (+ (- .cse54) (+ (+ (* (+ (* (- 1) .cse15 .cse15 .cse15) .cse55) 4) (- (* .cse11 (* .cse11 .cse54)))) (- (* .cse11 (* .cse11 (* .cse11 2)))))))) (= (+ (- 1) (+ (- 1) (+ (- 1) .cse11))) (+ 3 1)) .cse0 (= (mod (+ (* 3 |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) .cse56 (* 3 |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 4) 0) (<= |ULTIMATE.start_main_~k~0#1| 9) (<= |ULTIMATE.start_main_~c~0#1| (+ .cse57 1)) (< .cse57 |ULTIMATE.start_main_~k~0#1|) (= (+ (+ .cse58 (+ .cse59 (* (div (+ (- .cse60) (* (- 2) .cse61) .cse62) (- 4)) 4))) .cse62) 0))) (let ((.cse63 (+ (+ (+ (+ .cse47 1) 1) 1) 1)) (.cse64 (+ 2025 .cse66))) (and .cse0 (= .cse6 |ULTIMATE.start_main_~y~0#1|) .cse43 (< .cse63 |ULTIMATE.start_main_~k~0#1|) (>= |ULTIMATE.start_main_~x~0#1| .cse64) (<= |ULTIMATE.start_main_~c~0#1| (+ .cse63 1)) (<= |ULTIMATE.start_main_~k~0#1| 10) (>= (div (+ (* .cse61 2) .cse60 .cse65) 4) .cse64))) (let ((.cse67 (+ (+ .cse7 1) 1))) (and .cse0 .cse43 (<= |ULTIMATE.start_main_~k~0#1| 4) (< .cse67 |ULTIMATE.start_main_~k~0#1|) (= (+ .cse67 1) |ULTIMATE.start_main_~y~0#1|))) (and (<= |ULTIMATE.start_main_~k~0#1| 2) .cse0 .cse46 (<= |ULTIMATE.start_main_~c~0#1| .cse2) (= .cse11 0) (< (+ (- 1) 1) |ULTIMATE.start_main_~k~0#1|)) (and (<= |ULTIMATE.start_main_~k~0#1| 1) .cse0 .cse68 (<= |ULTIMATE.start_main_~c~0#1| .cse7) .cse13)))))) [2023-02-18 04:09:36,631 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 04:09:36,631 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 17 40) the Hoare annotation is: true [2023-02-18 04:09:36,631 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2023-02-18 04:09:36,631 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2023-02-18 04:09:36,631 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 04:09:36,632 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 04:09:36,632 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (let ((.cse64 (+ |ULTIMATE.start_main_~y~0#1| 1))) (let ((.cse59 (+ .cse64 1))) (let ((.cse79 (+ .cse59 1))) (let ((.cse78 (+ .cse79 1))) (let ((.cse71 (+ .cse78 1))) (let ((.cse68 (+ .cse71 1))) (let ((.cse69 (+ .cse68 1))) (let ((.cse70 (+ .cse69 1))) (let ((.cse65 (+ .cse70 1))) (let ((.cse72 (+ .cse65 1))) (let ((.cse75 (+ .cse72 1))) (let ((.cse73 (+ .cse75 1))) (let ((.cse76 (+ .cse73 1)) (.cse92 (+ 6 1))) (let ((.cse100 (+ .cse92 1)) (.cse49 (+ 4 1)) (.cse4 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)) (.cse5 (+ 13 1)) (.cse77 (+ .cse76 1))) (let ((.cse67 (+ .cse77 1)) (.cse2 (+ .cse5 1)) (.cse101 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse55 (+ 3 1)) (.cse8 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (.cse13 (+ (- 1) .cse4)) (.cse17 (+ 0 1)) (.cse46 (+ 2 1)) (.cse87 (+ .cse49 1)) (.cse25 (+ 8 1)) (.cse90 (+ 1 .cse100)) (.cse31 (+ 9 1))) (let ((.cse27 (+ .cse31 1)) (.cse45 (+ .cse90 1)) (.cse19 (+ .cse25 1)) (.cse95 (+ .cse87 1)) (.cse56 (+ .cse46 1)) (.cse48 (+ .cse17 1)) (.cse58 (+ 1 1)) (.cse44 (+ (- 1) .cse13)) (.cse11 (+ (- 1) .cse8)) (.cse47 (+ .cse55 1)) (.cse37 (+ 5 1)) (.cse83 (= (mod (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 2 |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) .cse101) 4) 0)) (.cse81 (+ .cse2 1)) (.cse104 (+ .cse67 1)) (.cse102 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse103 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (let ((.cse41 (* |ULTIMATE.start_main_~y~0#1| .cse101)) (.cse82 (or .cse102 .cse103)) (.cse16 (= |ULTIMATE.start_main_~y~0#1| .cse17)) (.cse89 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)) (.cse15 (<= |ULTIMATE.start_main_~k~0#1| 20)) (.cse0 (>= |ULTIMATE.start_main_~k~0#1| 0)) (.cse80 (+ .cse104 1)) (.cse36 (+ .cse81 1)) (.cse63 (not .cse83)) (.cse61 (+ |ULTIMATE.start_main_~c~0#1| 1)) (.cse93 (+ .cse37 1)) (.cse86 (+ .cse47 1)) (.cse24 (+ (- 1) .cse11)) (.cse20 (+ (- 1) .cse44)) (.cse51 (+ .cse58 1)) (.cse54 (+ .cse48 1)) (.cse52 (+ .cse56 1)) (.cse40 (+ 7 1)) (.cse99 (+ .cse95 1)) (.cse6 (+ 14 1)) (.cse30 (+ .cse19 1)) (.cse94 (+ .cse45 1)) (.cse21 (+ .cse27 1)) (.cse12 (+ 12 1))) (let ((.cse9 (+ .cse12 1)) (.cse18 (+ .cse21 1)) (.cse22 (+ .cse94 1)) (.cse23 (+ 11 1)) (.cse26 (+ .cse30 1)) (.cse35 (+ .cse6 1)) (.cse39 (+ .cse99 1)) (.cse28 (+ .cse40 1)) (.cse29 (+ 10 1)) (.cse84 (+ .cse52 1)) (.cse50 (+ .cse54 1)) (.cse57 (+ .cse51 1)) (.cse85 (+ (- 1) .cse20)) (.cse38 (+ (- 1) .cse24)) (.cse43 (+ .cse86 1)) (.cse91 (+ .cse93 1)) (.cse96 (+ 17 1)) (.cse7 (or (= (+ (* |ULTIMATE.start_main_~k~0#1| .cse104) (- (* .cse104 .cse104))) 0) .cse63 (< (+ (- 15) |ULTIMATE.start_main_~k~0#1|) .cse61))) (.cse32 (+ 16 1)) (.cse97 (+ .cse36 1)) (.cse33 (+ 15 1)) (.cse14 (or (< (+ (- 16) |ULTIMATE.start_main_~k~0#1|) .cse61) .cse63 (= (+ (* |ULTIMATE.start_main_~k~0#1| .cse80) (- (* .cse80 .cse80))) 0))) (.cse1 (or (and .cse102 .cse0 .cse15) (and (or (not .cse15) (not .cse0)) .cse103))) (.cse3 (or (and (= (+ (+ (- (* (* (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|)) (+ (- (* .cse41 |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))) (- .cse101)) 0) .cse82) (and .cse82 .cse16 (= 0 .cse89)))) (.cse53 (< 1 |ULTIMATE.start_main_~k~0#1|)) (.cse42 (< .cse17 |ULTIMATE.start_main_~k~0#1|)) (.cse10 (< 0 |ULTIMATE.start_main_~k~0#1|))) (or (and .cse0 .cse1 (= .cse2 |ULTIMATE.start_main_~c~0#1|) .cse3 (= .cse4 .cse5) (= .cse6 |ULTIMATE.start_main_~c~0#1|) .cse7 (= .cse8 .cse9) (= .cse6 |ULTIMATE.start_main_~y~0#1|) .cse10 (<= |ULTIMATE.start_main_~c~0#1| .cse2) (<= 14 .cse4) (= .cse11 .cse12) (= .cse13 .cse12) (< .cse5 |ULTIMATE.start_main_~k~0#1|) (= .cse2 |ULTIMATE.start_main_~y~0#1|) .cse14 .cse15) (and .cse0 .cse1 (<= 0 .cse4) .cse3 (< .cse4 |ULTIMATE.start_main_~k~0#1|) (= .cse4 0) (= .cse8 0) .cse16 (<= |ULTIMATE.start_main_~c~0#1| .cse17) .cse10 (= |ULTIMATE.start_main_~c~0#1| .cse17) .cse15) (and .cse0 .cse1 (< .cse18 |ULTIMATE.start_main_~k~0#1|) (= .cse5 |ULTIMATE.start_main_~y~0#1|) .cse3 (= .cse5 |ULTIMATE.start_main_~c~0#1|) (= .cse9 |ULTIMATE.start_main_~y~0#1|) (= .cse4 .cse12) (= .cse8 .cse12) (<= 13 .cse4) .cse7 (= .cse19 .cse20) .cse10 (<= |ULTIMATE.start_main_~c~0#1| (+ .cse18 1)) (= .cse21 .cse11) .cse14 .cse15) (and .cse0 .cse1 (= .cse22 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~c~0#1| .cse23) (= .cse24 .cse25) .cse3 (= .cse26 |ULTIMATE.start_main_~c~0#1|) (<= 11 .cse4) .cse7 (< .cse27 |ULTIMATE.start_main_~k~0#1|) (= .cse24 .cse28) (= .cse8 .cse29) (<= |ULTIMATE.start_main_~c~0#1| .cse21) (= .cse21 |ULTIMATE.start_main_~y~0#1|) (= .cse30 .cse4) (= .cse11 .cse31) (= .cse4 .cse29) .cse10 (= .cse21 |ULTIMATE.start_main_~c~0#1|) .cse14 (= .cse13 .cse19) .cse15) (let ((.cse34 (+ .cse35 1))) (and .cse0 .cse1 (= |ULTIMATE.start_main_~c~0#1| .cse32) (= .cse11 .cse2) (<= 16 .cse4) .cse3 (= .cse8 .cse33) (= .cse34 |ULTIMATE.start_main_~y~0#1|) (= .cse11 .cse6) .cse7 (<= |ULTIMATE.start_main_~c~0#1| .cse34) (< .cse35 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~c~0#1| .cse36) .cse14 .cse15)) (and .cse0 .cse1 (= .cse8 .cse28) (<= 9 .cse4) (= .cse37 .cse38) .cse3 (= .cse31 |ULTIMATE.start_main_~y~0#1|) (= .cse4 .cse25) (< .cse39 |ULTIMATE.start_main_~k~0#1|) (= .cse31 |ULTIMATE.start_main_~c~0#1|) (= .cse13 .cse40) (>= |ULTIMATE.start_main_~x~0#1| (+ 2025 .cse41)) .cse7 (= |ULTIMATE.start_main_~c~0#1| .cse19) (<= |ULTIMATE.start_main_~c~0#1| (+ .cse39 1)) .cse42 (= .cse8 .cse25) .cse10 (= .cse43 .cse44) (= .cse45 |ULTIMATE.start_main_~y~0#1|) .cse14 .cse15) (and .cse0 .cse1 (= .cse11 .cse46) (= .cse47 |ULTIMATE.start_main_~c~0#1|) (<= 4 .cse4) (= .cse17 .cse20) (= .cse48 .cse44) (<= |ULTIMATE.start_main_~c~0#1| .cse49) .cse3 (= .cse8 .cse50) (= |ULTIMATE.start_main_~c~0#1| .cse49) (= .cse17 .cse38) (< 4 |ULTIMATE.start_main_~k~0#1|) (= .cse11 .cse51) (= .cse52 |ULTIMATE.start_main_~c~0#1|) .cse53 (= .cse13 .cse51) (= .cse54 .cse13) .cse7 (= .cse48 .cse24) (= .cse4 .cse55) (= .cse8 .cse56) (= .cse8 .cse57) .cse42 (= .cse58 .cse24) (= |ULTIMATE.start_main_~y~0#1| .cse49) (= .cse52 |ULTIMATE.start_main_~y~0#1|) .cse10 (= .cse4 .cse56) (= .cse4 .cse50) (= .cse8 .cse55) .cse14 .cse15) (and .cse0 .cse1 (= .cse19 .cse44) .cse3 (= .cse18 |ULTIMATE.start_main_~c~0#1|) (= .cse28 .cse38) (= .cse13 .cse30) .cse7 (< .cse23 |ULTIMATE.start_main_~k~0#1|) (<= 12 .cse4) (= .cse21 .cse8) (= .cse12 |ULTIMATE.start_main_~y~0#1|) .cse10 (= .cse12 |ULTIMATE.start_main_~c~0#1|) (= .cse22 .cse8) (= .cse13 .cse29) (<= |ULTIMATE.start_main_~c~0#1| (+ .cse23 1)) .cse14 .cse15 (= .cse4 .cse26)) (let ((.cse62 (+ .cse80 1))) (let ((.cse60 (+ (- 1) |ULTIMATE.start_main_~k~0#1|)) (.cse66 (+ .cse62 1))) (and .cse0 (or (= (+ (- (* .cse59 .cse59)) (* |ULTIMATE.start_main_~k~0#1| .cse59)) 0) (< .cse60 .cse61)) .cse1 (<= 19 .cse60) (or (< (+ (- 17) |ULTIMATE.start_main_~k~0#1|) .cse61) (= (+ (- (* .cse62 .cse62)) (* .cse62 |ULTIMATE.start_main_~k~0#1|)) 0) .cse63) (or (= (+ (- (* .cse64 .cse64)) (* .cse64 |ULTIMATE.start_main_~k~0#1|)) 0) (not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))) .cse3 (or (< (+ |ULTIMATE.start_main_~k~0#1| (- 8)) .cse61) (= (+ (* .cse65 |ULTIMATE.start_main_~k~0#1|) (- (* .cse65 .cse65))) 0)) (or .cse63 (= (+ (* |ULTIMATE.start_main_~k~0#1| .cse66) (- (* .cse66 .cse66))) 0) (< (+ |ULTIMATE.start_main_~k~0#1| (- 18)) .cse61)) (or (= (+ (* |ULTIMATE.start_main_~k~0#1| .cse67) (- (* .cse67 .cse67))) 0) (< (+ (- 14) |ULTIMATE.start_main_~k~0#1|) .cse61) .cse63) (or (= (+ (- (* .cse68 .cse68)) (* |ULTIMATE.start_main_~k~0#1| .cse68)) 0) (< (+ |ULTIMATE.start_main_~k~0#1| (- 5)) .cse61)) .cse7 (or (< (+ |ULTIMATE.start_main_~k~0#1| (- 6)) .cse61) (= (+ (* .cse69 |ULTIMATE.start_main_~k~0#1|) (- (* .cse69 .cse69))) 0)) (or (= (+ (- (* .cse70 .cse70)) (* .cse70 |ULTIMATE.start_main_~k~0#1|)) 0) (< (+ (- 7) |ULTIMATE.start_main_~k~0#1|) .cse61)) (or (< (+ |ULTIMATE.start_main_~k~0#1| (- 4)) .cse61) (= (+ (- (* .cse71 .cse71)) (* .cse71 |ULTIMATE.start_main_~k~0#1|)) 0)) (or (= (+ (- (* .cse72 .cse72)) (* |ULTIMATE.start_main_~k~0#1| .cse72)) 0) (< (+ (- 9) |ULTIMATE.start_main_~k~0#1|) .cse61)) (or (< (+ (- 11) |ULTIMATE.start_main_~k~0#1|) .cse61) (= (+ (- (* .cse73 .cse73)) (* .cse73 |ULTIMATE.start_main_~k~0#1|)) 0)) (or (< (+ |ULTIMATE.start_main_~k~0#1| (- 19)) .cse61) .cse63 (= (let ((.cse74 (+ .cse66 1))) (+ (- (* .cse74 .cse74)) (* .cse74 |ULTIMATE.start_main_~k~0#1|))) 0)) (or (< (+ |ULTIMATE.start_main_~k~0#1| (- 10)) .cse61) (= (+ (* .cse75 |ULTIMATE.start_main_~k~0#1|) (- (* .cse75 .cse75))) 0)) (or (< (+ |ULTIMATE.start_main_~k~0#1| (- 12)) .cse61) .cse63 (= (+ (* .cse76 |ULTIMATE.start_main_~k~0#1|) (- (* .cse76 .cse76))) 0)) (or .cse63 (< (+ (- 13) |ULTIMATE.start_main_~k~0#1|) .cse61) (= (+ (* |ULTIMATE.start_main_~k~0#1| .cse77) (- (* .cse77 .cse77))) 0)) .cse14 (or (= (+ (- (* .cse78 .cse78)) (* .cse78 |ULTIMATE.start_main_~k~0#1|)) 0) (< (+ (- 3) |ULTIMATE.start_main_~k~0#1|) .cse61)) (= |ULTIMATE.start_main_~y~0#1| (+ 19 1)) .cse15 (or (< (+ (- 2) |ULTIMATE.start_main_~k~0#1|) .cse61) (= (+ (- (* .cse79 .cse79)) (* .cse79 |ULTIMATE.start_main_~k~0#1|)) 0))))) (and (= .cse35 |ULTIMATE.start_main_~c~0#1|) .cse0 .cse1 .cse3 (= .cse8 .cse2) (< 15 |ULTIMATE.start_main_~k~0#1|) .cse7 (= .cse8 .cse6) (= .cse12 .cse44) (= |ULTIMATE.start_main_~c~0#1| .cse81) (<= |ULTIMATE.start_main_~c~0#1| .cse33) (= .cse35 |ULTIMATE.start_main_~y~0#1|) (<= 15 .cse4) (= |ULTIMATE.start_main_~y~0#1| .cse33) .cse14 .cse15) (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 .cse1 (= |ULTIMATE.start_main_~y~0#1| 0) (>= |ULTIMATE.start_main_~c~0#1| 0) .cse82 (= |ULTIMATE.start_main_~x~0#1| 0) .cse15) (and (= .cse48 .cse20) .cse0 .cse1 (<= 5 .cse4) .cse3 (= .cse52 .cse4) (= .cse37 |ULTIMATE.start_main_~c~0#1|) .cse83 (= .cse84 |ULTIMATE.start_main_~y~0#1|) (= .cse13 .cse50) .cse53 (= .cse85 .cse17) (= .cse52 .cse8) .cse7 (= .cse44 .cse51) (= |ULTIMATE.start_main_~c~0#1| .cse86) .cse42 .cse10 (= .cse87 |ULTIMATE.start_main_~c~0#1|) (< .cse49 |ULTIMATE.start_main_~k~0#1|) (= .cse37 |ULTIMATE.start_main_~y~0#1|) (= .cse87 |ULTIMATE.start_main_~y~0#1|) (= .cse13 .cse55) (= .cse11 .cse55) .cse14 (<= |ULTIMATE.start_main_~c~0#1| .cse87) .cse15) (and .cse0 .cse1 (= |ULTIMATE.start_main_~y~0#1| .cse28) (= 0 (let ((.cse88 (* .cse11 .cse11))) (+ (- .cse88) (+ (+ (* (+ (* (- 1) .cse8 .cse8 .cse8) .cse89) 4) (- (* .cse11 (* .cse11 .cse88)))) (- (* .cse11 (* .cse11 (* .cse11 2)))))))) (= .cse43 .cse13) (= (+ (- 1) .cse38) .cse55) .cse3 (= .cse4 .cse40) (= .cse8 .cse40) (= |ULTIMATE.start_main_~y~0#1| .cse25) (= .cse39 |ULTIMATE.start_main_~c~0#1|) (= .cse37 .cse24) .cse7 (= .cse90 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| (+ .cse91 1)) (< .cse91 |ULTIMATE.start_main_~k~0#1|) .cse42 .cse10 (= .cse13 .cse92) (= |ULTIMATE.start_main_~c~0#1| .cse25) (= .cse11 .cse93) (<= 8 .cse4) .cse14 .cse15) (and .cse0 .cse1 (<= |ULTIMATE.start_main_~c~0#1| .cse27) (= .cse30 |ULTIMATE.start_main_~c~0#1|) .cse3 (= .cse11 .cse28) (= |ULTIMATE.start_main_~c~0#1| .cse27) (= |ULTIMATE.start_main_~c~0#1| .cse29) (= .cse11 .cse25) (< .cse31 |ULTIMATE.start_main_~k~0#1|) (= .cse43 .cse20) (<= 10 .cse4) (= |ULTIMATE.start_main_~y~0#1| .cse27) .cse7 (= .cse94 |ULTIMATE.start_main_~y~0#1|) (= .cse8 .cse31) .cse42 .cse10 (= |ULTIMATE.start_main_~y~0#1| .cse29) .cse14 (= .cse4 .cse19) .cse15) (and .cse0 .cse1 (= .cse51 .cse20) .cse3 (= |ULTIMATE.start_main_~y~0#1| .cse92) (= .cse84 .cse8) (= |ULTIMATE.start_main_~c~0#1| .cse93) (= |ULTIMATE.start_main_~c~0#1| .cse95) (<= 6 .cse4) (= .cse24 .cse55) .cse7 (= .cse11 .cse52) (= |ULTIMATE.start_main_~y~0#1| .cse93) (= .cse44 .cse55) .cse42 .cse10 (<= |ULTIMATE.start_main_~c~0#1| .cse92) (< 6 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~c~0#1| .cse92) (= .cse43 |ULTIMATE.start_main_~c~0#1|) (= .cse37 .cse8) (= .cse37 .cse4) (= .cse8 .cse87) .cse14 .cse15) (and .cse0 .cse1 (= |ULTIMATE.start_main_~c~0#1| .cse51) (= .cse46 |ULTIMATE.start_main_~c~0#1|) .cse3 (= .cse13 .cse17) (= .cse48 .cse8) .cse53 (= .cse54 |ULTIMATE.start_main_~c~0#1|) (= .cse46 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| .cse46) (= .cse54 |ULTIMATE.start_main_~y~0#1|) .cse42 (= .cse58 .cse8) .cse10 (< 2 |ULTIMATE.start_main_~k~0#1|) (= .cse11 .cse17) (= |ULTIMATE.start_main_~y~0#1| .cse51) (= .cse24 0) (= .cse48 .cse4) (<= 2 .cse4) .cse14 .cse15) (and .cse0 .cse1 .cse3 (= .cse8 .cse96) (<= |ULTIMATE.start_main_~c~0#1| (+ .cse97 1)) (= (+ 18 1) |ULTIMATE.start_main_~y~0#1|) (<= 18 .cse4) .cse7 (< .cse97 |ULTIMATE.start_main_~k~0#1|) .cse14 .cse15) (and .cse0 .cse1 (= .cse11 .cse58) (= .cse50 |ULTIMATE.start_main_~c~0#1|) .cse3 (= |ULTIMATE.start_main_~c~0#1| .cse56) (= .cse11 .cse48) (= |ULTIMATE.start_main_~c~0#1| .cse55) (<= |ULTIMATE.start_main_~c~0#1| .cse50) (= .cse54 .cse4) (= .cse8 .cse51) .cse53 (= |ULTIMATE.start_main_~y~0#1| .cse55) .cse7 (= .cse48 .cse13) (<= 3 .cse4) (= .cse44 .cse17) .cse42 (= .cse8 .cse46) .cse10 (= .cse4 .cse51) (< .cse54 |ULTIMATE.start_main_~k~0#1|) (= .cse50 |ULTIMATE.start_main_~y~0#1|) (= .cse38 0) (= |ULTIMATE.start_main_~y~0#1| .cse56) (= .cse24 .cse17) .cse14 (= |ULTIMATE.start_main_~y~0#1| .cse57) .cse15) (and .cse0 .cse1 .cse3 (= .cse8 .cse93) (= (let ((.cse98 (* .cse8 .cse8))) (+ (- .cse98) (+ (- (* (* (* .cse8 2) .cse8) .cse8)) (+ (- (* (* .cse98 .cse8) .cse8)) (* 4 .cse89))))) 0) (= |ULTIMATE.start_main_~y~0#1| .cse40) (= .cse99 |ULTIMATE.start_main_~c~0#1|) .cse7 (= .cse85 .cse51) (= .cse38 .cse55) (= .cse43 .cse4) (<= 7 .cse4) (= |ULTIMATE.start_main_~c~0#1| .cse40) .cse42 (= .cse37 .cse13) (= .cse11 .cse37) .cse10 (= |ULTIMATE.start_main_~y~0#1| .cse100) (= .cse4 .cse92) (< 7 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| .cse40) .cse14 (= .cse91 |ULTIMATE.start_main_~c~0#1|) .cse15) (and .cse0 .cse1 (= .cse24 .cse2) .cse3 (= |ULTIMATE.start_main_~y~0#1| .cse96) .cse7 (<= 17 .cse4) (<= |ULTIMATE.start_main_~c~0#1| (+ 1 .cse32)) (< .cse32 |ULTIMATE.start_main_~k~0#1|) (= .cse97 |ULTIMATE.start_main_~c~0#1|) (= .cse11 .cse33) .cse14 .cse15) (and .cse0 .cse1 (= .cse58 |ULTIMATE.start_main_~y~0#1|) .cse3 (= .cse48 |ULTIMATE.start_main_~y~0#1|) (<= 1 .cse4) (= .cse58 |ULTIMATE.start_main_~c~0#1|) .cse53 (= .cse13 0) (<= |ULTIMATE.start_main_~c~0#1| .cse58) (= .cse11 0) (= .cse48 |ULTIMATE.start_main_~c~0#1|) .cse42 .cse10 (= .cse8 .cse17) (= .cse4 .cse17) (< (+ (- 1) 1) |ULTIMATE.start_main_~k~0#1|) .cse15)))))))))))))))))))) [2023-02-18 04:09:36,633 INFO L899 garLoopResultBuilder]: For program point L28-1(lines 27 36) no Hoare annotation was computed. [2023-02-18 04:09:36,633 INFO L899 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2023-02-18 04:09:36,633 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse1 (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (or (and (= (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (+ (- (* (* (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|)) (+ (- (* (* |ULTIMATE.start_main_~y~0#1| .cse0) |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))) (- .cse0))) 0) .cse1) (and .cse1 (= |ULTIMATE.start_main_~y~0#1| (+ 0 1)) (= 0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))) (and (= |ULTIMATE.start_main_~y~0#1| 0) .cse1 (= |ULTIMATE.start_main_~x~0#1| 0)))) [2023-02-18 04:09:36,633 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2023-02-18 04:09:36,633 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2023-02-18 04:09:36,633 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2023-02-18 04:09:36,633 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 9 15) the Hoare annotation is: true [2023-02-18 04:09:36,633 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2023-02-18 04:09:36,633 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2023-02-18 04:09:36,635 INFO L445 BasicCegarLoop]: Path program histogram: [20, 1, 1, 1] [2023-02-18 04:09:36,636 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 04:09:36,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 04:09:36 BoogieIcfgContainer [2023-02-18 04:09:36,691 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 04:09:36,692 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 04:09:36,692 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 04:09:36,692 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 04:09:36,692 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 03:57:26" (3/4) ... [2023-02-18 04:09:36,694 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 04:09:36,698 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-18 04:09:36,700 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2023-02-18 04:09:36,700 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 04:09:36,700 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 04:09:36,700 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 04:09:36,727 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 04:09:36,727 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 04:09:36,727 INFO L158 Benchmark]: Toolchain (without parser) took 730539.96ms. Allocated memory was 144.7MB in the beginning and 180.4MB in the end (delta: 35.7MB). Free memory was 112.7MB in the beginning and 135.8MB in the end (delta: -23.1MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2023-02-18 04:09:36,729 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 144.7MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 04:09:36,729 INFO L158 Benchmark]: CACSL2BoogieTranslator took 143.54ms. Allocated memory is still 144.7MB. Free memory was 112.2MB in the beginning and 101.8MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 04:09:36,729 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.62ms. Allocated memory is still 144.7MB. Free memory was 101.8MB in the beginning and 100.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 04:09:36,729 INFO L158 Benchmark]: Boogie Preprocessor took 30.96ms. Allocated memory is still 144.7MB. Free memory was 100.3MB in the beginning and 99.3MB in the end (delta: 984.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 04:09:36,730 INFO L158 Benchmark]: RCFGBuilder took 215.97ms. Allocated memory is still 144.7MB. Free memory was 99.3MB in the beginning and 89.8MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 04:09:36,731 INFO L158 Benchmark]: TraceAbstraction took 730088.26ms. Allocated memory was 144.7MB in the beginning and 180.4MB in the end (delta: 35.7MB). Free memory was 88.8MB in the beginning and 138.9MB in the end (delta: -50.2MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. [2023-02-18 04:09:36,731 INFO L158 Benchmark]: Witness Printer took 35.47ms. Allocated memory is still 180.4MB. Free memory was 138.9MB in the beginning and 135.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-18 04:09:36,736 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 144.7MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 143.54ms. Allocated memory is still 144.7MB. Free memory was 112.2MB in the beginning and 101.8MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.62ms. Allocated memory is still 144.7MB. Free memory was 101.8MB in the beginning and 100.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.96ms. Allocated memory is still 144.7MB. Free memory was 100.3MB in the beginning and 99.3MB in the end (delta: 984.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 215.97ms. Allocated memory is still 144.7MB. Free memory was 99.3MB in the beginning and 89.8MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 730088.26ms. Allocated memory was 144.7MB in the beginning and 180.4MB in the end (delta: 35.7MB). Free memory was 88.8MB in the beginning and 138.9MB in the end (delta: -50.2MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. * Witness Printer took 35.47ms. Allocated memory is still 180.4MB. Free memory was 138.9MB in the beginning and 135.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 730.0s, OverallIterations: 23, TraceHistogramMax: 22, PathProgramHistogramMax: 20, EmptinessCheckTime: 0.0s, AutomataDifference: 83.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 29 mSolverCounterUnknown, 236 SdHoareTripleChecker+Valid, 76.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 225 mSDsluCounter, 6516 SdHoareTripleChecker+Invalid, 75.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 469 IncrementalHoareTripleChecker+Unchecked, 5850 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15730 IncrementalHoareTripleChecker+Invalid, 16300 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 666 mSDtfsCounter, 15730 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2524 GetRequests, 1895 SyntacticMatches, 18 SemanticMatches, 611 ConstructedPredicates, 56 IntricatePredicates, 0 DeprecatedPredicates, 1422 ImplicationChecksByTransitivity, 570.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=22, InterpolantAutomatonStates: 394, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 55 PreInvPairs, 122 NumberOfFragments, 24784 HoareAnnotationTreeSize, 55 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 637.3s InterpolantComputationTime, 1813 NumberOfCodeBlocks, 1807 NumberOfCodeBlocksAsserted, 124 NumberOfCheckSat, 1950 ConstructedInterpolants, 3 QuantifiedInterpolants, 20948 SizeOfPredicates, 113 NumberOfNonLiveVariables, 4804 ConjunctsInSsa, 1200 ConjunctsInUnsatCore, 25 InterpolantComputations, 2 PerfectInterpolantSequences, 7282/12760 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: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((k >= 0 && (((cond == 1 && k >= 0) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && 13 + 1 + 1 == c) && ((-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 && (cond == 1 || cond == 0)) || (((cond == 1 || cond == 0) && y == 0 + 1) && 0 == -1 * y * y * y + x))) && -1 + c == 13 + 1) && 14 + 1 == c) && ((k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || -15 + k < c + 1)) && -1 + y == 12 + 1 + 1) && 14 + 1 == y) && 0 < k) && c <= 13 + 1 + 1) && 14 <= -1 + c) && -1 + (-1 + y) == 12 + 1) && -1 + (-1 + c) == 12 + 1) && 13 + 1 < k) && 13 + 1 + 1 == y) && ((-16 + k < c + 1 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0)) && k <= 20) || (((((((((((k >= 0 && (((cond == 1 && k >= 0) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && 0 <= -1 + c) && ((-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 && (cond == 1 || cond == 0)) || (((cond == 1 || cond == 0) && y == 0 + 1) && 0 == -1 * y * y * y + x))) && -1 + c < k) && -1 + c == 0) && -1 + y == 0) && y == 0 + 1) && c <= 0 + 1) && 0 < k) && c == 0 + 1) && k <= 20)) || ((((((((((((((((k >= 0 && (((cond == 1 && k >= 0) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && 9 + 1 + 1 + 1 + 1 < k) && 13 + 1 == y) && ((-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 && (cond == 1 || cond == 0)) || (((cond == 1 || cond == 0) && y == 0 + 1) && 0 == -1 * y * y * y + x))) && 13 + 1 == c) && 12 + 1 + 1 == y) && -1 + c == 12 + 1) && -1 + y == 12 + 1) && 13 <= -1 + c) && ((k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || -15 + k < c + 1)) && 8 + 1 + 1 == -1 + (-1 + (-1 + (-1 + c)))) && 0 < k) && c <= 9 + 1 + 1 + 1 + 1 + 1) && 9 + 1 + 1 + 1 == -1 + (-1 + y)) && ((-16 + k < c + 1 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0)) && k <= 20)) || (((((((((((((((((((((k >= 0 && (((cond == 1 && k >= 0) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && 1 + (6 + 1 + 1) + 1 + 1 + 1 == y) && c == 11 + 1) && -1 + (-1 + (-1 + y)) == 8 + 1) && ((-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 && (cond == 1 || cond == 0)) || (((cond == 1 || cond == 0) && y == 0 + 1) && 0 == -1 * y * y * y + x))) && 8 + 1 + 1 + 1 + 1 == c) && 11 <= -1 + c) && ((k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || -15 + k < c + 1)) && 9 + 1 + 1 < k) && -1 + (-1 + (-1 + y)) == 7 + 1 + 1) && -1 + y == 10 + 1) && c <= 9 + 1 + 1 + 1) && 9 + 1 + 1 + 1 == y) && 8 + 1 + 1 + 1 == -1 + c) && -1 + (-1 + y) == 9 + 1) && -1 + c == 10 + 1) && 0 < k) && 9 + 1 + 1 + 1 == c) && ((-16 + k < c + 1 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0)) && -1 + (-1 + c) == 8 + 1 + 1) && k <= 20)) || ((((((((((((((k >= 0 && (((cond == 1 && k >= 0) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && c == 16 + 1) && -1 + (-1 + y) == 13 + 1 + 1) && 16 <= -1 + c) && ((-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 && (cond == 1 || cond == 0)) || (((cond == 1 || cond == 0) && y == 0 + 1) && 0 == -1 * y * y * y + x))) && -1 + y == 15 + 1) && 14 + 1 + 1 + 1 == y) && -1 + (-1 + y) == 14 + 1) && ((k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || -15 + k < c + 1)) && c <= 14 + 1 + 1 + 1) && 14 + 1 + 1 < k) && c == 13 + 1 + 1 + 1 + 1) && ((-16 + k < c + 1 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0)) && k <= 20)) || (((((((((((((((((((((k >= 0 && (((cond == 1 && k >= 0) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && -1 + y == 7 + 1 + 1) && 9 <= -1 + c) && 5 + 1 == -1 + (-1 + (-1 + (-1 + y)))) && ((-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 && (cond == 1 || cond == 0)) || (((cond == 1 || cond == 0) && y == 0 + 1) && 0 == -1 * y * y * y + x))) && 9 + 1 == y) && -1 + c == 8 + 1) && 4 + 1 + 1 + 1 + 1 + 1 < k) && 9 + 1 == c) && -1 + (-1 + c) == 7 + 1) && x >= 2025 + y * (y * y)) && ((k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || -15 + k < c + 1)) && c == 8 + 1 + 1) && c <= 4 + 1 + 1 + 1 + 1 + 1 + 1) && 0 + 1 < k) && -1 + y == 8 + 1) && 0 < k) && 3 + 1 + 1 + 1 + 1 == -1 + (-1 + (-1 + c))) && 1 + (6 + 1 + 1) + 1 == y) && ((-16 + k < c + 1 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0)) && k <= 20)) || ((((((((((((((((((((((((((((((((k >= 0 && (((cond == 1 && k >= 0) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && -1 + (-1 + y) == 2 + 1) && 3 + 1 + 1 == c) && 4 <= -1 + c) && 0 + 1 == -1 + (-1 + (-1 + (-1 + c)))) && 0 + 1 + 1 == -1 + (-1 + (-1 + c))) && c <= 4 + 1) && ((-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 && (cond == 1 || cond == 0)) || (((cond == 1 || cond == 0) && y == 0 + 1) && 0 == -1 * y * y * y + x))) && -1 + y == 0 + 1 + 1 + 1 + 1) && c == 4 + 1) && 0 + 1 == -1 + (-1 + (-1 + (-1 + y)))) && 4 < k) && -1 + (-1 + y) == 1 + 1 + 1) && 2 + 1 + 1 + 1 == c) && 1 < k) && -1 + (-1 + c) == 1 + 1 + 1) && 0 + 1 + 1 + 1 == -1 + (-1 + c)) && ((k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || -15 + k < c + 1)) && 0 + 1 + 1 == -1 + (-1 + (-1 + y))) && -1 + c == 3 + 1) && -1 + y == 2 + 1 + 1) && -1 + y == 1 + 1 + 1 + 1) && 0 + 1 < k) && 1 + 1 == -1 + (-1 + (-1 + y))) && y == 4 + 1) && 2 + 1 + 1 + 1 == y) && 0 < k) && -1 + c == 2 + 1 + 1) && -1 + c == 0 + 1 + 1 + 1 + 1) && -1 + y == 3 + 1) && ((-16 + k < c + 1 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0)) && k <= 20)) || (((((((((((((((((((k >= 0 && (((cond == 1 && k >= 0) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && 8 + 1 + 1 == -1 + (-1 + (-1 + c))) && ((-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 && (cond == 1 || cond == 0)) || (((cond == 1 || cond == 0) && y == 0 + 1) && 0 == -1 * y * y * y + x))) && 9 + 1 + 1 + 1 + 1 == c) && 7 + 1 + 1 == -1 + (-1 + (-1 + (-1 + y)))) && -1 + (-1 + c) == 8 + 1 + 1 + 1) && ((k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || -15 + k < c + 1)) && 11 + 1 < k) && 12 <= -1 + c) && 9 + 1 + 1 + 1 == -1 + y) && 12 + 1 == y) && 0 < k) && 12 + 1 == c) && 1 + (6 + 1 + 1) + 1 + 1 + 1 == -1 + y) && -1 + (-1 + c) == 10 + 1) && c <= 11 + 1 + 1) && ((-16 + k < c + 1 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0)) && k <= 20) && -1 + c == 8 + 1 + 1 + 1 + 1)) || (((((((((((((((((((((((((k >= 0 && (-((y + 1 + 1) * (y + 1 + 1)) + k * (y + 1 + 1) == 0 || -1 + k < c + 1)) && (((cond == 1 && k >= 0) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && 19 <= -1 + k) && ((-17 + k < c + 1 || -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) + (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * k == 0) || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0))) && (-((y + 1) * (y + 1)) + (y + 1) * k == 0 || !(c < k))) && ((-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 && (cond == 1 || cond == 0)) || (((cond == 1 || cond == 0) && y == 0 + 1) && 0 == -1 * y * y * y + x))) && (k + -8 < c + 1 || (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * k + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0)) && ((!((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0) || k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0) || k + -18 < c + 1)) && ((k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0 || -14 + k < c + 1) || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0))) && (-((y + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1)) + k * (y + 1 + 1 + 1 + 1 + 1 + 1) == 0 || k + -5 < c + 1)) && ((k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || -15 + k < c + 1)) && (k + -6 < c + 1 || (y + 1 + 1 + 1 + 1 + 1 + 1 + 1) * k + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0)) && (-((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) + (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * k == 0 || -7 + k < c + 1)) && (k + -4 < c + 1 || -((y + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1)) + (y + 1 + 1 + 1 + 1 + 1) * k == 0)) && (-((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) + k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) == 0 || -9 + k < c + 1)) && (-11 + k < c + 1 || -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) + (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * k == 0)) && ((k + -19 < c + 1 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) + (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * k == 0)) && (k + -10 < c + 1 || (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * k + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0)) && ((k + -12 < c + 1 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * k + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0)) && ((!((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0) || -13 + k < c + 1) || k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0)) && ((-16 + k < c + 1 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0)) && (-((y + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1)) + (y + 1 + 1 + 1 + 1) * k == 0 || -3 + k < c + 1)) && y == 19 + 1) && k <= 20) && (-2 + k < c + 1 || -((y + 1 + 1 + 1) * (y + 1 + 1 + 1)) + (y + 1 + 1 + 1) * k == 0))) || (((((((((((((((14 + 1 + 1 == c && k >= 0) && (((cond == 1 && k >= 0) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && ((-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 && (cond == 1 || cond == 0)) || (((cond == 1 || cond == 0) && y == 0 + 1) && 0 == -1 * y * y * y + x))) && -1 + y == 13 + 1 + 1) && 15 < k) && ((k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || -15 + k < c + 1)) && -1 + y == 14 + 1) && 12 + 1 == -1 + (-1 + (-1 + c))) && c == 13 + 1 + 1 + 1) && c <= 15 + 1) && 14 + 1 + 1 == y) && 15 <= -1 + c) && y == 15 + 1) && ((-16 + k < c + 1 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0)) && k <= 20)) || (((((((c == 0 && k >= 0) && (((cond == 1 && k >= 0) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && y == 0) && c >= 0) && (cond == 1 || cond == 0)) && x == 0) && k <= 20)) || ((((((((((((((((((((((((((0 + 1 + 1 == -1 + (-1 + (-1 + (-1 + c))) && k >= 0) && (((cond == 1 && k >= 0) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && 5 <= -1 + c) && ((-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 && (cond == 1 || cond == 0)) || (((cond == 1 || cond == 0) && y == 0 + 1) && 0 == -1 * y * y * y + x))) && 2 + 1 + 1 + 1 == -1 + c) && 5 + 1 == c) && (y * y * y * y + 2 * y * y * y + y * y) % 4 == 0) && 2 + 1 + 1 + 1 + 1 == y) && -1 + (-1 + c) == 0 + 1 + 1 + 1 + 1) && 1 < k) && -1 + (-1 + (-1 + (-1 + (-1 + c)))) == 0 + 1) && 2 + 1 + 1 + 1 == -1 + y) && ((k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || -15 + k < c + 1)) && -1 + (-1 + (-1 + c)) == 1 + 1 + 1) && c == 3 + 1 + 1 + 1) && 0 + 1 < k) && 0 < k) && 4 + 1 + 1 == c) && 4 + 1 < k) && 5 + 1 == y) && 4 + 1 + 1 == y) && -1 + (-1 + c) == 3 + 1) && -1 + (-1 + y) == 3 + 1) && ((-16 + k < c + 1 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0)) && c <= 4 + 1 + 1) && k <= 20)) || (((((((((((((((((((((((k >= 0 && (((cond == 1 && k >= 0) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && y == 7 + 1 + 1) && 0 == -((-1 + (-1 + y)) * (-1 + (-1 + y))) + ((-1 * (-1 + y) * (-1 + y) * (-1 + y) + (-1 * y * y * y + x)) * 4 + -((-1 + (-1 + y)) * ((-1 + (-1 + y)) * ((-1 + (-1 + y)) * (-1 + (-1 + y))))) + -((-1 + (-1 + y)) * ((-1 + (-1 + y)) * ((-1 + (-1 + y)) * 2))))) && 3 + 1 + 1 + 1 + 1 == -1 + (-1 + c)) && -1 + (-1 + (-1 + (-1 + (-1 + y)))) == 3 + 1) && ((-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 && (cond == 1 || cond == 0)) || (((cond == 1 || cond == 0) && y == 0 + 1) && 0 == -1 * y * y * y + x))) && -1 + c == 7 + 1) && -1 + y == 7 + 1) && y == 8 + 1) && 4 + 1 + 1 + 1 + 1 + 1 == c) && 5 + 1 == -1 + (-1 + (-1 + y))) && ((k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || -15 + k < c + 1)) && 1 + (6 + 1 + 1) == y) && c <= 5 + 1 + 1 + 1 + 1) && 5 + 1 + 1 + 1 < k) && 0 + 1 < k) && 0 < k) && -1 + (-1 + c) == 6 + 1) && c == 8 + 1) && -1 + (-1 + y) == 5 + 1 + 1) && 8 <= -1 + c) && ((-16 + k < c + 1 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0)) && k <= 20)) || (((((((((((((((((((((k >= 0 && (((cond == 1 && k >= 0) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && c <= 9 + 1 + 1) && 8 + 1 + 1 + 1 == c) && ((-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 && (cond == 1 || cond == 0)) || (((cond == 1 || cond == 0) && y == 0 + 1) && 0 == -1 * y * y * y + x))) && -1 + (-1 + y) == 7 + 1 + 1) && c == 9 + 1 + 1) && c == 10 + 1) && -1 + (-1 + y) == 8 + 1) && 9 + 1 < k) && 3 + 1 + 1 + 1 + 1 == -1 + (-1 + (-1 + (-1 + c)))) && 10 <= -1 + c) && y == 9 + 1 + 1) && ((k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || -15 + k < c + 1)) && 1 + (6 + 1 + 1) + 1 + 1 == y) && -1 + y == 9 + 1) && 0 + 1 < k) && 0 < k) && y == 10 + 1) && ((-16 + k < c + 1 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0)) && -1 + c == 8 + 1 + 1) && k <= 20)) || ((((((((((((((((((((((((k >= 0 && (((cond == 1 && k >= 0) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && 1 + 1 + 1 == -1 + (-1 + (-1 + (-1 + c)))) && ((-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 && (cond == 1 || cond == 0)) || (((cond == 1 || cond == 0) && y == 0 + 1) && 0 == -1 * y * y * y + x))) && y == 6 + 1) && 2 + 1 + 1 + 1 + 1 == -1 + y) && c == 5 + 1 + 1) && c == 4 + 1 + 1 + 1) && 6 <= -1 + c) && -1 + (-1 + (-1 + y)) == 3 + 1) && ((k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || -15 + k < c + 1)) && -1 + (-1 + y) == 2 + 1 + 1 + 1) && y == 5 + 1 + 1) && -1 + (-1 + (-1 + c)) == 3 + 1) && 0 + 1 < k) && 0 < k) && c <= 6 + 1) && 6 < k) && c == 6 + 1) && 3 + 1 + 1 + 1 + 1 == c) && 5 + 1 == -1 + y) && 5 + 1 == -1 + c) && -1 + y == 4 + 1 + 1) && ((-16 + k < c + 1 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0)) && k <= 20)) || ((((((((((((((((((((((k >= 0 && (((cond == 1 && k >= 0) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && c == 1 + 1 + 1) && 2 + 1 == c) && ((-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 && (cond == 1 || cond == 0)) || (((cond == 1 || cond == 0) && y == 0 + 1) && 0 == -1 * y * y * y + x))) && -1 + (-1 + c) == 0 + 1) && 0 + 1 + 1 == -1 + y) && 1 < k) && 0 + 1 + 1 + 1 == c) && 2 + 1 == y) && c <= 2 + 1) && 0 + 1 + 1 + 1 == y) && 0 + 1 < k) && 1 + 1 == -1 + y) && 0 < k) && 2 < k) && -1 + (-1 + y) == 0 + 1) && y == 1 + 1 + 1) && -1 + (-1 + (-1 + y)) == 0) && 0 + 1 + 1 == -1 + c) && 2 <= -1 + c) && ((-16 + k < c + 1 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0)) && k <= 20)) || ((((((((((k >= 0 && (((cond == 1 && k >= 0) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && ((-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 && (cond == 1 || cond == 0)) || (((cond == 1 || cond == 0) && y == 0 + 1) && 0 == -1 * y * y * y + x))) && -1 + y == 17 + 1) && c <= 13 + 1 + 1 + 1 + 1 + 1 + 1) && 18 + 1 == y) && 18 <= -1 + c) && ((k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || -15 + k < c + 1)) && 13 + 1 + 1 + 1 + 1 + 1 < k) && ((-16 + k < c + 1 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0)) && k <= 20)) || ((((((((((((((((((((((((((((k >= 0 && (((cond == 1 && k >= 0) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && -1 + (-1 + y) == 1 + 1) && 0 + 1 + 1 + 1 + 1 == c) && ((-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 && (cond == 1 || cond == 0)) || (((cond == 1 || cond == 0) && y == 0 + 1) && 0 == -1 * y * y * y + x))) && c == 2 + 1 + 1) && -1 + (-1 + y) == 0 + 1 + 1) && c == 3 + 1) && c <= 0 + 1 + 1 + 1 + 1) && 0 + 1 + 1 + 1 == -1 + c) && -1 + y == 1 + 1 + 1) && 1 < k) && y == 3 + 1) && ((k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || -15 + k < c + 1)) && 0 + 1 + 1 == -1 + (-1 + c)) && 3 <= -1 + c) && -1 + (-1 + (-1 + c)) == 0 + 1) && 0 + 1 < k) && -1 + y == 2 + 1) && 0 < k) && -1 + c == 1 + 1 + 1) && 0 + 1 + 1 + 1 < k) && 0 + 1 + 1 + 1 + 1 == y) && -1 + (-1 + (-1 + (-1 + y))) == 0) && y == 2 + 1 + 1) && -1 + (-1 + (-1 + y)) == 0 + 1) && ((-16 + k < c + 1 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0)) && y == 1 + 1 + 1 + 1) && k <= 20)) || (((((((((((((((((((((((k >= 0 && (((cond == 1 && k >= 0) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && ((-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 && (cond == 1 || cond == 0)) || (((cond == 1 || cond == 0) && y == 0 + 1) && 0 == -1 * y * y * y + x))) && -1 + y == 5 + 1 + 1) && -((-1 + y) * (-1 + y)) + (-((-1 + y) * 2 * (-1 + y) * (-1 + y)) + (-((-1 + y) * (-1 + y) * (-1 + y) * (-1 + y)) + 4 * (-1 * y * y * y + x))) == 0) && y == 7 + 1) && 4 + 1 + 1 + 1 + 1 == c) && ((k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || -15 + k < c + 1)) && -1 + (-1 + (-1 + (-1 + (-1 + c)))) == 1 + 1 + 1) && -1 + (-1 + (-1 + (-1 + y))) == 3 + 1) && 3 + 1 + 1 + 1 + 1 == -1 + c) && 7 <= -1 + c) && c == 7 + 1) && 0 + 1 < k) && 5 + 1 == -1 + (-1 + c)) && -1 + (-1 + y) == 5 + 1) && 0 < k) && y == 6 + 1 + 1) && -1 + c == 6 + 1) && 7 < k) && c <= 7 + 1) && ((-16 + k < c + 1 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0)) && 5 + 1 + 1 + 1 == c) && k <= 20)) || ((((((((((((k >= 0 && (((cond == 1 && k >= 0) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && -1 + (-1 + (-1 + y)) == 13 + 1 + 1) && ((-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 && (cond == 1 || cond == 0)) || (((cond == 1 || cond == 0) && y == 0 + 1) && 0 == -1 * y * y * y + x))) && y == 17 + 1) && ((k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || -15 + k < c + 1)) && 17 <= -1 + c) && c <= 1 + (16 + 1)) && 16 + 1 < k) && 13 + 1 + 1 + 1 + 1 + 1 == c) && -1 + (-1 + y) == 15 + 1) && ((-16 + k < c + 1 || !((y * y * y * y + 2 * y * y * y + y * y) % 4 == 0)) || k * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) + -((y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1)) == 0)) && k <= 20)) || (((((((((((((((((k >= 0 && (((cond == 1 && k >= 0) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && 1 + 1 == y) && ((-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 && (cond == 1 || cond == 0)) || (((cond == 1 || cond == 0) && y == 0 + 1) && 0 == -1 * y * y * y + x))) && 0 + 1 + 1 == y) && 1 <= -1 + c) && 1 + 1 == c) && 1 < k) && -1 + (-1 + c) == 0) && c <= 1 + 1) && -1 + (-1 + y) == 0) && 0 + 1 + 1 == c) && 0 + 1 < k) && 0 < k) && -1 + y == 0 + 1) && -1 + c == 0 + 1) && -1 + 1 < k) && k <= 20) RESULT: Ultimate proved your program to be correct! [2023-02-18 04:09:36,849 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