./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 574ddb4e 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-?-574ddb4 [2023-02-18 19:14:23,626 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 19:14:23,627 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 19:14:23,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 19:14:23,651 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 19:14:23,653 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 19:14:23,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 19:14:23,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 19:14:23,659 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 19:14:23,663 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 19:14:23,664 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 19:14:23,666 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 19:14:23,666 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 19:14:23,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 19:14:23,670 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 19:14:23,671 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 19:14:23,673 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 19:14:23,673 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 19:14:23,674 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 19:14:23,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 19:14:23,679 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 19:14:23,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 19:14:23,680 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 19:14:23,681 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 19:14:23,683 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 19:14:23,684 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 19:14:23,684 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 19:14:23,685 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 19:14:23,686 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 19:14:23,687 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 19:14:23,687 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 19:14:23,688 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 19:14:23,688 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 19:14:23,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 19:14:23,690 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 19:14:23,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 19:14:23,695 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 19:14:23,695 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 19:14:23,695 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 19:14:23,696 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 19:14:23,697 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 19:14:23,698 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 19:14:23,727 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 19:14:23,727 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 19:14:23,727 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 19:14:23,727 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 19:14:23,728 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 19:14:23,728 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 19:14:23,729 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 19:14:23,729 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 19:14:23,729 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 19:14:23,729 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 19:14:23,730 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 19:14:23,730 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 19:14:23,730 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 19:14:23,730 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 19:14:23,730 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 19:14:23,730 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 19:14:23,731 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 19:14:23,731 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 19:14:23,731 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 19:14:23,731 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 19:14:23,731 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 19:14:23,731 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 19:14:23,732 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 19:14:23,732 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 19:14:23,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 19:14:23,732 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 19:14:23,732 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 19:14:23,732 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 19:14:23,733 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 19:14:23,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 19:14:23,733 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 19:14:23,733 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 19:14:23,733 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 19:14:23,733 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 19:14:23,734 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 19:14:23,734 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 19:14:23,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 19:14:23,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 19:14:23,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 19:14:23,954 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 19:14:23,954 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 19:14:23,955 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 19:14:24,925 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 19:14:25,066 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 19:14:25,066 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound20.c [2023-02-18 19:14:25,070 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0899238eb/31716c3560974c41a6cc6ff914bbecf7/FLAG41451dedf [2023-02-18 19:14:25,083 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0899238eb/31716c3560974c41a6cc6ff914bbecf7 [2023-02-18 19:14:25,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 19:14:25,086 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 19:14:25,086 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 19:14:25,086 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 19:14:25,088 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 19:14:25,089 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:14:25" (1/1) ... [2023-02-18 19:14:25,091 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b0a477b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:25, skipping insertion in model container [2023-02-18 19:14:25,091 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:14:25" (1/1) ... [2023-02-18 19:14:25,096 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 19:14:25,115 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 19:14:25,196 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 19:14:25,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 19:14:25,210 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 19:14:25,219 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 19:14:25,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 19:14:25,231 INFO L208 MainTranslator]: Completed translation [2023-02-18 19:14:25,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:25 WrapperNode [2023-02-18 19:14:25,231 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 19:14:25,232 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 19:14:25,232 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 19:14:25,232 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 19:14:25,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:25" (1/1) ... [2023-02-18 19:14:25,240 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:25" (1/1) ... [2023-02-18 19:14:25,250 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2023-02-18 19:14:25,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 19:14:25,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 19:14:25,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 19:14:25,251 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 19:14:25,256 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:25" (1/1) ... [2023-02-18 19:14:25,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:25" (1/1) ... [2023-02-18 19:14:25,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:25" (1/1) ... [2023-02-18 19:14:25,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:25" (1/1) ... [2023-02-18 19:14:25,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:25" (1/1) ... [2023-02-18 19:14:25,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:25" (1/1) ... [2023-02-18 19:14:25,262 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:25" (1/1) ... [2023-02-18 19:14:25,262 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:25" (1/1) ... [2023-02-18 19:14:25,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 19:14:25,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 19:14:25,264 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 19:14:25,264 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 19:14:25,264 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:25" (1/1) ... [2023-02-18 19:14:25,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 19:14:25,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:14:25,287 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 19:14:25,296 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 19:14:25,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 19:14:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 19:14:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 19:14:25,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 19:14:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 19:14:25,314 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 19:14:25,357 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 19:14:25,358 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 19:14:25,460 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 19:14:25,464 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 19:14:25,464 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-18 19:14:25,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:14:25 BoogieIcfgContainer [2023-02-18 19:14:25,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 19:14:25,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 19:14:25,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 19:14:25,469 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 19:14:25,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 07:14:25" (1/3) ... [2023-02-18 19:14:25,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a7e706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:14:25, skipping insertion in model container [2023-02-18 19:14:25,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:25" (2/3) ... [2023-02-18 19:14:25,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a7e706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:14:25, skipping insertion in model container [2023-02-18 19:14:25,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:14:25" (3/3) ... [2023-02-18 19:14:25,471 INFO L112 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound20.c [2023-02-18 19:14:25,482 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 19:14:25,482 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 19:14:25,510 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 19:14:25,515 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;@1754782e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 19:14:25,515 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 19:14:25,518 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 19:14:25,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 19:14:25,522 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:14:25,523 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:14:25,523 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:14:25,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:14:25,527 INFO L85 PathProgramCache]: Analyzing trace with hash -589436290, now seen corresponding path program 1 times [2023-02-18 19:14:25,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:14:25,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573481462] [2023-02-18 19:14:25,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:14:25,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:14:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:14:25,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:14:25,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573481462] [2023-02-18 19:14:25,635 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-18 19:14:25,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554056946] [2023-02-18 19:14:25,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:14:25,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:14:25,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:14:25,638 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 19:14:25,640 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 19:14:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:14:25,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-18 19:14:25,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:14:25,715 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 19:14:25,728 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 19:14:25,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554056946] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 19:14:25,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 19:14:25,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 19:14:25,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923942205] [2023-02-18 19:14:25,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 19:14:25,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 19:14:25,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:14:25,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 19:14:25,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 19:14:25,779 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 19:14:25,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:14:25,795 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2023-02-18 19:14:25,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 19:14:25,796 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 19:14:25,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:14:25,800 INFO L225 Difference]: With dead ends: 35 [2023-02-18 19:14:25,800 INFO L226 Difference]: Without dead ends: 15 [2023-02-18 19:14:25,802 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 19:14:25,804 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 19:14:25,805 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 19:14:25,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-02-18 19:14:25,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-02-18 19:14:25,825 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 19:14:25,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2023-02-18 19:14:25,826 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 9 [2023-02-18 19:14:25,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:14:25,826 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-02-18 19:14:25,827 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 19:14:25,827 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2023-02-18 19:14:25,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 19:14:25,827 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:14:25,827 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:14:25,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-18 19:14:26,034 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 19:14:26,035 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:14:26,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:14:26,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1187358532, now seen corresponding path program 1 times [2023-02-18 19:14:26,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:14:26,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094077141] [2023-02-18 19:14:26,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:14:26,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:14:26,055 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:14:26,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2089392562] [2023-02-18 19:14:26,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:14:26,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:14:26,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:14:26,058 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 19:14:26,060 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 19:14:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:14:26,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 19:14:26,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:14:26,128 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 19:14:26,128 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 19:14:26,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:14:26,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094077141] [2023-02-18 19:14:26,129 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:14:26,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089392562] [2023-02-18 19:14:26,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089392562] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 19:14:26,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 19:14:26,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 19:14:26,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322348965] [2023-02-18 19:14:26,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 19:14:26,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 19:14:26,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:14:26,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 19:14:26,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 19:14:26,131 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 19:14:26,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:14:26,166 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2023-02-18 19:14:26,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 19:14:26,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-18 19:14:26,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:14:26,168 INFO L225 Difference]: With dead ends: 26 [2023-02-18 19:14:26,168 INFO L226 Difference]: Without dead ends: 22 [2023-02-18 19:14:26,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 19:14:26,169 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 19:14:26,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 45 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 19:14:26,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-18 19:14:26,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-18 19:14:26,174 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 19:14:26,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2023-02-18 19:14:26,174 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 9 [2023-02-18 19:14:26,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:14:26,175 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2023-02-18 19:14:26,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 19:14:26,175 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2023-02-18 19:14:26,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-18 19:14:26,175 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:14:26,175 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:14:26,183 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 19:14:26,381 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 19:14:26,382 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:14:26,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:14:26,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1781398469, now seen corresponding path program 1 times [2023-02-18 19:14:26,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:14:26,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363661031] [2023-02-18 19:14:26,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:14:26,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:14:26,391 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:14:26,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1885717965] [2023-02-18 19:14:26,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:14:26,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:14:26,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:14:26,392 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 19:14:26,394 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 19:14:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:14:26,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 19:14:26,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:14:26,523 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 19:14:26,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:14:26,893 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 19:14:26,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:14:26,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363661031] [2023-02-18 19:14:26,894 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:14:26,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885717965] [2023-02-18 19:14:26,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885717965] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 19:14:26,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 19:14:26,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2023-02-18 19:14:26,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44410553] [2023-02-18 19:14:26,895 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 19:14:26,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 19:14:26,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:14:26,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 19:14:26,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-02-18 19:14:26,897 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 19:14:26,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:14:26,971 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2023-02-18 19:14:26,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 19:14:26,971 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 19:14:26,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:14:26,972 INFO L225 Difference]: With dead ends: 33 [2023-02-18 19:14:26,972 INFO L226 Difference]: Without dead ends: 27 [2023-02-18 19:14:26,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-02-18 19:14:26,973 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 20 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 19:14:26,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 39 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 19:14:26,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-18 19:14:26,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2023-02-18 19:14:26,978 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 19:14:26,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2023-02-18 19:14:26,979 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 16 [2023-02-18 19:14:26,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:14:26,979 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2023-02-18 19:14:26,979 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 19:14:26,979 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2023-02-18 19:14:26,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-18 19:14:26,980 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:14:26,980 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:14:26,987 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 19:14:27,185 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 19:14:27,185 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:14:27,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:14:27,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1711372296, now seen corresponding path program 1 times [2023-02-18 19:14:27,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:14:27,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190842362] [2023-02-18 19:14:27,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:14:27,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:14:27,193 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:14:27,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1662050149] [2023-02-18 19:14:27,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:14:27,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:14:27,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:14:27,195 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 19:14:27,197 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 19:14:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:14:27,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-18 19:14:27,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:14:29,304 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 19:14:29,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:14:37,452 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1 |c_ULTIMATE.start_main_~y~0#1|))) (let ((.cse0 (* .cse1 .cse1))) (or (not (<= (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) (div (+ (- (* |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|)) (* (- 6) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (* (- 13) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (- 4)) 1) (+ (* .cse0 .cse1) |c_ULTIMATE.start_main_~x~0#1|))) (not (= (mod (+ (* 2 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 3 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 3 |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 (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse1) (- .cse0))) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|) (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))))))) is different from false [2023-02-18 19:14:37,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:14:37,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190842362] [2023-02-18 19:14:37,462 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:14:37,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662050149] [2023-02-18 19:14:37,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662050149] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 19:14:37,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 19:14:37,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2023-02-18 19:14:37,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629421609] [2023-02-18 19:14:37,463 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 19:14:37,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 19:14:37,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:14:37,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 19:14:37,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=163, Unknown=3, NotChecked=26, Total=240 [2023-02-18 19:14:37,464 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) 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 19:14:38,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 19:14:40,969 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 19:14:43,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 19:14:45,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:14:45,328 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2023-02-18 19:14:45,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 19:14:45,329 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) 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 19:14:45,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:14:45,330 INFO L225 Difference]: With dead ends: 31 [2023-02-18 19:14:45,330 INFO L226 Difference]: Without dead ends: 26 [2023-02-18 19:14:45,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=71, Invalid=236, Unknown=3, NotChecked=32, Total=342 [2023-02-18 19:14:45,332 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-02-18 19:14:45,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 53 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 2 Unknown, 0 Unchecked, 5.8s Time] [2023-02-18 19:14:45,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-18 19:14:45,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-02-18 19:14:45,337 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 19:14:45,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2023-02-18 19:14:45,337 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 22 [2023-02-18 19:14:45,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:14:45,338 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2023-02-18 19:14:45,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) 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 19:14:45,338 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2023-02-18 19:14:45,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-18 19:14:45,339 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:14:45,339 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:14:45,355 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 19:14:45,543 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 19:14:45,543 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:14:45,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:14:45,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1075497887, now seen corresponding path program 2 times [2023-02-18 19:14:45,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:14:45,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36762814] [2023-02-18 19:14:45,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:14:45,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:14:45,551 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:14:45,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [260930267] [2023-02-18 19:14:45,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 19:14:45,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:14:45,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:14:45,554 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 19:14:45,556 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 19:14:45,592 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 19:14:45,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 19:14:45,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-18 19:14:45,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:14:45,650 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 19:14:45,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:14:47,738 WARN L837 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* 2 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 3 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 3 |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 (= 0 (let ((.cse0 (+ 1 |c_ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~k~0#1| .cse0) (- (* .cse0 .cse0))))) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|) (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))))) is different from false [2023-02-18 19:14:47,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:14:47,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36762814] [2023-02-18 19:14:47,740 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:14:47,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260930267] [2023-02-18 19:14:47,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260930267] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 19:14:47,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 19:14:47,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2023-02-18 19:14:47,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945130054] [2023-02-18 19:14:47,740 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 19:14:47,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 19:14:47,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:14:47,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 19:14:47,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=148, Unknown=1, NotChecked=24, Total=210 [2023-02-18 19:14:47,741 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 19:14:47,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:14:47,828 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2023-02-18 19:14:47,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 19:14:47,829 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 19:14:47,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:14:47,830 INFO L225 Difference]: With dead ends: 34 [2023-02-18 19:14:47,830 INFO L226 Difference]: Without dead ends: 29 [2023-02-18 19:14:47,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=56, Invalid=219, Unknown=1, NotChecked=30, Total=306 [2023-02-18 19:14:47,831 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 19:14:47,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 68 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 19:14:47,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-18 19:14:47,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-18 19:14:47,836 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 19:14:47,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2023-02-18 19:14:47,836 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2023-02-18 19:14:47,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:14:47,837 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2023-02-18 19:14:47,837 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 19:14:47,837 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2023-02-18 19:14:47,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-18 19:14:47,837 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:14:47,837 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:14:47,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-18 19:14:48,042 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 19:14:48,042 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:14:48,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:14:48,043 INFO L85 PathProgramCache]: Analyzing trace with hash 817917912, now seen corresponding path program 3 times [2023-02-18 19:14:48,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:14:48,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959409190] [2023-02-18 19:14:48,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:14:48,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:14:48,052 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:14:48,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [768269756] [2023-02-18 19:14:48,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 19:14:48,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:14:48,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:14:48,069 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 19:14:48,069 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 19:14:48,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-18 19:14:48,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 19:14:48,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-18 19:14:48,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:14:48,156 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 19:14:48,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:15:10,780 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_9| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| Int)) (or (= (mod (+ (* 2 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19|) (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19|) (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19|)) 4) 0) (= 0 (+ (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19|) (- (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19|))))))) is different from true [2023-02-18 19:15:16,802 WARN L859 $PredicateComparison]: unable to prove that (or (= 0 c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_9| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| Int)) (or (= (mod (+ (* 2 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19|) (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19|) (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19|)) 4) 0) (= 0 (+ (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19|) (- (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19|))))))) is different from true [2023-02-18 19:15:20,821 WARN L837 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* 2 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 3 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 3 |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 (= 0 (let ((.cse0 (+ 1 |c_ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~k~0#1| .cse0) (- (* .cse0 .cse0))))) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|) (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))))) is different from false [2023-02-18 19:15:20,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:15:20,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959409190] [2023-02-18 19:15:20,826 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:15:20,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768269756] [2023-02-18 19:15:20,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768269756] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 19:15:20,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 19:15:20,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-02-18 19:15:20,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731655637] [2023-02-18 19:15:20,827 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 19:15:20,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 19:15:20,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:15:20,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 19:15:20,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=169, Unknown=7, NotChecked=84, Total=306 [2023-02-18 19:15:20,828 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 19:15:20,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:15:20,947 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2023-02-18 19:15:20,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 19:15:20,947 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 19:15:20,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:15:20,949 INFO L225 Difference]: With dead ends: 37 [2023-02-18 19:15:20,949 INFO L226 Difference]: Without dead ends: 32 [2023-02-18 19:15:20,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=66, Invalid=245, Unknown=7, NotChecked=102, Total=420 [2023-02-18 19:15:20,951 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 19:15:20,951 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 19:15:20,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-18 19:15:20,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-18 19:15:20,965 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 19:15:20,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2023-02-18 19:15:20,968 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 36 [2023-02-18 19:15:20,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:15:20,977 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2023-02-18 19:15:20,978 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 19:15:20,978 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2023-02-18 19:15:20,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-18 19:15:20,982 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:15:20,983 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:15:21,000 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 19:15:21,188 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 19:15:21,188 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:15:21,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:15:21,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1384689793, now seen corresponding path program 4 times [2023-02-18 19:15:21,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:15:21,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121745483] [2023-02-18 19:15:21,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:15:21,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:15:21,197 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:15:21,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2130610319] [2023-02-18 19:15:21,198 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 19:15:21,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:15:21,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:15:21,199 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 19:15:21,201 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 19:15:21,240 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 19:15:21,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 19:15:21,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-18 19:15:21,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:15:21,320 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 21 proven. 31 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-18 19:15:21,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:15:36,931 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_12| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| Int)) (or (= 0 (+ (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_12| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26|) (- (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26|)))) (= (mod (+ (* 2 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26|) (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26|) (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26|)) 4) 0)))) is different from true [2023-02-18 19:15:42,952 WARN L859 $PredicateComparison]: unable to prove that (or (= 0 c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| Int)) (or (= 0 (+ (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_12| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26|) (- (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26|)))) (= (mod (+ (* 2 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26|) (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26|) (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26|)) 4) 0)))) is different from true [2023-02-18 19:15:46,965 WARN L837 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* 2 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 3 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 3 |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 (= 0 (let ((.cse0 (+ 1 |c_ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~k~0#1| .cse0) (- (* .cse0 .cse0))))) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|) (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))))) is different from false [2023-02-18 19:15:46,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:15:46,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121745483] [2023-02-18 19:15:46,970 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:15:46,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130610319] [2023-02-18 19:15:46,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130610319] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 19:15:46,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 19:15:46,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2023-02-18 19:15:46,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813666690] [2023-02-18 19:15:46,970 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 19:15:46,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 19:15:46,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:15:46,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 19:15:46,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=199, Unknown=5, NotChecked=90, Total=342 [2023-02-18 19:15:46,972 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) 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 19:15:47,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:15:47,101 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2023-02-18 19:15:47,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 19:15:47,102 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) 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 19:15:47,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:15:47,102 INFO L225 Difference]: With dead ends: 40 [2023-02-18 19:15:47,102 INFO L226 Difference]: Without dead ends: 35 [2023-02-18 19:15:47,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=68, Invalid=281, Unknown=5, NotChecked=108, Total=462 [2023-02-18 19:15:47,103 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 19:15:47,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 114 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 19:15:47,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-18 19:15:47,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-02-18 19:15:47,113 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 19:15:47,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-02-18 19:15:47,113 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 43 [2023-02-18 19:15:47,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:15:47,114 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-02-18 19:15:47,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) 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 19:15:47,114 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-02-18 19:15:47,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-18 19:15:47,114 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:15:47,114 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:15:47,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-18 19:15:47,319 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 19:15:47,319 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:15:47,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:15:47,319 INFO L85 PathProgramCache]: Analyzing trace with hash -23130184, now seen corresponding path program 5 times [2023-02-18 19:15:47,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:15:47,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510523435] [2023-02-18 19:15:47,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:15:47,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:15:47,325 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:15:47,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1888320869] [2023-02-18 19:15:47,325 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-18 19:15:47,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:15:47,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:15:47,326 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 19:15:47,328 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 19:15:47,372 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-02-18 19:15:47,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 19:15:47,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-18 19:15:47,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:15:47,438 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 19:15:47,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:15:47,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:15:47,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510523435] [2023-02-18 19:15:47,497 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:15:47,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888320869] [2023-02-18 19:15:47,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888320869] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 19:15:47,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 19:15:47,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2023-02-18 19:15:47,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129163942] [2023-02-18 19:15:47,498 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 19:15:47,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-18 19:15:47,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:15:47,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 19:15:47,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2023-02-18 19:15:47,499 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 19:15:47,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:15:47,664 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2023-02-18 19:15:47,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 19:15:47,664 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 19:15:47,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:15:47,665 INFO L225 Difference]: With dead ends: 43 [2023-02-18 19:15:47,665 INFO L226 Difference]: Without dead ends: 38 [2023-02-18 19:15:47,665 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 19:15:47,665 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 19:15:47,665 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 19:15:47,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-18 19:15:47,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-02-18 19:15:47,670 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 19:15:47,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2023-02-18 19:15:47,670 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 50 [2023-02-18 19:15:47,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:15:47,671 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2023-02-18 19:15:47,671 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 19:15:47,671 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2023-02-18 19:15:47,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-18 19:15:47,671 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:15:47,671 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:15:47,678 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 19:15:47,876 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 19:15:47,876 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:15:47,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:15:47,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1898941279, now seen corresponding path program 6 times [2023-02-18 19:15:47,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:15:47,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099990177] [2023-02-18 19:15:47,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:15:47,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:15:47,883 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:15:47,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1256803690] [2023-02-18 19:15:47,883 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-18 19:15:47,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:15:47,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:15:47,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 19:15:47,886 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 19:15:47,990 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-02-18 19:15:47,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 19:15:47,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-18 19:15:47,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:15:49,880 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 31 proven. 64 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-18 19:15:49,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:15:51,917 WARN L837 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* 2 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 3 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 3 |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|) (= 0 (+ (* |c_ULTIMATE.start_main_~k~0#1| |c_ULTIMATE.start_main_~y~0#1|) (- (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))))) is different from false [2023-02-18 19:15:55,933 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| Int)) (or (= 0 (+ (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_23| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43|) (- (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43|)))) (= (mod (+ (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43|) (* 2 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43|) (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43|)) 4) 0))) (not (= |c___VERIFIER_assert_#in~cond| 0))) is different from true [2023-02-18 19:16:01,946 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| Int)) (or (= 0 (+ (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_23| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43|) (- (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43|)))) (= (mod (+ (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43|) (* 2 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43|) (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_43|)) 4) 0))) (= 0 c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| 0))) is different from true [2023-02-18 19:16:05,957 WARN L837 $PredicateComparison]: unable to prove that (or (= 0 (let ((.cse0 (+ 1 |c_ULTIMATE.start_main_~y~0#1|))) (+ (* |c_ULTIMATE.start_main_~k~0#1| .cse0) (- (* .cse0 .cse0))))) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |c_ULTIMATE.start_main_~k~0#1|) (not (= (mod (+ (* 2 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 3 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 3 |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 (< |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~k~0#1|))) is different from false [2023-02-18 19:16:49,922 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (let ((.cse1 (+ 1 (+ 1 (+ 1 (+ 1 (+ 1 |c_ULTIMATE.start_main_~c~0#1|))))))) (or (= 0 (let ((.cse0 (+ 1 (+ 1 (+ 1 (+ 1 (+ 1 (+ 1 |c_ULTIMATE.start_main_~y~0#1|)))))))) (+ (* |ULTIMATE.start_main_~k~0#1| .cse0) (- (* .cse0 .cse0))))) (< (+ .cse1 1) |ULTIMATE.start_main_~k~0#1|) (not (< .cse1 |ULTIMATE.start_main_~k~0#1|)) (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))))) (not (= (mod (+ (* 3 |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|) (* 3 |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))) is different from false [2023-02-18 19:16:49,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:16:49,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099990177] [2023-02-18 19:16:49,927 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:16:49,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256803690] [2023-02-18 19:16:49,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256803690] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 19:16:49,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 19:16:49,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2023-02-18 19:16:49,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102955115] [2023-02-18 19:16:49,927 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 19:16:49,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 19:16:49,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:16:49,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 19:16:49,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=343, Unknown=15, NotChecked=210, Total=650 [2023-02-18 19:16:49,929 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) 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 19:16:52,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:16:52,135 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2023-02-18 19:16:52,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 19:16:52,135 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) 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 19:16:52,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:16:52,136 INFO L225 Difference]: With dead ends: 46 [2023-02-18 19:16:52,136 INFO L226 Difference]: Without dead ends: 41 [2023-02-18 19:16:52,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 55.8s TimeCoverageRelationStatistics Valid=101, Invalid=455, Unknown=16, NotChecked=240, Total=812 [2023-02-18 19:16:52,137 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 19:16:52,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 160 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 19:16:52,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-02-18 19:16:52,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-02-18 19:16:52,142 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 19:16:52,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2023-02-18 19:16:52,142 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 57 [2023-02-18 19:16:52,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:16:52,143 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2023-02-18 19:16:52,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) 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 19:16:52,143 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2023-02-18 19:16:52,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-18 19:16:52,144 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:16:52,144 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:16:52,149 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 19:16:52,349 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 19:16:52,349 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:16:52,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:16:52,349 INFO L85 PathProgramCache]: Analyzing trace with hash 385378200, now seen corresponding path program 7 times [2023-02-18 19:16:52,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:16:52,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163069872] [2023-02-18 19:16:52,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:16:52,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:16:52,355 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:16:52,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1844555742] [2023-02-18 19:16:52,355 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-18 19:16:52,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:16:52,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:16:52,356 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 19:16:52,360 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 19:16:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:16:52,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-18 19:16:52,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:16:52,521 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 19:16:52,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:16:54,578 WARN L837 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* 2 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 3 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 3 |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|) (= 0 (+ (* |c_ULTIMATE.start_main_~k~0#1| |c_ULTIMATE.start_main_~y~0#1|) (- (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))))) is different from false [2023-02-18 19:16:58,597 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_58| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_31| Int)) (or (= 0 (+ (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_31| |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|)))) (= (mod (+ (* 3 |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|) (* 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|) (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_58| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_58|)) 4) 0))) (not (= |c___VERIFIER_assert_#in~cond| 0))) is different from true [2023-02-18 19:17:04,618 WARN L859 $PredicateComparison]: unable to prove that (or (= 0 c___VERIFIER_assert_~cond) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_58| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_31| Int)) (or (= 0 (+ (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_31| |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|)))) (= (mod (+ (* 3 |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|) (* 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|) (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_58| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_58|)) 4) 0))) (not (= |c___VERIFIER_assert_#in~cond| 0))) is different from true [2023-02-18 19:17:08,637 WARN L837 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* 2 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 3 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 3 |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 (= 0 (let ((.cse0 (+ 1 |c_ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~k~0#1| .cse0) (- (* .cse0 .cse0))))) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|) (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))))) is different from false [2023-02-18 19:17:08,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:17:08,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163069872] [2023-02-18 19:17:08,641 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:17:08,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844555742] [2023-02-18 19:17:08,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844555742] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 19:17:08,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 19:17:08,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2023-02-18 19:17:08,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971520153] [2023-02-18 19:17:08,642 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 19:17:08,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 19:17:08,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:17:08,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 19:17:08,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=269, Unknown=4, NotChecked=140, Total=462 [2023-02-18 19:17:08,643 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 19:17:08,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:17:08,835 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2023-02-18 19:17:08,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-18 19:17:08,836 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 19:17:08,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:17:08,836 INFO L225 Difference]: With dead ends: 49 [2023-02-18 19:17:08,836 INFO L226 Difference]: Without dead ends: 44 [2023-02-18 19:17:08,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=68, Invalid=364, Unknown=4, NotChecked=164, Total=600 [2023-02-18 19:17:08,837 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 19:17:08,837 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 19:17:08,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-18 19:17:08,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-02-18 19:17:08,843 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 19:17:08,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2023-02-18 19:17:08,843 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 64 [2023-02-18 19:17:08,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:17:08,844 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2023-02-18 19:17:08,844 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 19:17:08,844 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2023-02-18 19:17:08,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-18 19:17:08,845 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:17:08,845 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:17:08,853 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 19:17:09,045 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 19:17:09,045 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:17:09,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:17:09,046 INFO L85 PathProgramCache]: Analyzing trace with hash 2073985217, now seen corresponding path program 8 times [2023-02-18 19:17:09,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:17:09,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409231467] [2023-02-18 19:17:09,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:17:09,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:17:09,051 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:17:09,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1795536033] [2023-02-18 19:17:09,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 19:17:09,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:17:09,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:17:09,054 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 19:17:09,056 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 19:17:09,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 19:17:09,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 19:17:09,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-18 19:17:09,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:17:09,223 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 19:17:09,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:17:09,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:17:09,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409231467] [2023-02-18 19:17:09,327 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:17:09,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795536033] [2023-02-18 19:17:09,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795536033] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 19:17:09,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 19:17:09,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2023-02-18 19:17:09,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438855176] [2023-02-18 19:17:09,328 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 19:17:09,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 19:17:09,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:17:09,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 19:17:09,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2023-02-18 19:17:09,328 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 19:17:09,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:17:09,616 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2023-02-18 19:17:09,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-18 19:17:09,616 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 19:17:09,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:17:09,617 INFO L225 Difference]: With dead ends: 52 [2023-02-18 19:17:09,617 INFO L226 Difference]: Without dead ends: 47 [2023-02-18 19:17:09,618 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 19:17:09,618 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.2s IncrementalHoareTripleChecker+Time [2023-02-18 19:17:09,618 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.2s Time] [2023-02-18 19:17:09,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-18 19:17:09,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-02-18 19:17:09,624 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 19:17:09,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2023-02-18 19:17:09,625 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 71 [2023-02-18 19:17:09,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:17:09,625 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2023-02-18 19:17:09,625 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 19:17:09,625 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2023-02-18 19:17:09,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-02-18 19:17:09,626 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:17:09,626 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:17:09,631 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 19:17:09,831 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 19:17:09,831 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:17:09,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:17:09,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1353348984, now seen corresponding path program 9 times [2023-02-18 19:17:09,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:17:09,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94136026] [2023-02-18 19:17:09,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:17:09,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:17:09,837 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:17:09,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1422912259] [2023-02-18 19:17:09,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 19:17:09,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:17:09,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:17:09,838 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 19:17:09,840 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 19:17:09,990 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2023-02-18 19:17:09,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 19:17:09,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-18 19:17:09,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:17:12,015 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~y~0#1| (+ 1 2)) (= (+ |c_ULTIMATE.start_main_~c~0#1| (- 1)) (+ 1 1)) (= (mod (+ (* 2 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 3 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 3 |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)) is different from true [2023-02-18 19:17:12,101 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 28 proven. 145 refuted. 0 times theorem prover too weak. 153 trivial. 9 not checked. [2023-02-18 19:17:12,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:17:12,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:17:12,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94136026] [2023-02-18 19:17:12,204 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:17:12,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422912259] [2023-02-18 19:17:12,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422912259] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 19:17:12,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 19:17:12,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2023-02-18 19:17:12,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844695239] [2023-02-18 19:17:12,204 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 19:17:12,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-18 19:17:12,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:17:12,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-18 19:17:12,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=365, Unknown=1, NotChecked=38, Total=462 [2023-02-18 19:17:12,206 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 18 states, 17 states have (on average 1.9411764705882353) 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 19:17:12,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:17:12,481 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2023-02-18 19:17:12,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-18 19:17:12,482 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.9411764705882353) 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 19:17:12,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:17:12,482 INFO L225 Difference]: With dead ends: 55 [2023-02-18 19:17:12,482 INFO L226 Difference]: Without dead ends: 50 [2023-02-18 19:17:12,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=77, Invalid=478, Unknown=1, NotChecked=44, Total=600 [2023-02-18 19:17:12,483 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 19:17:12,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 229 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 514 Invalid, 0 Unknown, 55 Unchecked, 0.2s Time] [2023-02-18 19:17:12,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-18 19:17:12,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-02-18 19:17:12,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 12 states have call successors, (12), 3 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 19:17:12,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2023-02-18 19:17:12,490 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 78 [2023-02-18 19:17:12,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:17:12,490 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2023-02-18 19:17:12,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.9411764705882353) 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 19:17:12,491 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2023-02-18 19:17:12,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-02-18 19:17:12,491 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:17:12,491 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:17:12,499 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 19:17:12,696 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 19:17:12,697 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:17:12,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:17:12,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1817498849, now seen corresponding path program 10 times [2023-02-18 19:17:12,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:17:12,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741015] [2023-02-18 19:17:12,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:17:12,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:17:12,702 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:17:12,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1441668132] [2023-02-18 19:17:12,703 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 19:17:12,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:17:12,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:17:12,704 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 19:17:12,706 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 19:17:12,751 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 19:17:12,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 19:17:12,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 56 conjunts are in the unsatisfiable core [2023-02-18 19:17:12,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:17:14,834 WARN L859 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main_~c~0#1| (+ 1 9)) (= (mod (+ (* 2 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 3 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 3 |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) (< 9 |c_ULTIMATE.start_main_~k~0#1|) (= |c_ULTIMATE.start_main_~y~0#1| (+ 1 (+ 1 (+ 1 (+ 1 (+ 1 (+ 1 4)))))))) is different from true [2023-02-18 19:17:14,872 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 51 proven. 156 refuted. 0 times theorem prover too weak. 190 trivial. 10 not checked. [2023-02-18 19:17:14,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:17:38,499 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_40| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_94| Int)) (or (= (mod (+ (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_94| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_94| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_94| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_94|) (* 2 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_94| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_94| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_94|) (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_94| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_94|)) 4) 0) (= 0 (+ (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_40| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_94|) (- (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_94| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_94|))))))) is different from true [2023-02-18 19:17:44,512 WARN L859 $PredicateComparison]: unable to prove that (or (= 0 c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_40| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_94| Int)) (or (= (mod (+ (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_94| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_94| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_94| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_94|) (* 2 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_94| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_94| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_94|) (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_94| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_94|)) 4) 0) (= 0 (+ (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_40| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_94|) (- (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_94| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_94|))))))) is different from true [2023-02-18 19:17:48,523 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (= 0 (let ((.cse0 (+ 1 |c_ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~k~0#1| .cse0) (- (* .cse0 .cse0))))) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|) (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)))) (not (= (mod (+ (* 3 |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|) (* 3 |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))) is different from false [2023-02-18 19:17:48,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:17:48,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741015] [2023-02-18 19:17:48,527 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:17:48,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441668132] [2023-02-18 19:17:48,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441668132] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 19:17:48,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 19:17:48,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2023-02-18 19:17:48,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147623170] [2023-02-18 19:17:48,527 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 19:17:48,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-18 19:17:48,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:17:48,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-18 19:17:48,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=405, Unknown=11, NotChecked=172, Total=650 [2023-02-18 19:17:48,528 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 19 states, 18 states have (on average 1.9444444444444444) 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 19:17:50,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 19:17:54,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 19:17:56,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 19:18:00,372 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 19:18:00,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:18:00,373 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2023-02-18 19:18:00,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-18 19:18:00,374 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.9444444444444444) 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 19:18:00,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:18:00,374 INFO L225 Difference]: With dead ends: 58 [2023-02-18 19:18:00,374 INFO L226 Difference]: Without dead ends: 53 [2023-02-18 19:18:00,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 31.7s TimeCoverageRelationStatistics Valid=75, Invalid=482, Unknown=11, NotChecked=188, Total=756 [2023-02-18 19:18:00,376 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 5 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2023-02-18 19:18:00,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 276 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 612 Invalid, 3 Unknown, 60 Unchecked, 7.8s Time] [2023-02-18 19:18:00,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-18 19:18:00,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-02-18 19:18:00,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 13 states have call successors, (13), 3 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 19:18:00,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2023-02-18 19:18:00,383 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 85 [2023-02-18 19:18:00,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:18:00,383 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2023-02-18 19:18:00,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.9444444444444444) 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 19:18:00,383 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2023-02-18 19:18:00,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-02-18 19:18:00,384 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:18:00,384 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:18:00,390 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 19:18:00,584 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 19:18:00,585 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:18:00,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:18:00,585 INFO L85 PathProgramCache]: Analyzing trace with hash 638795608, now seen corresponding path program 11 times [2023-02-18 19:18:00,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:18:00,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75655654] [2023-02-18 19:18:00,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:18:00,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:18:00,591 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:18:00,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1714610734] [2023-02-18 19:18:00,591 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-18 19:18:00,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:18:00,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:18:00,592 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 19:18:00,593 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 19:18:00,753 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2023-02-18 19:18:00,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 19:18:00,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 60 conjunts are in the unsatisfiable core [2023-02-18 19:18:00,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:18:00,901 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 23 proven. 232 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-02-18 19:18:00,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:18:00,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:18:00,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75655654] [2023-02-18 19:18:00,977 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:18:00,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714610734] [2023-02-18 19:18:00,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714610734] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 19:18:00,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 19:18:00,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2023-02-18 19:18:00,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845102792] [2023-02-18 19:18:00,977 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 19:18:00,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-18 19:18:00,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:18:00,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-18 19:18:00,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2023-02-18 19:18:00,978 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 19 states, 18 states have (on average 2.0555555555555554) 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 19:18:01,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:18:01,376 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2023-02-18 19:18:01,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-18 19:18:01,377 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0555555555555554) 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 19:18:01,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:18:01,377 INFO L225 Difference]: With dead ends: 61 [2023-02-18 19:18:01,377 INFO L226 Difference]: Without dead ends: 56 [2023-02-18 19:18:01,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2023-02-18 19:18:01,378 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 19:18:01,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 310 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 19:18:01,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-02-18 19:18:01,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-02-18 19:18:01,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 14 states have call successors, (14), 3 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 19:18:01,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2023-02-18 19:18:01,386 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 92 [2023-02-18 19:18:01,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:18:01,386 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2023-02-18 19:18:01,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0555555555555554) 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 19:18:01,386 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2023-02-18 19:18:01,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-02-18 19:18:01,387 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:18:01,387 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:18:01,406 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 19:18:01,592 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 19:18:01,593 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:18:01,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:18:01,593 INFO L85 PathProgramCache]: Analyzing trace with hash 550859009, now seen corresponding path program 12 times [2023-02-18 19:18:01,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:18:01,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078152335] [2023-02-18 19:18:01,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:18:01,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:18:01,599 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:18:01,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [617261910] [2023-02-18 19:18:01,599 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-18 19:18:01,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:18:01,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:18:01,601 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 19:18:01,603 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 19:18:01,770 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2023-02-18 19:18:01,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 19:18:01,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 64 conjunts are in the unsatisfiable core [2023-02-18 19:18:01,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:18:01,916 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 26 proven. 234 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-02-18 19:18:01,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:18:02,312 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 26 proven. 234 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-02-18 19:18:02,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:18:02,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078152335] [2023-02-18 19:18:02,313 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:18:02,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617261910] [2023-02-18 19:18:02,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617261910] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 19:18:02,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 19:18:02,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2023-02-18 19:18:02,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273343285] [2023-02-18 19:18:02,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 19:18:02,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-18 19:18:02,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:18:02,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-18 19:18:02,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1025, Unknown=0, NotChecked=0, Total=1260 [2023-02-18 19:18:02,315 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 36 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 28 states have call successors, (28), 3 states have call predecessors, (28), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-02-18 19:18:04,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:18:04,054 INFO L93 Difference]: Finished difference Result 101 states and 137 transitions. [2023-02-18 19:18:04,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-02-18 19:18:04,055 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 28 states have call successors, (28), 3 states have call predecessors, (28), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Word has length 99 [2023-02-18 19:18:04,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:18:04,055 INFO L225 Difference]: With dead ends: 101 [2023-02-18 19:18:04,056 INFO L226 Difference]: Without dead ends: 95 [2023-02-18 19:18:04,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=952, Invalid=3338, Unknown=0, NotChecked=0, Total=4290 [2023-02-18 19:18:04,057 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 189 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-18 19:18:04,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 463 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-18 19:18:04,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-02-18 19:18:04,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-02-18 19:18:04,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 65 states have (on average 1.0153846153846153) internal successors, (66), 65 states have internal predecessors, (66), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-02-18 19:18:04,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 119 transitions. [2023-02-18 19:18:04,084 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 119 transitions. Word has length 99 [2023-02-18 19:18:04,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:18:04,084 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 119 transitions. [2023-02-18 19:18:04,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 28 states have call successors, (28), 3 states have call predecessors, (28), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-02-18 19:18:04,084 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 119 transitions. [2023-02-18 19:18:04,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-02-18 19:18:04,085 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:18:04,085 INFO L195 NwaCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:18:04,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-02-18 19:18:04,292 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 19:18:04,292 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:18:04,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:18:04,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1983588744, now seen corresponding path program 13 times [2023-02-18 19:18:04,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:18:04,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374149979] [2023-02-18 19:18:04,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:18:04,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:18:04,300 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:18:04,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [72224994] [2023-02-18 19:18:04,300 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-18 19:18:04,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:18:04,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:18:04,301 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 19:18:04,303 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 19:18:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:18:04,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-18 19:18:04,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:18:04,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2327 backedges. 1125 proven. 0 refuted. 0 times theorem prover too weak. 1202 trivial. 0 not checked. [2023-02-18 19:18:04,643 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 19:18:04,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:18:04,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374149979] [2023-02-18 19:18:04,644 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:18:04,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72224994] [2023-02-18 19:18:04,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72224994] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 19:18:04,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 19:18:04,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2023-02-18 19:18:04,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912436654] [2023-02-18 19:18:04,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 19:18:04,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-18 19:18:04,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:18:04,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-18 19:18:04,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2023-02-18 19:18:04,645 INFO L87 Difference]: Start difference. First operand 95 states and 119 transitions. Second operand has 29 states, 29 states have (on average 2.206896551724138) internal successors, (64), 29 states have internal predecessors, (64), 26 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-02-18 19:18:04,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:18:04,904 INFO L93 Difference]: Finished difference Result 99 states and 122 transitions. [2023-02-18 19:18:04,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-18 19:18:04,905 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.206896551724138) internal successors, (64), 29 states have internal predecessors, (64), 26 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Word has length 190 [2023-02-18 19:18:04,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:18:04,905 INFO L225 Difference]: With dead ends: 99 [2023-02-18 19:18:04,905 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 19:18:04,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=930, Invalid=1620, Unknown=0, NotChecked=0, Total=2550 [2023-02-18 19:18:04,907 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 4 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 19:18:04,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 279 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 19:18:04,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 19:18:04,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 19:18:04,907 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 19:18:04,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 19:18:04,907 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 190 [2023-02-18 19:18:04,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:18:04,907 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 19:18:04,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.206896551724138) internal successors, (64), 29 states have internal predecessors, (64), 26 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-02-18 19:18:04,908 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 19:18:04,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 19:18:04,910 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 19:18:04,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-18 19:18:05,117 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 19:18:05,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 19:18:05,130 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 19:18:05,131 INFO L895 garLoopResultBuilder]: At program point L27-2(lines 27 36) the Hoare annotation is: (let ((.cse73 (+ 1 |ULTIMATE.start_main_~y~0#1|))) (let ((.cse65 (+ 1 |ULTIMATE.start_main_~c~0#1|)) (.cse66 (+ 1 .cse73))) (let ((.cse67 (+ 1 .cse66)) (.cse68 (+ 1 .cse65))) (let ((.cse59 (+ 1 .cse68)) (.cse58 (+ 1 .cse67))) (let ((.cse72 (+ 1 .cse58)) (.cse71 (+ 1 .cse59))) (let ((.cse76 (+ 1 .cse71)) (.cse77 (+ 1 .cse72))) (let ((.cse63 (+ 1 .cse77)) (.cse62 (+ 1 .cse76))) (let ((.cse23 (+ 1 2)) (.cse49 (+ 1 4)) (.cse74 (+ 1 .cse62)) (.cse75 (+ 1 .cse63))) (let ((.cse56 (+ 1 .cse75)) (.cse57 (+ 1 .cse74)) (.cse50 (+ 1 .cse49)) (.cse53 (+ 1 .cse23))) (let ((.cse48 (+ 1 .cse53)) (.cse12 (+ 1 3)) (.cse18 (+ |ULTIMATE.start_main_~y~0#1| (- 1))) (.cse0 (+ 1 6)) (.cse10 (+ 1 5)) (.cse15 (+ 1 .cse50)) (.cse69 (+ 1 .cse57)) (.cse70 (+ 1 .cse56)) (.cse2 (+ |ULTIMATE.start_main_~c~0#1| (- 1))) (.cse16 (+ 1 1)) (.cse17 (+ 1 0)) (.cse64 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse4 (<= |ULTIMATE.start_main_~k~0#1| 20)) (.cse1 (>= |ULTIMATE.start_main_~k~0#1| 0)) (.cse61 (- .cse64)) (.cse55 (= |ULTIMATE.start_main_~y~0#1| .cse17)) (.cse54 (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse60 (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (.cse22 (+ 1 .cse16)) (.cse19 (+ .cse2 (- 1))) (.cse37 (+ 1 .cse70)) (.cse39 (+ 1 .cse69)) (.cse45 (+ 1 .cse15)) (.cse7 (+ 1 .cse10)) (.cse42 (+ 1 7)) (.cse46 (+ 1 .cse0)) (.cse13 (+ .cse18 (- 1))) (.cse14 (+ 1 .cse12)) (.cse47 (+ 1 .cse48))) (let ((.cse6 (+ 1 .cse47)) (.cse8 (+ 1 .cse14)) (.cse20 (+ 1 .cse17)) (.cse51 (+ .cse13 (- 1))) (.cse41 (+ 1 .cse46)) (.cse44 (+ 1 .cse42)) (.cse40 (+ 1 .cse7)) (.cse43 (+ 1 .cse45)) (.cse34 (+ 1 9)) (.cse35 (or (< (+ .cse39 1) |ULTIMATE.start_main_~k~0#1|) (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse37) (- (* .cse37 .cse37)))) (not (< .cse39 |ULTIMATE.start_main_~k~0#1|)))) (.cse11 (+ .cse19 (- 1))) (.cse52 (+ 1 .cse22)) (.cse21 (< 0 |ULTIMATE.start_main_~k~0#1|)) (.cse24 (or (< (+ .cse76 1) |ULTIMATE.start_main_~k~0#1|) (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse77) (- (* .cse77 .cse77)))) (not (< .cse76 |ULTIMATE.start_main_~k~0#1|)))) (.cse26 (or (< (+ .cse74 1) |ULTIMATE.start_main_~k~0#1|) (not (< .cse74 |ULTIMATE.start_main_~k~0#1|)) (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse75) (- (* .cse75 .cse75)))))) (.cse25 (or (< (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|) (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse73) (- (* .cse73 .cse73)))) (not .cse60))) (.cse27 (or (< (+ .cse71 1) |ULTIMATE.start_main_~k~0#1|) (not (< .cse71 |ULTIMATE.start_main_~k~0#1|)) (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse72) (- (* .cse72 .cse72)))))) (.cse33 (or (< (+ .cse69 1) |ULTIMATE.start_main_~k~0#1|) (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse70) (- (* .cse70 .cse70)))) (not (< .cse69 |ULTIMATE.start_main_~k~0#1|)))) (.cse28 (or (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse67) (- (* .cse67 .cse67)))) (not (< .cse68 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse68 1) |ULTIMATE.start_main_~k~0#1|))) (.cse29 (or (not (< .cse65 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse65 1) |ULTIMATE.start_main_~k~0#1|) (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse66) (- (* .cse66 .cse66)))))) (.cse3 (or (= 0 (+ (+ (+ (* 4 |ULTIMATE.start_main_~x~0#1|) (- (* (* .cse64 |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|))) .cse61)) (and .cse55 (= .cse54 0)))) (.cse30 (or (not (< .cse62 |ULTIMATE.start_main_~k~0#1|)) (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse63) (- (* .cse63 .cse63)))) (< (+ .cse62 1) |ULTIMATE.start_main_~k~0#1|))) (.cse5 (or .cse60 (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse61)))) (.cse9 (or (and .cse1 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse4) (and (or (not .cse4) (not .cse1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse31 (or (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse58) (- (* .cse58 .cse58)))) (not (< .cse59 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse59 1) |ULTIMATE.start_main_~k~0#1|))) (.cse32 (or (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse56) (- (* .cse56 .cse56)))) (not (< .cse57 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse57 1) |ULTIMATE.start_main_~k~0#1|)))) (or (and (<= |ULTIMATE.start_main_~c~0#1| .cse0) (= |ULTIMATE.start_main_~y~0#1| .cse0) .cse1 (<= 6 .cse2) .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~y~0#1| .cse6) (= |ULTIMATE.start_main_~y~0#1| .cse7) (= .cse2 .cse8) .cse9 (= |ULTIMATE.start_main_~c~0#1| .cse0) (< 6 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~c~0#1| .cse7) (= .cse2 .cse10) (= .cse11 .cse12) (= .cse13 .cse14) (= |ULTIMATE.start_main_~y~0#1| .cse15)) (and (= |ULTIMATE.start_main_~y~0#1| .cse16) (<= |ULTIMATE.start_main_~c~0#1| .cse16) (= .cse2 .cse17) (= .cse18 .cse17) .cse1 (= .cse19 0) (< 1 |ULTIMATE.start_main_~k~0#1|) .cse3 .cse4 (= .cse13 0) (= |ULTIMATE.start_main_~y~0#1| .cse20) .cse5 (<= 1 .cse2) .cse9 (= |ULTIMATE.start_main_~c~0#1| .cse16) .cse21) (and (= .cse11 0) (= .cse18 .cse20) (= .cse19 .cse17) (<= 2 .cse2) (<= |ULTIMATE.start_main_~c~0#1| .cse22) (= |ULTIMATE.start_main_~y~0#1| .cse22) .cse1 (= .cse13 .cse17) (= .cse2 .cse16) .cse3 .cse4 .cse5 (= .cse18 .cse16) .cse9 (= |ULTIMATE.start_main_~c~0#1| .cse23) (= |ULTIMATE.start_main_~c~0#1| .cse22) (< .cse16 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| .cse23) .cse21) (and .cse24 .cse25 .cse26 .cse27 .cse1 .cse28 .cse29 .cse3 .cse4 .cse30 .cse5 .cse9 (<= 14 .cse2) .cse31 .cse32) (and .cse24 .cse26 .cse25 .cse27 .cse1 .cse33 (= .cse13 .cse34) .cse28 .cse29 (< 11 |ULTIMATE.start_main_~k~0#1|) .cse3 .cse4 .cse30 .cse35 (<= 11 .cse2) .cse9 .cse31 (<= |ULTIMATE.start_main_~c~0#1| (+ 1 11)) (let ((.cse38 (+ 1 .cse39))) (or (= 0 (let ((.cse36 (+ 1 .cse37))) (+ (* |ULTIMATE.start_main_~k~0#1| .cse36) (- (* .cse36 .cse36))))) (not (< .cse38 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse38 1) |ULTIMATE.start_main_~k~0#1|))) .cse32) (and (<= 8 .cse2) (<= |ULTIMATE.start_main_~c~0#1| (+ 1 .cse40)) (= .cse11 .cse10) .cse1 (= |ULTIMATE.start_main_~c~0#1| .cse41) (< .cse40 |ULTIMATE.start_main_~k~0#1|) (= .cse18 .cse42) .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~y~0#1| .cse43) (= |ULTIMATE.start_main_~c~0#1| .cse44) .cse9 (= .cse18 .cse40) (= .cse13 .cse6)) (and (= |ULTIMATE.start_main_~y~0#1| .cse45) (= .cse18 .cse0) .cse1 (= |ULTIMATE.start_main_~c~0#1| .cse42) (= |ULTIMATE.start_main_~c~0#1| .cse40) (<= |ULTIMATE.start_main_~c~0#1| .cse42) (= .cse19 .cse10) .cse3 .cse4 .cse5 (= .cse18 .cse6) .cse9 (= |ULTIMATE.start_main_~c~0#1| .cse46) (= |ULTIMATE.start_main_~y~0#1| .cse42) (= |ULTIMATE.start_main_~y~0#1| .cse40) (< 7 |ULTIMATE.start_main_~k~0#1|) (<= 7 .cse2)) (and .cse9 .cse1 (= |ULTIMATE.start_main_~x~0#1| 0) (>= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0) .cse4 (= |ULTIMATE.start_main_~c~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 0)) (and (= |ULTIMATE.start_main_~y~0#1| .cse47) (= .cse2 .cse48) .cse1 (= .cse18 .cse49) (= |ULTIMATE.start_main_~c~0#1| .cse8) (= |ULTIMATE.start_main_~y~0#1| .cse10) .cse3 .cse4 (<= 5 .cse2) .cse5 (= |ULTIMATE.start_main_~c~0#1| .cse10) (= .cse19 .cse12) (= .cse18 .cse14) .cse9 (< 5 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| .cse50) (= .cse13 .cse12) (<= |ULTIMATE.start_main_~c~0#1| .cse10) .cse21) (and .cse5 (<= 10 .cse2) (<= |ULTIMATE.start_main_~c~0#1| (+ 1 10)) (= .cse18 .cse34) .cse9 (< 10 |ULTIMATE.start_main_~k~0#1|) .cse1 (= .cse51 .cse40) (= .cse19 .cse44) .cse3 .cse4) (and (= |ULTIMATE.start_main_~c~0#1| .cse52) (< .cse23 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| .cse53) (= |ULTIMATE.start_main_~y~0#1| .cse12) (= .cse19 .cse16) .cse1 (= .cse13 .cse20) (= .cse51 .cse17) .cse3 .cse4 (= .cse2 .cse23) .cse5 (= |ULTIMATE.start_main_~c~0#1| .cse12) (= .cse18 .cse22) .cse9 (<= 3 .cse2) (<= |ULTIMATE.start_main_~c~0#1| .cse53) (= |ULTIMATE.start_main_~c~0#1| .cse53) .cse21) (and (<= |ULTIMATE.start_main_~c~0#1| .cse34) .cse1 (= .cse2 .cse41) (= .cse2 .cse44) (= .cse13 .cse40) .cse3 .cse4 (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse43)) .cse5 .cse9 (<= 9 .cse2) (= |ULTIMATE.start_main_~y~0#1| .cse34) (< 9 |ULTIMATE.start_main_~k~0#1|)) (and .cse5 .cse25 .cse9 (<= 19 .cse2) .cse1 .cse28 .cse29 .cse31 .cse3 .cse4) (and .cse1 (<= .cse54 0) (= .cse2 0) .cse3 .cse4 .cse5 .cse55 .cse9 (= |ULTIMATE.start_main_~c~0#1| .cse17) (<= 0 .cse2) (<= |ULTIMATE.start_main_~c~0#1| .cse17) (= .cse18 0) .cse21) (and .cse24 .cse25 .cse26 .cse27 .cse1 .cse28 .cse29 .cse3 .cse4 .cse30 .cse5 .cse9 .cse31 (<= 15 .cse2)) (and .cse5 .cse25 .cse9 .cse27 .cse1 .cse28 (<= 18 .cse2) .cse29 .cse31 .cse3 .cse4) (and .cse5 .cse24 .cse25 .cse9 .cse27 .cse1 .cse28 .cse29 .cse31 .cse3 .cse4 (<= 17 .cse2)) (and .cse24 .cse25 .cse27 .cse1 .cse28 .cse29 .cse3 .cse4 .cse30 .cse5 (<= 16 .cse2) .cse9 .cse31) (and .cse24 .cse26 .cse25 .cse27 .cse1 .cse33 .cse28 .cse29 .cse3 .cse4 .cse30 (<= 12 .cse2) .cse5 .cse35 .cse9 .cse31 .cse32) (and (= |ULTIMATE.start_main_~c~0#1| .cse48) (= .cse18 .cse12) .cse1 (<= 4 .cse2) (= |ULTIMATE.start_main_~y~0#1| .cse14) (= .cse11 .cse16) .cse3 (= .cse13 .cse22) .cse4 (= |ULTIMATE.start_main_~y~0#1| .cse49) .cse5 (= .cse2 .cse12) .cse9 (= |ULTIMATE.start_main_~y~0#1| .cse48) (< .cse52 |ULTIMATE.start_main_~k~0#1|) (= .cse19 .cse23) (<= |ULTIMATE.start_main_~c~0#1| (+ 1 .cse52)) .cse21 (= |ULTIMATE.start_main_~c~0#1| .cse14)) (and (<= 13 .cse2) .cse24 .cse26 .cse25 .cse27 .cse1 .cse33 .cse28 .cse29 .cse3 .cse4 .cse30 .cse5 .cse9 .cse31 .cse32)))))))))))))) [2023-02-18 19:18:05,132 INFO L895 garLoopResultBuilder]: At program point L27-3(lines 27 36) the Hoare annotation is: (let ((.cse53 (+ 1 |ULTIMATE.start_main_~y~0#1|))) (let ((.cse45 (+ 1 |ULTIMATE.start_main_~c~0#1|)) (.cse46 (+ 1 .cse53))) (let ((.cse47 (+ 1 .cse46)) (.cse48 (+ 1 .cse45))) (let ((.cse42 (+ 1 .cse48)) (.cse41 (+ 1 .cse47))) (let ((.cse52 (+ 1 .cse41)) (.cse51 (+ 1 .cse42))) (let ((.cse56 (+ 1 .cse51)) (.cse57 (+ 1 .cse52))) (let ((.cse44 (+ 1 .cse57)) (.cse43 (+ 1 .cse56))) (let ((.cse54 (+ 1 .cse43)) (.cse55 (+ 1 .cse44))) (let ((.cse35 (+ 1 .cse55)) (.cse36 (+ 1 .cse54))) (let ((.cse30 (+ 1 5)) (.cse49 (+ 1 .cse36)) (.cse50 (+ 1 .cse35)) (.cse31 (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse34 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse28 (- .cse34)) (.cse32 (+ 1 0)) (.cse33 (+ |ULTIMATE.start_main_~x~0#1| .cse31)) (.cse8 (+ 1 1)) (.cse19 (<= |ULTIMATE.start_main_~k~0#1| 20)) (.cse14 (>= |ULTIMATE.start_main_~k~0#1| 0)) (.cse38 (+ 1 .cse50)) (.cse40 (+ 1 .cse49)) (.cse0 (+ 1 .cse30)) (.cse3 (+ |ULTIMATE.start_main_~y~0#1| (- 1))) (.cse7 (+ 1 2))) (let ((.cse1 (+ 1 6)) (.cse6 (+ 1 .cse7)) (.cse5 (+ .cse3 (- 1))) (.cse4 (+ 1 .cse0)) (.cse11 (or (< (+ .cse56 1) |ULTIMATE.start_main_~k~0#1|) (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse57) (- (* .cse57 .cse57)))) (not (< .cse56 |ULTIMATE.start_main_~k~0#1|)))) (.cse12 (or (< (+ .cse54 1) |ULTIMATE.start_main_~k~0#1|) (not (< .cse54 |ULTIMATE.start_main_~k~0#1|)) (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse55) (- (* .cse55 .cse55)))))) (.cse13 (or (< (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|) (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse53) (- (* .cse53 .cse53)))) (not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)))) (.cse15 (or (< (+ .cse51 1) |ULTIMATE.start_main_~k~0#1|) (not (< .cse51 |ULTIMATE.start_main_~k~0#1|)) (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse52) (- (* .cse52 .cse52)))))) (.cse16 (or (< (+ .cse49 1) |ULTIMATE.start_main_~k~0#1|) (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse50) (- (* .cse50 .cse50)))) (not (< .cse49 |ULTIMATE.start_main_~k~0#1|)))) (.cse17 (or (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse47) (- (* .cse47 .cse47)))) (not (< .cse48 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse48 1) |ULTIMATE.start_main_~k~0#1|))) (.cse18 (or (not (< .cse45 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse45 1) |ULTIMATE.start_main_~k~0#1|) (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse46) (- (* .cse46 .cse46)))))) (.cse20 (or (not (< .cse43 |ULTIMATE.start_main_~k~0#1|)) (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse44) (- (* .cse44 .cse44)))) (< (+ .cse43 1) |ULTIMATE.start_main_~k~0#1|))) (.cse21 (or (< (+ .cse40 1) |ULTIMATE.start_main_~k~0#1|) (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse38) (- (* .cse38 .cse38)))) (not (< .cse40 |ULTIMATE.start_main_~k~0#1|)))) (.cse22 (or (and .cse14 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse19) (and (or (not .cse19) (not .cse14)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse23 (or (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse41) (- (* .cse41 .cse41)))) (not (< .cse42 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse42 1) |ULTIMATE.start_main_~k~0#1|))) (.cse24 (let ((.cse39 (+ 1 .cse40))) (or (= 0 (let ((.cse37 (+ 1 .cse38))) (+ (* |ULTIMATE.start_main_~k~0#1| .cse37) (- (* .cse37 .cse37))))) (not (< .cse39 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse39 1) |ULTIMATE.start_main_~k~0#1|)))) (.cse25 (or (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse35) (- (* .cse35 .cse35)))) (not (< .cse36 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse36 1) |ULTIMATE.start_main_~k~0#1|))) (.cse10 (+ 1 4)) (.cse9 (= (mod (+ (* 2 |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 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)) (.cse29 (< 0 |ULTIMATE.start_main_~k~0#1|)) (.cse27 (+ 1 .cse8)) (.cse2 (or (= 0 (+ (+ (+ (* 4 |ULTIMATE.start_main_~x~0#1|) (- (* (* .cse34 |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|))) .cse28)) (and (= |ULTIMATE.start_main_~y~0#1| .cse32) (= .cse33 0))))) (or (and (= |ULTIMATE.start_main_~y~0#1| .cse0) (<= |ULTIMATE.start_main_~c~0#1| .cse1) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 7) .cse2) (and (= .cse3 .cse1) (<= |ULTIMATE.start_main_~c~0#1| (+ 1 7)) (<= |ULTIMATE.start_main_~k~0#1| 8) (< 7 |ULTIMATE.start_main_~k~0#1|) .cse2) (and (<= |ULTIMATE.start_main_~c~0#1| (+ 1 .cse4)) (< .cse4 |ULTIMATE.start_main_~k~0#1|) (= .cse5 (+ 1 (+ 1 (+ 1 .cse6)))) .cse2 (<= |ULTIMATE.start_main_~k~0#1| 9)) (and (< .cse7 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| (+ 1 3)) (<= |ULTIMATE.start_main_~k~0#1| 4) (<= |ULTIMATE.start_main_~c~0#1| .cse6) .cse2) (and (= |ULTIMATE.start_main_~y~0#1| .cse8) (<= |ULTIMATE.start_main_~c~0#1| .cse8) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|) .cse2) (and .cse9 (<= |ULTIMATE.start_main_~k~0#1| 10) .cse2 (= |ULTIMATE.start_main_~y~0#1| (+ 1 (+ 1 (+ 1 (+ 1 (+ 1 .cse10)))))) (< 9 |ULTIMATE.start_main_~k~0#1|)) (and (= |ULTIMATE.start_main_~x~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0)) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= .cse5 (+ 1 9)) .cse17 .cse18 (< 11 |ULTIMATE.start_main_~k~0#1|) .cse2 .cse19 .cse20 .cse21 .cse22 .cse23 (<= |ULTIMATE.start_main_~k~0#1| 12) (<= |ULTIMATE.start_main_~c~0#1| (+ 1 11)) .cse24 .cse25) (let ((.cse26 (+ 1 .cse27))) (and (< .cse26 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5) (<= |ULTIMATE.start_main_~c~0#1| (+ 1 .cse26)) .cse2 (= |ULTIMATE.start_main_~y~0#1| .cse10))) (and (<= |ULTIMATE.start_main_~c~0#1| (+ 1 10)) (< 10 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 11) (= (+ .cse5 (- 1)) .cse4) .cse2) (and .cse11 .cse12 .cse13 .cse15 .cse14 .cse16 .cse17 .cse18 .cse2 .cse19 .cse20 .cse21 .cse22 .cse23 (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse28)) .cse24 .cse25) (and (<= |ULTIMATE.start_main_~k~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|) (= .cse3 .cse10) .cse2 .cse29 (<= |ULTIMATE.start_main_~c~0#1| .cse30)) (and .cse9 (<= (+ (div (+ (* (- 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) .cse28 (- (* |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)) .cse31) 0) (<= |ULTIMATE.start_main_~k~0#1| 1) (<= |ULTIMATE.start_main_~c~0#1| .cse32) (<= .cse33 0) (= .cse3 0) .cse2 .cse29) (and (<= |ULTIMATE.start_main_~c~0#1| .cse27) (<= |ULTIMATE.start_main_~k~0#1| 3) (< .cse8 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| .cse7) .cse2)))))))))))))) [2023-02-18 19:18:05,132 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 19:18:05,132 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 17 40) the Hoare annotation is: true [2023-02-18 19:18:05,132 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2023-02-18 19:18:05,132 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2023-02-18 19:18:05,132 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 19:18:05,132 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 19:18:05,133 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (let ((.cse73 (+ 1 |ULTIMATE.start_main_~y~0#1|))) (let ((.cse65 (+ 1 |ULTIMATE.start_main_~c~0#1|)) (.cse66 (+ 1 .cse73))) (let ((.cse67 (+ 1 .cse66)) (.cse68 (+ 1 .cse65))) (let ((.cse59 (+ 1 .cse68)) (.cse58 (+ 1 .cse67))) (let ((.cse72 (+ 1 .cse58)) (.cse71 (+ 1 .cse59))) (let ((.cse76 (+ 1 .cse71)) (.cse77 (+ 1 .cse72))) (let ((.cse63 (+ 1 .cse77)) (.cse62 (+ 1 .cse76))) (let ((.cse32 (+ 1 2)) (.cse50 (+ 1 4)) (.cse74 (+ 1 .cse62)) (.cse75 (+ 1 .cse63))) (let ((.cse56 (+ 1 .cse75)) (.cse57 (+ 1 .cse74)) (.cse51 (+ 1 .cse50)) (.cse53 (+ 1 .cse32))) (let ((.cse49 (+ 1 .cse53)) (.cse12 (+ 1 3)) (.cse18 (+ |ULTIMATE.start_main_~y~0#1| (- 1))) (.cse0 (+ 1 6)) (.cse10 (+ 1 5)) (.cse15 (+ 1 .cse51)) (.cse69 (+ 1 .cse57)) (.cse70 (+ 1 .cse56)) (.cse2 (+ |ULTIMATE.start_main_~c~0#1| (- 1))) (.cse16 (+ 1 1)) (.cse17 (+ 1 0)) (.cse64 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse4 (<= |ULTIMATE.start_main_~k~0#1| 20)) (.cse1 (>= |ULTIMATE.start_main_~k~0#1| 0)) (.cse61 (- .cse64)) (.cse55 (= |ULTIMATE.start_main_~y~0#1| .cse17)) (.cse54 (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse60 (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (.cse31 (+ 1 .cse16)) (.cse19 (+ .cse2 (- 1))) (.cse37 (+ 1 .cse70)) (.cse39 (+ 1 .cse69)) (.cse45 (+ 1 .cse15)) (.cse7 (+ 1 .cse10)) (.cse42 (+ 1 7)) (.cse46 (+ 1 .cse0)) (.cse13 (+ .cse18 (- 1))) (.cse14 (+ 1 .cse12)) (.cse48 (+ 1 .cse49))) (let ((.cse6 (+ 1 .cse48)) (.cse8 (+ 1 .cse14)) (.cse20 (+ 1 .cse17)) (.cse47 (+ .cse13 (- 1))) (.cse41 (+ 1 .cse46)) (.cse44 (+ 1 .cse42)) (.cse40 (+ 1 .cse7)) (.cse43 (+ 1 .cse45)) (.cse34 (+ 1 9)) (.cse35 (or (< (+ .cse39 1) |ULTIMATE.start_main_~k~0#1|) (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse37) (- (* .cse37 .cse37)))) (not (< .cse39 |ULTIMATE.start_main_~k~0#1|)))) (.cse11 (+ .cse19 (- 1))) (.cse52 (+ 1 .cse31)) (.cse21 (< 0 |ULTIMATE.start_main_~k~0#1|)) (.cse22 (or (< (+ .cse76 1) |ULTIMATE.start_main_~k~0#1|) (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse77) (- (* .cse77 .cse77)))) (not (< .cse76 |ULTIMATE.start_main_~k~0#1|)))) (.cse24 (or (< (+ .cse74 1) |ULTIMATE.start_main_~k~0#1|) (not (< .cse74 |ULTIMATE.start_main_~k~0#1|)) (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse75) (- (* .cse75 .cse75)))))) (.cse23 (or (< (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|) (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse73) (- (* .cse73 .cse73)))) (not .cse60))) (.cse25 (or (< (+ .cse71 1) |ULTIMATE.start_main_~k~0#1|) (not (< .cse71 |ULTIMATE.start_main_~k~0#1|)) (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse72) (- (* .cse72 .cse72)))))) (.cse33 (or (< (+ .cse69 1) |ULTIMATE.start_main_~k~0#1|) (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse70) (- (* .cse70 .cse70)))) (not (< .cse69 |ULTIMATE.start_main_~k~0#1|)))) (.cse26 (or (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse67) (- (* .cse67 .cse67)))) (not (< .cse68 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse68 1) |ULTIMATE.start_main_~k~0#1|))) (.cse27 (or (not (< .cse65 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse65 1) |ULTIMATE.start_main_~k~0#1|) (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse66) (- (* .cse66 .cse66)))))) (.cse3 (or (= 0 (+ (+ (+ (* 4 |ULTIMATE.start_main_~x~0#1|) (- (* (* .cse64 |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|))) .cse61)) (and .cse55 (= .cse54 0)))) (.cse28 (or (not (< .cse62 |ULTIMATE.start_main_~k~0#1|)) (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse63) (- (* .cse63 .cse63)))) (< (+ .cse62 1) |ULTIMATE.start_main_~k~0#1|))) (.cse5 (or .cse60 (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse61)))) (.cse9 (or (and .cse1 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse4) (and (or (not .cse4) (not .cse1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse29 (or (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse58) (- (* .cse58 .cse58)))) (not (< .cse59 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse59 1) |ULTIMATE.start_main_~k~0#1|))) (.cse30 (or (= 0 (+ (* |ULTIMATE.start_main_~k~0#1| .cse56) (- (* .cse56 .cse56)))) (not (< .cse57 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse57 1) |ULTIMATE.start_main_~k~0#1|)))) (or (and (<= |ULTIMATE.start_main_~c~0#1| .cse0) (= |ULTIMATE.start_main_~y~0#1| .cse0) .cse1 (<= 6 .cse2) .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~y~0#1| .cse6) (= |ULTIMATE.start_main_~y~0#1| .cse7) (= .cse2 .cse8) .cse9 (= |ULTIMATE.start_main_~c~0#1| .cse0) (< 6 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~c~0#1| .cse7) (= .cse2 .cse10) (= .cse11 .cse12) (= .cse13 .cse14) (= |ULTIMATE.start_main_~y~0#1| .cse15)) (and (= |ULTIMATE.start_main_~y~0#1| .cse16) (<= |ULTIMATE.start_main_~c~0#1| .cse16) (= .cse2 .cse17) (= .cse18 .cse17) .cse1 (= .cse19 0) (< 1 |ULTIMATE.start_main_~k~0#1|) .cse3 .cse4 (= .cse13 0) (= |ULTIMATE.start_main_~y~0#1| .cse20) .cse5 (<= 1 .cse2) .cse9 (= |ULTIMATE.start_main_~c~0#1| .cse16) .cse21) (and .cse22 .cse23 .cse24 .cse25 .cse1 .cse26 .cse27 .cse3 .cse4 .cse28 .cse5 .cse9 (<= 14 .cse2) .cse29 .cse30) (and (= .cse11 0) (= .cse18 .cse20) (= .cse19 .cse17) (<= 2 .cse2) (<= |ULTIMATE.start_main_~c~0#1| .cse31) (= |ULTIMATE.start_main_~y~0#1| .cse31) .cse1 (= .cse13 .cse17) (= .cse2 .cse16) .cse3 .cse4 .cse5 (= .cse18 .cse16) .cse9 (= |ULTIMATE.start_main_~c~0#1| .cse32) (= |ULTIMATE.start_main_~c~0#1| .cse31) (< .cse16 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| .cse32) .cse21) (and .cse22 .cse24 .cse23 .cse25 .cse1 .cse33 (= .cse13 .cse34) .cse26 .cse27 (< 11 |ULTIMATE.start_main_~k~0#1|) .cse3 .cse4 .cse28 .cse35 (<= 11 .cse2) .cse9 .cse29 (<= |ULTIMATE.start_main_~c~0#1| (+ 1 11)) (let ((.cse38 (+ 1 .cse39))) (or (= 0 (let ((.cse36 (+ 1 .cse37))) (+ (* |ULTIMATE.start_main_~k~0#1| .cse36) (- (* .cse36 .cse36))))) (not (< .cse38 |ULTIMATE.start_main_~k~0#1|)) (< (+ .cse38 1) |ULTIMATE.start_main_~k~0#1|))) .cse30) (and (<= 8 .cse2) (<= |ULTIMATE.start_main_~c~0#1| (+ 1 .cse40)) (= .cse11 .cse10) .cse1 (= |ULTIMATE.start_main_~c~0#1| .cse41) (< .cse40 |ULTIMATE.start_main_~k~0#1|) (= .cse18 .cse42) .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~y~0#1| .cse43) (= |ULTIMATE.start_main_~c~0#1| .cse44) .cse9 (= .cse18 .cse40) (= .cse13 .cse6)) (and (= |ULTIMATE.start_main_~y~0#1| .cse45) (= .cse18 .cse0) .cse1 (= |ULTIMATE.start_main_~c~0#1| .cse42) (= |ULTIMATE.start_main_~c~0#1| .cse40) (<= |ULTIMATE.start_main_~c~0#1| .cse42) (= .cse19 .cse10) .cse3 .cse4 .cse5 (= .cse18 .cse6) .cse9 (= |ULTIMATE.start_main_~c~0#1| .cse46) (= |ULTIMATE.start_main_~y~0#1| .cse42) (= |ULTIMATE.start_main_~y~0#1| .cse40) (< 7 |ULTIMATE.start_main_~k~0#1|) (<= 7 .cse2)) (and .cse9 .cse1 (= |ULTIMATE.start_main_~x~0#1| 0) (>= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0) .cse4 (= |ULTIMATE.start_main_~c~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 0)) (and .cse5 (<= 10 .cse2) (<= |ULTIMATE.start_main_~c~0#1| (+ 1 10)) (= .cse18 .cse34) .cse9 (< 10 |ULTIMATE.start_main_~k~0#1|) .cse1 (= .cse47 .cse40) (= .cse19 .cse44) .cse3 .cse4) (and (= |ULTIMATE.start_main_~y~0#1| .cse48) (= .cse2 .cse49) .cse1 (= .cse18 .cse50) (= |ULTIMATE.start_main_~c~0#1| .cse8) (= |ULTIMATE.start_main_~y~0#1| .cse10) .cse3 .cse4 (<= 5 .cse2) .cse5 (= |ULTIMATE.start_main_~c~0#1| .cse10) (= .cse19 .cse12) (= .cse18 .cse14) .cse9 (< 5 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| .cse51) (= .cse13 .cse12) (<= |ULTIMATE.start_main_~c~0#1| .cse10) .cse21) (and (= |ULTIMATE.start_main_~c~0#1| .cse52) (< .cse32 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| .cse53) (= |ULTIMATE.start_main_~y~0#1| .cse12) (= .cse19 .cse16) .cse1 (= .cse13 .cse20) (= .cse47 .cse17) .cse3 .cse4 (= .cse2 .cse32) .cse5 (= |ULTIMATE.start_main_~c~0#1| .cse12) (= .cse18 .cse31) .cse9 (<= 3 .cse2) (<= |ULTIMATE.start_main_~c~0#1| .cse53) (= |ULTIMATE.start_main_~c~0#1| .cse53) .cse21) (and (<= |ULTIMATE.start_main_~c~0#1| .cse34) .cse1 (= .cse2 .cse41) (= .cse2 .cse44) (= .cse13 .cse40) .cse3 .cse4 (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse43)) .cse5 .cse9 (<= 9 .cse2) (= |ULTIMATE.start_main_~y~0#1| .cse34) (< 9 |ULTIMATE.start_main_~k~0#1|)) (and .cse5 .cse23 .cse9 (<= 19 .cse2) .cse1 .cse26 .cse27 .cse29 .cse3 .cse4) (and .cse22 .cse23 .cse24 .cse25 .cse1 .cse26 .cse27 .cse3 .cse4 .cse28 .cse5 .cse9 .cse29 (<= 15 .cse2)) (and .cse1 (<= .cse54 0) (= .cse2 0) .cse3 .cse4 .cse5 .cse55 .cse9 (= |ULTIMATE.start_main_~c~0#1| .cse17) (<= 0 .cse2) (<= |ULTIMATE.start_main_~c~0#1| .cse17) (= .cse18 0) .cse21) (and .cse5 .cse23 .cse9 .cse25 .cse1 .cse26 (<= 18 .cse2) .cse27 .cse29 .cse3 .cse4) (and .cse5 .cse22 .cse23 .cse9 .cse25 .cse1 .cse26 .cse27 .cse29 .cse3 .cse4 (<= 17 .cse2)) (and .cse22 .cse24 .cse23 .cse25 .cse1 .cse33 .cse26 .cse27 .cse3 .cse4 .cse28 (<= 12 .cse2) .cse5 .cse35 .cse9 .cse29 .cse30) (and .cse22 .cse23 .cse25 .cse1 .cse26 .cse27 .cse3 .cse4 .cse28 .cse5 (<= 16 .cse2) .cse9 .cse29) (and (= |ULTIMATE.start_main_~c~0#1| .cse49) (= .cse18 .cse12) .cse1 (<= 4 .cse2) (= |ULTIMATE.start_main_~y~0#1| .cse14) (= .cse11 .cse16) .cse3 (= .cse13 .cse31) .cse4 (= |ULTIMATE.start_main_~y~0#1| .cse50) .cse5 (= .cse2 .cse12) .cse9 (= |ULTIMATE.start_main_~y~0#1| .cse49) (< .cse52 |ULTIMATE.start_main_~k~0#1|) (= .cse19 .cse32) (<= |ULTIMATE.start_main_~c~0#1| (+ 1 .cse52)) .cse21 (= |ULTIMATE.start_main_~c~0#1| .cse14)) (and (<= 13 .cse2) .cse22 .cse24 .cse23 .cse25 .cse1 .cse33 .cse26 .cse27 .cse3 .cse4 .cse28 .cse5 .cse9 .cse29 .cse30)))))))))))))) [2023-02-18 19:18:05,133 INFO L899 garLoopResultBuilder]: For program point L28-1(lines 27 36) no Hoare annotation was computed. [2023-02-18 19:18:05,133 INFO L899 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2023-02-18 19:18:05,134 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (or (= 0 (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (+ (+ (* 4 |ULTIMATE.start_main_~x~0#1|) (- (* (* .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|))) (- .cse0)))) (and (= |ULTIMATE.start_main_~y~0#1| (+ 1 0)) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 0)) (and (= |ULTIMATE.start_main_~x~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))) [2023-02-18 19:18:05,134 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2023-02-18 19:18:05,134 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2023-02-18 19:18:05,134 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2023-02-18 19:18:05,134 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 9 15) the Hoare annotation is: true [2023-02-18 19:18:05,134 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2023-02-18 19:18:05,134 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2023-02-18 19:18:05,136 INFO L445 BasicCegarLoop]: Path program histogram: [13, 1, 1, 1] [2023-02-18 19:18:05,137 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 19:18:05,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 07:18:05 BoogieIcfgContainer [2023-02-18 19:18:05,187 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 19:18:05,187 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 19:18:05,187 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 19:18:05,187 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 19:18:05,188 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:14:25" (3/4) ... [2023-02-18 19:18:05,190 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 19:18:05,193 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-18 19:18:05,196 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2023-02-18 19:18:05,196 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 19:18:05,196 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 19:18:05,196 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 19:18:05,222 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 19:18:05,223 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 19:18:05,223 INFO L158 Benchmark]: Toolchain (without parser) took 220137.52ms. Allocated memory was 104.9MB in the beginning and 140.5MB in the end (delta: 35.7MB). Free memory was 60.2MB in the beginning and 38.3MB in the end (delta: 21.8MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. [2023-02-18 19:18:05,224 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 19:18:05,224 INFO L158 Benchmark]: CACSL2BoogieTranslator took 145.38ms. Allocated memory is still 104.9MB. Free memory was 59.8MB in the beginning and 49.7MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-18 19:18:05,224 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.34ms. Allocated memory is still 104.9MB. Free memory was 49.7MB in the beginning and 47.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 19:18:05,225 INFO L158 Benchmark]: Boogie Preprocessor took 12.20ms. Allocated memory is still 104.9MB. Free memory was 47.7MB in the beginning and 46.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 19:18:05,225 INFO L158 Benchmark]: RCFGBuilder took 202.11ms. Allocated memory is still 104.9MB. Free memory was 46.4MB in the beginning and 78.0MB in the end (delta: -31.6MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2023-02-18 19:18:05,225 INFO L158 Benchmark]: TraceAbstraction took 219719.96ms. Allocated memory was 104.9MB in the beginning and 140.5MB in the end (delta: 35.7MB). Free memory was 77.6MB in the beginning and 41.5MB in the end (delta: 36.1MB). Peak memory consumption was 71.6MB. Max. memory is 16.1GB. [2023-02-18 19:18:05,227 INFO L158 Benchmark]: Witness Printer took 35.57ms. Allocated memory is still 140.5MB. Free memory was 41.5MB in the beginning and 38.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 19:18:05,230 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 104.9MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 145.38ms. Allocated memory is still 104.9MB. Free memory was 59.8MB in the beginning and 49.7MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.34ms. Allocated memory is still 104.9MB. Free memory was 49.7MB in the beginning and 47.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 12.20ms. Allocated memory is still 104.9MB. Free memory was 47.7MB in the beginning and 46.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 202.11ms. Allocated memory is still 104.9MB. Free memory was 46.4MB in the beginning and 78.0MB in the end (delta: -31.6MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * TraceAbstraction took 219719.96ms. Allocated memory was 104.9MB in the beginning and 140.5MB in the end (delta: 35.7MB). Free memory was 77.6MB in the beginning and 41.5MB in the end (delta: 36.1MB). Peak memory consumption was 71.6MB. Max. memory is 16.1GB. * Witness Printer took 35.57ms. Allocated memory is still 140.5MB. Free memory was 41.5MB in the beginning and 38.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 219.6s, OverallIterations: 16, TraceHistogramMax: 27, PathProgramHistogramMax: 13, EmptinessCheckTime: 0.0s, AutomataDifference: 25.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 298 SdHoareTripleChecker+Valid, 16.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 290 mSDsluCounter, 2665 SdHoareTripleChecker+Invalid, 15.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 115 IncrementalHoareTripleChecker+Unchecked, 2245 mSDsCounter, 201 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5029 IncrementalHoareTripleChecker+Invalid, 5350 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 201 mSolverCounterUnsat, 420 mSDtfsCounter, 5029 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1315 GetRequests, 935 SyntacticMatches, 18 SemanticMatches, 362 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 1223 ImplicationChecksByTransitivity, 157.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=15, InterpolantAutomatonStates: 232, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 52 PreInvPairs, 112 NumberOfFragments, 17946 HoareAnnotationTreeSize, 52 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 188.9s InterpolantComputationTime, 959 NumberOfCodeBlocks, 955 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 1047 ConstructedInterpolants, 0 QuantifiedInterpolants, 9774 SizeOfPredicates, 68 NumberOfNonLiveVariables, 2608 ConjunctsInSsa, 568 ConjunctsInUnsatCore, 18 InterpolantComputations, 3 PerfectInterpolantSequences, 4210/5635 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: ((((((((((((((((((((((((((((((((((((c <= 1 + 6 && y == 1 + 6) && k >= 0) && 6 <= c + -1) && (0 == 4 * x + -(y * y * y * y) + -(2 * y * y * y) + -(y * y) || (y == 1 + 0 && x + -1 * y * y * y == 0))) && k <= 20) && (c < k || 0 == k * y + -(y * y))) && y == 1 + (1 + (1 + (1 + (1 + 2))))) && y == 1 + (1 + 5)) && c + -1 == 1 + (1 + (1 + 3))) && (((k >= 0 && cond == 1) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && c == 1 + 6) && 6 < k) && c == 1 + (1 + 5)) && c + -1 == 1 + 5) && c + -1 + -1 + -1 == 1 + 3) && y + -1 + -1 == 1 + (1 + 3)) && y == 1 + (1 + (1 + 4))) || (((((((((((((((y == 1 + 1 && c <= 1 + 1) && c + -1 == 1 + 0) && y + -1 == 1 + 0) && k >= 0) && c + -1 + -1 == 0) && 1 < k) && (0 == 4 * x + -(y * y * y * y) + -(2 * y * y * y) + -(y * y) || (y == 1 + 0 && x + -1 * y * y * y == 0))) && k <= 20) && y + -1 + -1 == 0) && y == 1 + (1 + 0)) && (c < k || 0 == k * y + -(y * y))) && 1 <= c + -1) && (((k >= 0 && cond == 1) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && c == 1 + 1) && 0 < k)) || ((((((((((((((((((c + -1 + -1 + -1 == 0 && y + -1 == 1 + (1 + 0)) && c + -1 + -1 == 1 + 0) && 2 <= c + -1) && c <= 1 + (1 + 1)) && y == 1 + (1 + 1)) && k >= 0) && y + -1 + -1 == 1 + 0) && c + -1 == 1 + 1) && (0 == 4 * x + -(y * y * y * y) + -(2 * y * y * y) + -(y * y) || (y == 1 + 0 && x + -1 * y * y * y == 0))) && k <= 20) && (c < k || 0 == k * y + -(y * y))) && y + -1 == 1 + 1) && (((k >= 0 && cond == 1) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && c == 1 + 2) && c == 1 + (1 + 1)) && 1 + 1 < k) && y == 1 + 2) && 0 < k)) || ((((((((((((((((1 + (1 + (1 + (1 + (1 + c)))) + 1 < k || 0 == k * (1 + (1 + (1 + (1 + (1 + (1 + y)))))) + -((1 + (1 + (1 + (1 + (1 + (1 + y)))))) * (1 + (1 + (1 + (1 + (1 + (1 + y)))))))) || !(1 + (1 + (1 + (1 + (1 + c)))) < k)) && ((c + 1 < k || 0 == k * (1 + y) + -((1 + y) * (1 + y))) || !(c < k))) && ((1 + (1 + (1 + (1 + (1 + (1 + (1 + c)))))) + 1 < k || !(1 + (1 + (1 + (1 + (1 + (1 + (1 + c)))))) < k)) || 0 == k * (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 + y))))))))))) && ((1 + (1 + (1 + (1 + c))) + 1 < k || !(1 + (1 + (1 + (1 + c))) < k)) || 0 == k * (1 + (1 + (1 + (1 + (1 + y))))) + -((1 + (1 + (1 + (1 + (1 + y))))) * (1 + (1 + (1 + (1 + (1 + y)))))))) && k >= 0) && ((0 == k * (1 + (1 + (1 + y))) + -((1 + (1 + (1 + y))) * (1 + (1 + (1 + y)))) || !(1 + (1 + c) < k)) || 1 + (1 + c) + 1 < k)) && ((!(1 + c < k) || 1 + c + 1 < k) || 0 == k * (1 + (1 + y)) + -((1 + (1 + y)) * (1 + (1 + y))))) && (0 == 4 * x + -(y * y * y * y) + -(2 * y * y * y) + -(y * y) || (y == 1 + 0 && x + -1 * y * y * y == 0))) && k <= 20) && ((!(1 + (1 + (1 + (1 + (1 + (1 + c))))) < k) || 0 == k * (1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))) + -((1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))) * (1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))))) || 1 + (1 + (1 + (1 + (1 + (1 + c))))) + 1 < k)) && (c < k || 0 == k * y + -(y * y))) && (((k >= 0 && cond == 1) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && 14 <= c + -1) && ((0 == k * (1 + (1 + (1 + (1 + y)))) + -((1 + (1 + (1 + (1 + y)))) * (1 + (1 + (1 + (1 + y))))) || !(1 + (1 + (1 + c)) < k)) || 1 + (1 + (1 + c)) + 1 < k)) && ((0 == k * (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))))) + -((1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))))) * (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y)))))))))) || !(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + c))))))) < k)) || 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + c))))))) + 1 < k))) || (((((((((((((((((((((1 + (1 + (1 + (1 + (1 + c)))) + 1 < k || 0 == k * (1 + (1 + (1 + (1 + (1 + (1 + y)))))) + -((1 + (1 + (1 + (1 + (1 + (1 + y)))))) * (1 + (1 + (1 + (1 + (1 + (1 + y)))))))) || !(1 + (1 + (1 + (1 + (1 + c)))) < k)) && ((1 + (1 + (1 + (1 + (1 + (1 + (1 + c)))))) + 1 < k || !(1 + (1 + (1 + (1 + (1 + (1 + (1 + c)))))) < k)) || 0 == k * (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 + y))))))))))) && ((c + 1 < k || 0 == k * (1 + y) + -((1 + y) * (1 + y))) || !(c < k))) && ((1 + (1 + (1 + (1 + c))) + 1 < k || !(1 + (1 + (1 + (1 + c))) < k)) || 0 == k * (1 + (1 + (1 + (1 + (1 + y))))) + -((1 + (1 + (1 + (1 + (1 + y))))) * (1 + (1 + (1 + (1 + (1 + y)))))))) && k >= 0) && ((1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + c)))))))) + 1 < k || 0 == k * (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y)))))))))) + -((1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y)))))))))) * (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y)))))))))))) || !(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + c)))))))) < k))) && y + -1 + -1 == 1 + 9) && ((0 == k * (1 + (1 + (1 + y))) + -((1 + (1 + (1 + y))) * (1 + (1 + (1 + y)))) || !(1 + (1 + c) < k)) || 1 + (1 + c) + 1 < k)) && ((!(1 + c < k) || 1 + c + 1 < k) || 0 == k * (1 + (1 + y)) + -((1 + (1 + y)) * (1 + (1 + y))))) && 11 < k) && (0 == 4 * x + -(y * y * y * y) + -(2 * y * y * y) + -(y * y) || (y == 1 + 0 && x + -1 * y * y * y == 0))) && k <= 20) && ((!(1 + (1 + (1 + (1 + (1 + (1 + c))))) < k) || 0 == k * (1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))) + -((1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))) * (1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))))) || 1 + (1 + (1 + (1 + (1 + (1 + c))))) + 1 < k)) && ((1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + c))))))))) + 1 < k || 0 == k * (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))))))) + -((1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))))))) * (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))))))))) || !(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + c))))))))) < k))) && 11 <= c + -1) && (((k >= 0 && cond == 1) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && ((0 == k * (1 + (1 + (1 + (1 + y)))) + -((1 + (1 + (1 + (1 + y)))) * (1 + (1 + (1 + (1 + y))))) || !(1 + (1 + (1 + c)) < k)) || 1 + (1 + (1 + c)) + 1 < k)) && c <= 1 + 11) && ((0 == k * (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 + y))))))))))))) || !(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + c)))))))))) < k)) || 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + c)))))))))) + 1 < k)) && ((0 == k * (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))))) + -((1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))))) * (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y)))))))))) || !(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + c))))))) < k)) || 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + c))))))) + 1 < k))) || ((((((((((((((8 <= c + -1 && c <= 1 + (1 + (1 + (1 + 5)))) && c + -1 + -1 + -1 == 1 + 5) && k >= 0) && c == 1 + (1 + (1 + 6))) && 1 + (1 + (1 + 5)) < k) && y + -1 == 1 + 7) && (0 == 4 * x + -(y * y * y * y) + -(2 * y * y * y) + -(y * y) || (y == 1 + 0 && x + -1 * y * y * y == 0))) && k <= 20) && (c < k || 0 == k * y + -(y * y))) && y == 1 + (1 + (1 + (1 + (1 + 4))))) && c == 1 + (1 + 7)) && (((k >= 0 && cond == 1) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && y + -1 == 1 + (1 + (1 + 5))) && y + -1 + -1 == 1 + (1 + (1 + (1 + (1 + 2)))))) || ((((((((((((((((y == 1 + (1 + (1 + (1 + 4))) && y + -1 == 1 + 6) && k >= 0) && c == 1 + 7) && c == 1 + (1 + (1 + 5))) && c <= 1 + 7) && c + -1 + -1 == 1 + 5) && (0 == 4 * x + -(y * y * y * y) + -(2 * y * y * y) + -(y * y) || (y == 1 + 0 && x + -1 * y * y * y == 0))) && k <= 20) && (c < k || 0 == k * y + -(y * y))) && y + -1 == 1 + (1 + (1 + (1 + (1 + 2))))) && (((k >= 0 && cond == 1) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && c == 1 + (1 + 6)) && y == 1 + 7) && y == 1 + (1 + (1 + 5))) && 7 < k) && 7 <= c + -1)) || ((((((((((k >= 0 && cond == 1) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0)) && k >= 0) && x == 0) && c >= 0) && y == 0) && k <= 20) && c == 0) && x <= 0)) || ((((((((((((((((((y == 1 + (1 + (1 + (1 + 2))) && c + -1 == 1 + (1 + (1 + 2))) && k >= 0) && y + -1 == 1 + 4) && c == 1 + (1 + (1 + 3))) && y == 1 + 5) && (0 == 4 * x + -(y * y * y * y) + -(2 * y * y * y) + -(y * y) || (y == 1 + 0 && x + -1 * y * y * y == 0))) && k <= 20) && 5 <= c + -1) && (c < k || 0 == k * y + -(y * y))) && c == 1 + 5) && c + -1 + -1 == 1 + 3) && y + -1 == 1 + (1 + 3)) && (((k >= 0 && cond == 1) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && 5 < k) && y == 1 + (1 + 4)) && y + -1 + -1 == 1 + 3) && c <= 1 + 5) && 0 < k)) || (((((((((((c < k || 0 == k * y + -(y * y)) && 10 <= c + -1) && c <= 1 + 10) && y + -1 == 1 + 9) && (((k >= 0 && cond == 1) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && 10 < k) && k >= 0) && y + -1 + -1 + -1 == 1 + (1 + (1 + 5))) && c + -1 + -1 == 1 + (1 + 7)) && (0 == 4 * x + -(y * y * y * y) + -(2 * y * y * y) + -(y * y) || (y == 1 + 0 && x + -1 * y * y * y == 0))) && k <= 20)) || ((((((((((((((((((c == 1 + (1 + (1 + 1)) && 1 + 2 < k) && y == 1 + (1 + 2)) && y == 1 + 3) && c + -1 + -1 == 1 + 1) && k >= 0) && y + -1 + -1 == 1 + (1 + 0)) && y + -1 + -1 + -1 == 1 + 0) && (0 == 4 * x + -(y * y * y * y) + -(2 * y * y * y) + -(y * y) || (y == 1 + 0 && x + -1 * y * y * y == 0))) && k <= 20) && c + -1 == 1 + 2) && (c < k || 0 == k * y + -(y * y))) && c == 1 + 3) && y + -1 == 1 + (1 + 1)) && (((k >= 0 && cond == 1) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && 3 <= c + -1) && c <= 1 + (1 + 2)) && c == 1 + (1 + 2)) && 0 < k)) || ((((((((((((c <= 1 + 9 && k >= 0) && c + -1 == 1 + (1 + (1 + 6))) && c + -1 == 1 + (1 + 7)) && y + -1 + -1 == 1 + (1 + (1 + 5))) && (0 == 4 * x + -(y * y * y * y) + -(2 * y * y * y) + -(y * y) || (y == 1 + 0 && x + -1 * y * y * y == 0))) && k <= 20) && y == 1 + (1 + (1 + (1 + (1 + (1 + 4)))))) && (c < k || 0 == k * y + -(y * y))) && (((k >= 0 && cond == 1) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && 9 <= c + -1) && y == 1 + 9) && 9 < k)) || ((((((((((c < k || 0 == k * y + -(y * y)) && ((c + 1 < k || 0 == k * (1 + y) + -((1 + y) * (1 + y))) || !(c < k))) && (((k >= 0 && cond == 1) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && 19 <= c + -1) && k >= 0) && ((0 == k * (1 + (1 + (1 + y))) + -((1 + (1 + (1 + y))) * (1 + (1 + (1 + y)))) || !(1 + (1 + c) < k)) || 1 + (1 + c) + 1 < k)) && ((!(1 + c < k) || 1 + c + 1 < k) || 0 == k * (1 + (1 + y)) + -((1 + (1 + y)) * (1 + (1 + y))))) && ((0 == k * (1 + (1 + (1 + (1 + y)))) + -((1 + (1 + (1 + (1 + y)))) * (1 + (1 + (1 + (1 + y))))) || !(1 + (1 + (1 + c)) < k)) || 1 + (1 + (1 + c)) + 1 < k)) && (0 == 4 * x + -(y * y * y * y) + -(2 * y * y * y) + -(y * y) || (y == 1 + 0 && x + -1 * y * y * y == 0))) && k <= 20)) || ((((((((((((k >= 0 && x + -1 * y * y * y <= 0) && c + -1 == 0) && (0 == 4 * x + -(y * y * y * y) + -(2 * y * y * y) + -(y * y) || (y == 1 + 0 && x + -1 * y * y * y == 0))) && k <= 20) && (c < k || 0 == k * y + -(y * y))) && y == 1 + 0) && (((k >= 0 && cond == 1) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && c == 1 + 0) && 0 <= c + -1) && c <= 1 + 0) && y + -1 == 0) && 0 < k)) || (((((((((((((((1 + (1 + (1 + (1 + (1 + c)))) + 1 < k || 0 == k * (1 + (1 + (1 + (1 + (1 + (1 + y)))))) + -((1 + (1 + (1 + (1 + (1 + (1 + y)))))) * (1 + (1 + (1 + (1 + (1 + (1 + y)))))))) || !(1 + (1 + (1 + (1 + (1 + c)))) < k)) && ((c + 1 < k || 0 == k * (1 + y) + -((1 + y) * (1 + y))) || !(c < k))) && ((1 + (1 + (1 + (1 + (1 + (1 + (1 + c)))))) + 1 < k || !(1 + (1 + (1 + (1 + (1 + (1 + (1 + c)))))) < k)) || 0 == k * (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 + y))))))))))) && ((1 + (1 + (1 + (1 + c))) + 1 < k || !(1 + (1 + (1 + (1 + c))) < k)) || 0 == k * (1 + (1 + (1 + (1 + (1 + y))))) + -((1 + (1 + (1 + (1 + (1 + y))))) * (1 + (1 + (1 + (1 + (1 + y)))))))) && k >= 0) && ((0 == k * (1 + (1 + (1 + y))) + -((1 + (1 + (1 + y))) * (1 + (1 + (1 + y)))) || !(1 + (1 + c) < k)) || 1 + (1 + c) + 1 < k)) && ((!(1 + c < k) || 1 + c + 1 < k) || 0 == k * (1 + (1 + y)) + -((1 + (1 + y)) * (1 + (1 + y))))) && (0 == 4 * x + -(y * y * y * y) + -(2 * y * y * y) + -(y * y) || (y == 1 + 0 && x + -1 * y * y * y == 0))) && k <= 20) && ((!(1 + (1 + (1 + (1 + (1 + (1 + c))))) < k) || 0 == k * (1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))) + -((1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))) * (1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))))) || 1 + (1 + (1 + (1 + (1 + (1 + c))))) + 1 < k)) && (c < k || 0 == k * y + -(y * y))) && (((k >= 0 && cond == 1) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && ((0 == k * (1 + (1 + (1 + (1 + y)))) + -((1 + (1 + (1 + (1 + y)))) * (1 + (1 + (1 + (1 + y))))) || !(1 + (1 + (1 + c)) < k)) || 1 + (1 + (1 + c)) + 1 < k)) && 15 <= c + -1)) || (((((((((((c < k || 0 == k * y + -(y * y)) && ((c + 1 < k || 0 == k * (1 + y) + -((1 + y) * (1 + y))) || !(c < k))) && (((k >= 0 && cond == 1) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && ((1 + (1 + (1 + (1 + c))) + 1 < k || !(1 + (1 + (1 + (1 + c))) < k)) || 0 == k * (1 + (1 + (1 + (1 + (1 + y))))) + -((1 + (1 + (1 + (1 + (1 + y))))) * (1 + (1 + (1 + (1 + (1 + y)))))))) && k >= 0) && ((0 == k * (1 + (1 + (1 + y))) + -((1 + (1 + (1 + y))) * (1 + (1 + (1 + y)))) || !(1 + (1 + c) < k)) || 1 + (1 + c) + 1 < k)) && 18 <= c + -1) && ((!(1 + c < k) || 1 + c + 1 < k) || 0 == k * (1 + (1 + y)) + -((1 + (1 + y)) * (1 + (1 + y))))) && ((0 == k * (1 + (1 + (1 + (1 + y)))) + -((1 + (1 + (1 + (1 + y)))) * (1 + (1 + (1 + (1 + y))))) || !(1 + (1 + (1 + c)) < k)) || 1 + (1 + (1 + c)) + 1 < k)) && (0 == 4 * x + -(y * y * y * y) + -(2 * y * y * y) + -(y * y) || (y == 1 + 0 && x + -1 * y * y * y == 0))) && k <= 20)) || ((((((((((((c < k || 0 == k * y + -(y * y)) && ((1 + (1 + (1 + (1 + (1 + c)))) + 1 < k || 0 == k * (1 + (1 + (1 + (1 + (1 + (1 + y)))))) + -((1 + (1 + (1 + (1 + (1 + (1 + y)))))) * (1 + (1 + (1 + (1 + (1 + (1 + y)))))))) || !(1 + (1 + (1 + (1 + (1 + c)))) < k))) && ((c + 1 < k || 0 == k * (1 + y) + -((1 + y) * (1 + y))) || !(c < k))) && (((k >= 0 && cond == 1) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && ((1 + (1 + (1 + (1 + c))) + 1 < k || !(1 + (1 + (1 + (1 + c))) < k)) || 0 == k * (1 + (1 + (1 + (1 + (1 + y))))) + -((1 + (1 + (1 + (1 + (1 + y))))) * (1 + (1 + (1 + (1 + (1 + y)))))))) && k >= 0) && ((0 == k * (1 + (1 + (1 + y))) + -((1 + (1 + (1 + y))) * (1 + (1 + (1 + y)))) || !(1 + (1 + c) < k)) || 1 + (1 + c) + 1 < k)) && ((!(1 + c < k) || 1 + c + 1 < k) || 0 == k * (1 + (1 + y)) + -((1 + (1 + y)) * (1 + (1 + y))))) && ((0 == k * (1 + (1 + (1 + (1 + y)))) + -((1 + (1 + (1 + (1 + y)))) * (1 + (1 + (1 + (1 + y))))) || !(1 + (1 + (1 + c)) < k)) || 1 + (1 + (1 + c)) + 1 < k)) && (0 == 4 * x + -(y * y * y * y) + -(2 * y * y * y) + -(y * y) || (y == 1 + 0 && x + -1 * y * y * y == 0))) && k <= 20) && 17 <= c + -1)) || ((((((((((((((1 + (1 + (1 + (1 + (1 + c)))) + 1 < k || 0 == k * (1 + (1 + (1 + (1 + (1 + (1 + y)))))) + -((1 + (1 + (1 + (1 + (1 + (1 + y)))))) * (1 + (1 + (1 + (1 + (1 + (1 + y)))))))) || !(1 + (1 + (1 + (1 + (1 + c)))) < k)) && ((c + 1 < k || 0 == k * (1 + y) + -((1 + y) * (1 + y))) || !(c < k))) && ((1 + (1 + (1 + (1 + c))) + 1 < k || !(1 + (1 + (1 + (1 + c))) < k)) || 0 == k * (1 + (1 + (1 + (1 + (1 + y))))) + -((1 + (1 + (1 + (1 + (1 + y))))) * (1 + (1 + (1 + (1 + (1 + y)))))))) && k >= 0) && ((0 == k * (1 + (1 + (1 + y))) + -((1 + (1 + (1 + y))) * (1 + (1 + (1 + y)))) || !(1 + (1 + c) < k)) || 1 + (1 + c) + 1 < k)) && ((!(1 + c < k) || 1 + c + 1 < k) || 0 == k * (1 + (1 + y)) + -((1 + (1 + y)) * (1 + (1 + y))))) && (0 == 4 * x + -(y * y * y * y) + -(2 * y * y * y) + -(y * y) || (y == 1 + 0 && x + -1 * y * y * y == 0))) && k <= 20) && ((!(1 + (1 + (1 + (1 + (1 + (1 + c))))) < k) || 0 == k * (1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))) + -((1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))) * (1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))))) || 1 + (1 + (1 + (1 + (1 + (1 + c))))) + 1 < k)) && (c < k || 0 == k * y + -(y * y))) && 16 <= c + -1) && (((k >= 0 && cond == 1) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && ((0 == k * (1 + (1 + (1 + (1 + y)))) + -((1 + (1 + (1 + (1 + y)))) * (1 + (1 + (1 + (1 + y))))) || !(1 + (1 + (1 + c)) < k)) || 1 + (1 + (1 + c)) + 1 < k))) || ((((((((((((((((((1 + (1 + (1 + (1 + (1 + c)))) + 1 < k || 0 == k * (1 + (1 + (1 + (1 + (1 + (1 + y)))))) + -((1 + (1 + (1 + (1 + (1 + (1 + y)))))) * (1 + (1 + (1 + (1 + (1 + (1 + y)))))))) || !(1 + (1 + (1 + (1 + (1 + c)))) < k)) && ((1 + (1 + (1 + (1 + (1 + (1 + (1 + c)))))) + 1 < k || !(1 + (1 + (1 + (1 + (1 + (1 + (1 + c)))))) < k)) || 0 == k * (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 + y))))))))))) && ((c + 1 < k || 0 == k * (1 + y) + -((1 + y) * (1 + y))) || !(c < k))) && ((1 + (1 + (1 + (1 + c))) + 1 < k || !(1 + (1 + (1 + (1 + c))) < k)) || 0 == k * (1 + (1 + (1 + (1 + (1 + y))))) + -((1 + (1 + (1 + (1 + (1 + y))))) * (1 + (1 + (1 + (1 + (1 + y)))))))) && k >= 0) && ((1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + c)))))))) + 1 < k || 0 == k * (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y)))))))))) + -((1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y)))))))))) * (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y)))))))))))) || !(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + c)))))))) < k))) && ((0 == k * (1 + (1 + (1 + y))) + -((1 + (1 + (1 + y))) * (1 + (1 + (1 + y)))) || !(1 + (1 + c) < k)) || 1 + (1 + c) + 1 < k)) && ((!(1 + c < k) || 1 + c + 1 < k) || 0 == k * (1 + (1 + y)) + -((1 + (1 + y)) * (1 + (1 + y))))) && (0 == 4 * x + -(y * y * y * y) + -(2 * y * y * y) + -(y * y) || (y == 1 + 0 && x + -1 * y * y * y == 0))) && k <= 20) && ((!(1 + (1 + (1 + (1 + (1 + (1 + c))))) < k) || 0 == k * (1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))) + -((1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))) * (1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))))) || 1 + (1 + (1 + (1 + (1 + (1 + c))))) + 1 < k)) && 12 <= c + -1) && (c < k || 0 == k * y + -(y * y))) && ((1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + c))))))))) + 1 < k || 0 == k * (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))))))) + -((1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))))))) * (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))))))))) || !(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + c))))))))) < k))) && (((k >= 0 && cond == 1) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && ((0 == k * (1 + (1 + (1 + (1 + y)))) + -((1 + (1 + (1 + (1 + y)))) * (1 + (1 + (1 + (1 + y))))) || !(1 + (1 + (1 + c)) < k)) || 1 + (1 + (1 + c)) + 1 < k)) && ((0 == k * (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))))) + -((1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))))) * (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y)))))))))) || !(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + c))))))) < k)) || 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + c))))))) + 1 < k))) || ((((((((((((((((((c == 1 + (1 + (1 + 2)) && y + -1 == 1 + 3) && k >= 0) && 4 <= c + -1) && y == 1 + (1 + 3)) && c + -1 + -1 + -1 == 1 + 1) && (0 == 4 * x + -(y * y * y * y) + -(2 * y * y * y) + -(y * y) || (y == 1 + 0 && x + -1 * y * y * y == 0))) && y + -1 + -1 == 1 + (1 + 1)) && k <= 20) && y == 1 + 4) && (c < k || 0 == k * y + -(y * y))) && c + -1 == 1 + 3) && (((k >= 0 && cond == 1) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && y == 1 + (1 + (1 + 2))) && 1 + (1 + (1 + 1)) < k) && c + -1 + -1 == 1 + 2) && c <= 1 + (1 + (1 + (1 + 1)))) && 0 < k) && c == 1 + (1 + 3))) || (((((((((((((((13 <= c + -1 && ((1 + (1 + (1 + (1 + (1 + c)))) + 1 < k || 0 == k * (1 + (1 + (1 + (1 + (1 + (1 + y)))))) + -((1 + (1 + (1 + (1 + (1 + (1 + y)))))) * (1 + (1 + (1 + (1 + (1 + (1 + y)))))))) || !(1 + (1 + (1 + (1 + (1 + c)))) < k))) && ((1 + (1 + (1 + (1 + (1 + (1 + (1 + c)))))) + 1 < k || !(1 + (1 + (1 + (1 + (1 + (1 + (1 + c)))))) < k)) || 0 == k * (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 + y))))))))))) && ((c + 1 < k || 0 == k * (1 + y) + -((1 + y) * (1 + y))) || !(c < k))) && ((1 + (1 + (1 + (1 + c))) + 1 < k || !(1 + (1 + (1 + (1 + c))) < k)) || 0 == k * (1 + (1 + (1 + (1 + (1 + y))))) + -((1 + (1 + (1 + (1 + (1 + y))))) * (1 + (1 + (1 + (1 + (1 + y)))))))) && k >= 0) && ((1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + c)))))))) + 1 < k || 0 == k * (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y)))))))))) + -((1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y)))))))))) * (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y)))))))))))) || !(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + c)))))))) < k))) && ((0 == k * (1 + (1 + (1 + y))) + -((1 + (1 + (1 + y))) * (1 + (1 + (1 + y)))) || !(1 + (1 + c) < k)) || 1 + (1 + c) + 1 < k)) && ((!(1 + c < k) || 1 + c + 1 < k) || 0 == k * (1 + (1 + y)) + -((1 + (1 + y)) * (1 + (1 + y))))) && (0 == 4 * x + -(y * y * y * y) + -(2 * y * y * y) + -(y * y) || (y == 1 + 0 && x + -1 * y * y * y == 0))) && k <= 20) && ((!(1 + (1 + (1 + (1 + (1 + (1 + c))))) < k) || 0 == k * (1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))) + -((1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))) * (1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))))) || 1 + (1 + (1 + (1 + (1 + (1 + c))))) + 1 < k)) && (c < k || 0 == k * y + -(y * y))) && (((k >= 0 && cond == 1) && k <= 20) || ((!(k <= 20) || !(k >= 0)) && cond == 0))) && ((0 == k * (1 + (1 + (1 + (1 + y)))) + -((1 + (1 + (1 + (1 + y)))) * (1 + (1 + (1 + (1 + y))))) || !(1 + (1 + (1 + c)) < k)) || 1 + (1 + (1 + c)) + 1 < k)) && ((0 == k * (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))))) + -((1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y))))))))) * (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + y)))))))))) || !(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + c))))))) < k)) || 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + c))))))) + 1 < k)) RESULT: Ultimate proved your program to be correct! [2023-02-18 19:18:05,278 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