./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound10.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_valuebound10.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 53086523abe0dc699ccd28b0916f17f8825d4641577f06835b9d81e9579a444f --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 07:50:10,699 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 07:50:10,701 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 07:50:10,726 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 07:50:10,727 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 07:50:10,727 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 07:50:10,728 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 07:50:10,729 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 07:50:10,730 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 07:50:10,731 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 07:50:10,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 07:50:10,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 07:50:10,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 07:50:10,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 07:50:10,735 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 07:50:10,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 07:50:10,745 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 07:50:10,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 07:50:10,746 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 07:50:10,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 07:50:10,748 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 07:50:10,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 07:50:10,749 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 07:50:10,750 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 07:50:10,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 07:50:10,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 07:50:10,752 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 07:50:10,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 07:50:10,756 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 07:50:10,757 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 07:50:10,757 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 07:50:10,758 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 07:50:10,758 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 07:50:10,759 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 07:50:10,759 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 07:50:10,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 07:50:10,761 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 07:50:10,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 07:50:10,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 07:50:10,762 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 07:50:10,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 07:50:10,764 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 07:50:10,778 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 07:50:10,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 07:50:10,783 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 07:50:10,783 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 07:50:10,784 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 07:50:10,784 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 07:50:10,785 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 07:50:10,785 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 07:50:10,785 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 07:50:10,786 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 07:50:10,786 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 07:50:10,786 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 07:50:10,787 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 07:50:10,787 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 07:50:10,787 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 07:50:10,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 07:50:10,787 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 07:50:10,787 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 07:50:10,787 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 07:50:10,787 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 07:50:10,788 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 07:50:10,788 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 07:50:10,788 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 07:50:10,788 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 07:50:10,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 07:50:10,788 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 07:50:10,788 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 07:50:10,789 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 07:50:10,789 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 07:50:10,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 07:50:10,789 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 07:50:10,789 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 07:50:10,790 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 07:50:10,790 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 07:50:10,790 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 07:50:10,790 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 -> 53086523abe0dc699ccd28b0916f17f8825d4641577f06835b9d81e9579a444f [2023-02-17 07:50:11,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 07:50:11,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 07:50:11,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 07:50:11,030 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 07:50:11,030 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 07:50:11,031 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound10.c [2023-02-17 07:50:11,913 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 07:50:12,039 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 07:50:12,040 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound10.c [2023-02-17 07:50:12,044 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b367c831/383885a3c01a4dad80a4048b8ade1217/FLAG0d9ccbd5a [2023-02-17 07:50:12,053 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b367c831/383885a3c01a4dad80a4048b8ade1217 [2023-02-17 07:50:12,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 07:50:12,056 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 07:50:12,057 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 07:50:12,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 07:50:12,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 07:50:12,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 07:50:12" (1/1) ... [2023-02-17 07:50:12,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ce8d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:50:12, skipping insertion in model container [2023-02-17 07:50:12,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 07:50:12" (1/1) ... [2023-02-17 07:50:12,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 07:50:12,081 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 07:50:12,198 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_valuebound10.c[458,471] [2023-02-17 07:50:12,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 07:50:12,217 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 07:50:12,225 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound10.c[458,471] [2023-02-17 07:50:12,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 07:50:12,246 INFO L208 MainTranslator]: Completed translation [2023-02-17 07:50:12,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:50:12 WrapperNode [2023-02-17 07:50:12,246 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 07:50:12,247 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 07:50:12,247 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 07:50:12,247 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 07:50:12,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:50:12" (1/1) ... [2023-02-17 07:50:12,255 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:50:12" (1/1) ... [2023-02-17 07:50:12,265 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2023-02-17 07:50:12,265 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 07:50:12,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 07:50:12,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 07:50:12,266 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 07:50:12,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:50:12" (1/1) ... [2023-02-17 07:50:12,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:50:12" (1/1) ... [2023-02-17 07:50:12,273 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:50:12" (1/1) ... [2023-02-17 07:50:12,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:50:12" (1/1) ... [2023-02-17 07:50:12,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:50:12" (1/1) ... [2023-02-17 07:50:12,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:50:12" (1/1) ... [2023-02-17 07:50:12,277 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:50:12" (1/1) ... [2023-02-17 07:50:12,280 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:50:12" (1/1) ... [2023-02-17 07:50:12,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 07:50:12,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 07:50:12,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 07:50:12,282 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 07:50:12,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:50:12" (1/1) ... [2023-02-17 07:50:12,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 07:50:12,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:50:12,307 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-17 07:50:12,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-17 07:50:12,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 07:50:12,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 07:50:12,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 07:50:12,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 07:50:12,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-17 07:50:12,330 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-17 07:50:12,371 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 07:50:12,372 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 07:50:12,442 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 07:50:12,446 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 07:50:12,447 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-17 07:50:12,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 07:50:12 BoogieIcfgContainer [2023-02-17 07:50:12,448 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 07:50:12,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 07:50:12,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 07:50:12,452 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 07:50:12,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 07:50:12" (1/3) ... [2023-02-17 07:50:12,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1658dcb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 07:50:12, skipping insertion in model container [2023-02-17 07:50:12,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:50:12" (2/3) ... [2023-02-17 07:50:12,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1658dcb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 07:50:12, skipping insertion in model container [2023-02-17 07:50:12,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 07:50:12" (3/3) ... [2023-02-17 07:50:12,455 INFO L112 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound10.c [2023-02-17 07:50:12,466 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 07:50:12,467 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 07:50:12,498 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 07:50:12,503 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;@5624124e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 07:50:12,503 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 07:50:12,506 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-17 07:50:12,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 07:50:12,511 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:50:12,511 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:50:12,512 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:50:12,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:50:12,516 INFO L85 PathProgramCache]: Analyzing trace with hash -589436290, now seen corresponding path program 1 times [2023-02-17 07:50:12,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:50:12,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25064798] [2023-02-17 07:50:12,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:50:12,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:50:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:50:12,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:50:12,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25064798] [2023-02-17 07:50:12,595 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-17 07:50:12,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412380572] [2023-02-17 07:50:12,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:50:12,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:50:12,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:50:12,598 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 07:50:12,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 07:50:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:50:12,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-17 07:50:12,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:50:12,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 07:50:12,704 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 07:50:12,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412380572] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 07:50:12,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 07:50:12,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 07:50:12,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112261619] [2023-02-17 07:50:12,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 07:50:12,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 07:50:12,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:50:12,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 07:50:12,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 07:50:12,742 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-17 07:50:12,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:50:12,754 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2023-02-17 07:50:12,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 07:50:12,756 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-17 07:50:12,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:50:12,760 INFO L225 Difference]: With dead ends: 35 [2023-02-17 07:50:12,760 INFO L226 Difference]: Without dead ends: 15 [2023-02-17 07:50:12,763 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-17 07:50:12,766 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-17 07:50:12,767 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-17 07:50:12,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-02-17 07:50:12,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-02-17 07:50:12,790 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-17 07:50:12,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2023-02-17 07:50:12,792 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 9 [2023-02-17 07:50:12,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:50:12,792 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-02-17 07:50:12,792 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-17 07:50:12,793 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2023-02-17 07:50:12,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 07:50:12,793 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:50:12,793 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:50:12,799 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-17 07:50:12,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-17 07:50:13,000 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:50:13,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:50:13,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1187358532, now seen corresponding path program 1 times [2023-02-17 07:50:13,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:50:13,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053051372] [2023-02-17 07:50:13,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:50:13,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:50:13,016 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:50:13,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [789905359] [2023-02-17 07:50:13,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:50:13,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:50:13,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:50:13,018 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 07:50:13,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 07:50:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:50:13,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-17 07:50:13,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:50:13,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 07:50:13,121 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 07:50:13,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:50:13,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053051372] [2023-02-17 07:50:13,121 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:50:13,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789905359] [2023-02-17 07:50:13,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789905359] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 07:50:13,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 07:50:13,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 07:50:13,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973164719] [2023-02-17 07:50:13,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 07:50:13,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 07:50:13,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:50:13,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 07:50:13,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 07:50:13,127 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 07:50:13,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:50:13,182 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2023-02-17 07:50:13,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 07:50:13,182 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-17 07:50:13,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:50:13,183 INFO L225 Difference]: With dead ends: 26 [2023-02-17 07:50:13,183 INFO L226 Difference]: Without dead ends: 22 [2023-02-17 07:50:13,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-17 07:50:13,184 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 07:50:13,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 45 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 07:50:13,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-17 07:50:13,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-17 07:50:13,190 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-17 07:50:13,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2023-02-17 07:50:13,190 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 9 [2023-02-17 07:50:13,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:50:13,191 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2023-02-17 07:50:13,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 07:50:13,191 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2023-02-17 07:50:13,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-17 07:50:13,191 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:50:13,192 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:50:13,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-17 07:50:13,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-02-17 07:50:13,400 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:50:13,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:50:13,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1781398469, now seen corresponding path program 1 times [2023-02-17 07:50:13,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:50:13,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698560967] [2023-02-17 07:50:13,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:50:13,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:50:13,409 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:50:13,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1019246965] [2023-02-17 07:50:13,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:50:13,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:50:13,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:50:13,416 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 07:50:13,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 07:50:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:50:13,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 07:50:13,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:50:13,521 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-17 07:50:13,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:50:13,925 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-17 07:50:13,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:50:13,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698560967] [2023-02-17 07:50:13,925 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:50:13,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019246965] [2023-02-17 07:50:13,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019246965] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:50:13,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 07:50:13,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2023-02-17 07:50:13,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345825988] [2023-02-17 07:50:13,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 07:50:13,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 07:50:13,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:50:13,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 07:50:13,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-02-17 07:50:13,927 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-17 07:50:14,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:50:14,056 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2023-02-17 07:50:14,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 07:50:14,057 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-17 07:50:14,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:50:14,058 INFO L225 Difference]: With dead ends: 33 [2023-02-17 07:50:14,059 INFO L226 Difference]: Without dead ends: 27 [2023-02-17 07:50:14,060 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-17 07:50:14,060 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:50:14,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 58 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 07:50:14,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-17 07:50:14,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2023-02-17 07:50:14,066 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-17 07:50:14,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2023-02-17 07:50:14,067 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 16 [2023-02-17 07:50:14,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:50:14,068 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2023-02-17 07:50:14,068 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-17 07:50:14,068 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2023-02-17 07:50:14,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-17 07:50:14,069 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:50:14,069 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:50:14,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-17 07:50:14,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:50:14,274 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:50:14,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:50:14,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1711372296, now seen corresponding path program 1 times [2023-02-17 07:50:14,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:50:14,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720505786] [2023-02-17 07:50:14,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:50:14,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:50:14,284 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:50:14,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [526130790] [2023-02-17 07:50:14,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:50:14,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:50:14,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:50:14,287 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 07:50:14,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-17 07:50:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:50:14,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-17 07:50:14,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:50:14,385 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-17 07:50:14,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:50:28,235 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| Int)) (or (= (mod (+ (* 2 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8|) (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8|) (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8|)) 4) 0) (= 0 (+ (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8|) (- (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8|)))))) (not (= |c___VERIFIER_assert_#in~cond| 0))) is different from true [2023-02-17 07:50:34,259 WARN L859 $PredicateComparison]: unable to prove that (or (= 0 c___VERIFIER_assert_~cond) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| Int)) (or (= (mod (+ (* 2 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8|) (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8|) (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8|)) 4) 0) (= 0 (+ (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8|) (- (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_8|)))))) (not (= |c___VERIFIER_assert_#in~cond| 0))) is different from true [2023-02-17 07:50:38,294 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-17 07:50:38,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:50:38,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720505786] [2023-02-17 07:50:38,304 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:50:38,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526130790] [2023-02-17 07:50:38,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526130790] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:50:38,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 07:50:38,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2023-02-17 07:50:38,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100424180] [2023-02-17 07:50:38,305 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 07:50:38,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 07:50:38,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:50:38,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 07:50:38,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=119, Unknown=7, NotChecked=72, Total=240 [2023-02-17 07:50:38,306 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 07:50:38,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:50:38,397 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2023-02-17 07:50:38,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 07:50:38,397 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2023-02-17 07:50:38,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:50:38,398 INFO L225 Difference]: With dead ends: 31 [2023-02-17 07:50:38,398 INFO L226 Difference]: Without dead ends: 26 [2023-02-17 07:50:38,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=62, Invalid=183, Unknown=7, NotChecked=90, Total=342 [2023-02-17 07:50:38,399 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:50:38,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 60 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 07:50:38,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-17 07:50:38,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-02-17 07:50:38,404 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-17 07:50:38,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2023-02-17 07:50:38,405 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 22 [2023-02-17 07:50:38,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:50:38,405 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2023-02-17 07:50:38,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 07:50:38,405 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2023-02-17 07:50:38,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-17 07:50:38,406 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:50:38,406 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:50:38,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-17 07:50:38,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:50:38,611 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:50:38,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:50:38,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1075497887, now seen corresponding path program 2 times [2023-02-17 07:50:38,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:50:38,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067269037] [2023-02-17 07:50:38,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:50:38,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:50:38,618 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:50:38,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1664716179] [2023-02-17 07:50:38,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 07:50:38,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:50:38,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:50:38,626 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 07:50:38,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-17 07:50:38,670 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 07:50:38,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:50:38,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-17 07:50:38,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:50:38,735 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-17 07:50:38,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:50:40,847 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-17 07:50:40,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:50:40,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067269037] [2023-02-17 07:50:40,849 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:50:40,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664716179] [2023-02-17 07:50:40,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664716179] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:50:40,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 07:50:40,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2023-02-17 07:50:40,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919345645] [2023-02-17 07:50:40,850 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 07:50:40,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 07:50:40,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:50:40,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 07:50:40,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=148, Unknown=1, NotChecked=24, Total=210 [2023-02-17 07:50:40,851 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-17 07:50:40,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:50:40,953 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2023-02-17 07:50:40,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 07:50:40,953 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-17 07:50:40,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:50:40,954 INFO L225 Difference]: With dead ends: 34 [2023-02-17 07:50:40,954 INFO L226 Difference]: Without dead ends: 29 [2023-02-17 07:50:40,954 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-17 07:50:40,955 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:50:40,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 76 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 07:50:40,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-17 07:50:40,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-17 07:50:40,959 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-17 07:50:40,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2023-02-17 07:50:40,960 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2023-02-17 07:50:40,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:50:40,960 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2023-02-17 07:50:40,960 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-17 07:50:40,960 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2023-02-17 07:50:40,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-17 07:50:40,964 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:50:40,965 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:50:40,971 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-17 07:50:41,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:50:41,170 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:50:41,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:50:41,170 INFO L85 PathProgramCache]: Analyzing trace with hash 817917912, now seen corresponding path program 3 times [2023-02-17 07:50:41,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:50:41,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106984160] [2023-02-17 07:50:41,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:50:41,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:50:41,176 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:50:41,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [500922032] [2023-02-17 07:50:41,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 07:50:41,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:50:41,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:50:41,192 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 07:50:41,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-17 07:50:41,235 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-17 07:50:41,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:50:41,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-17 07:50:41,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:50:41,312 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-17 07:50:41,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:50:43,409 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-17 07:50:47,434 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-17 07:50:53,453 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-17 07:50:57,766 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-17 07:50:57,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:50:57,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106984160] [2023-02-17 07:50:57,770 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:50:57,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500922032] [2023-02-17 07:50:57,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500922032] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:50:57,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 07:50:57,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-02-17 07:50:57,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421220708] [2023-02-17 07:50:57,771 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 07:50:57,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 07:50:57,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:50:57,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 07:50:57,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=153, Unknown=4, NotChecked=108, Total=306 [2023-02-17 07:50:57,772 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-17 07:50:57,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:50:57,887 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2023-02-17 07:50:57,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 07:50:57,887 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-17 07:50:57,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:50:57,888 INFO L225 Difference]: With dead ends: 37 [2023-02-17 07:50:57,888 INFO L226 Difference]: Without dead ends: 32 [2023-02-17 07:50:57,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=60, Invalid=224, Unknown=4, NotChecked=132, Total=420 [2023-02-17 07:50:57,890 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:50:57,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 94 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 07:50:57,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-17 07:50:57,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-17 07:50:57,896 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-17 07:50:57,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2023-02-17 07:50:57,897 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 36 [2023-02-17 07:50:57,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:50:57,897 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2023-02-17 07:50:57,898 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-17 07:50:57,898 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2023-02-17 07:50:57,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-17 07:50:57,898 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:50:57,899 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:50:57,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-17 07:50:58,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:50:58,104 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:50:58,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:50:58,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1384689793, now seen corresponding path program 4 times [2023-02-17 07:50:58,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:50:58,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251088510] [2023-02-17 07:50:58,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:50:58,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:50:58,115 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:50:58,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [57808610] [2023-02-17 07:50:58,116 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 07:50:58,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:50:58,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:50:58,117 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 07:50:58,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-17 07:50:58,154 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 07:50:58,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:50:58,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-17 07:50:58,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:50:58,237 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-17 07:50:58,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:51:15,759 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-17 07:51:21,777 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-17 07:51:25,790 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-17 07:51:25,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:51:25,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251088510] [2023-02-17 07:51:25,794 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:51:25,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57808610] [2023-02-17 07:51:25,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57808610] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:51:25,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 07:51:25,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2023-02-17 07:51:25,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714514444] [2023-02-17 07:51:25,795 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 07:51:25,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 07:51:25,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:51:25,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 07:51:25,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=195, Unknown=9, NotChecked=90, Total=342 [2023-02-17 07:51:25,796 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-17 07:51:25,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:51:25,933 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2023-02-17 07:51:25,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 07:51:25,934 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-17 07:51:25,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:51:25,934 INFO L225 Difference]: With dead ends: 40 [2023-02-17 07:51:25,934 INFO L226 Difference]: Without dead ends: 35 [2023-02-17 07:51:25,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=68, Invalid=277, Unknown=9, NotChecked=108, Total=462 [2023-02-17 07:51:25,935 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-17 07:51:25,935 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-17 07:51:25,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-17 07:51:25,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-02-17 07:51:25,940 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-17 07:51:25,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-02-17 07:51:25,940 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 43 [2023-02-17 07:51:25,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:51:25,941 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-02-17 07:51:25,941 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-17 07:51:25,941 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-02-17 07:51:25,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-17 07:51:25,945 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:51:25,945 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:51:25,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-17 07:51:26,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:51:26,150 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:51:26,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:51:26,151 INFO L85 PathProgramCache]: Analyzing trace with hash -23130184, now seen corresponding path program 5 times [2023-02-17 07:51:26,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:51:26,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367279223] [2023-02-17 07:51:26,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:51:26,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:51:26,156 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:51:26,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1251170657] [2023-02-17 07:51:26,159 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-17 07:51:26,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:51:26,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:51:26,160 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 07:51:26,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-17 07:51:26,214 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-02-17 07:51:26,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:51:26,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-17 07:51:26,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:51:28,232 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~c~0#1| (- 1)))) (and (= (+ |c_ULTIMATE.start_main_~y~0#1| (- 1)) 0) (< .cse0 |c_ULTIMATE.start_main_~k~0#1|) (= .cse0 0) (= (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-17 07:51:28,295 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 14 proven. 53 refuted. 0 times theorem prover too weak. 45 trivial. 5 not checked. [2023-02-17 07:51:28,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:51:50,644 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_23| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| Int)) (or (= 0 (let ((.cse0 (+ 1 (+ 1 (+ 1 (+ 1 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38|)))))) (+ (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_23| .cse0) (- (* .cse0 .cse0))))) (= (mod (+ (* 2 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38|) (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38|) (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38|)) 4) 0)))) is different from true [2023-02-17 07:51:56,658 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_23| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| Int)) (or (= 0 (let ((.cse0 (+ 1 (+ 1 (+ 1 (+ 1 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38|)))))) (+ (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_23| .cse0) (- (* .cse0 .cse0))))) (= (mod (+ (* 2 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38|) (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38|) (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38|)) 4) 0)))) is different from true [2023-02-17 07:52:00,670 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)) (let ((.cse0 (+ 1 (+ 1 (+ 1 (+ 1 |c_ULTIMATE.start_main_~c~0#1|)))))) (or (< (+ .cse0 1) |ULTIMATE.start_main_~k~0#1|) (= 0 (let ((.cse1 (+ 1 (+ 1 (+ 1 (+ 1 (+ 1 |c_ULTIMATE.start_main_~y~0#1|))))))) (+ (* |ULTIMATE.start_main_~k~0#1| .cse1) (- (* .cse1 .cse1))))) (not (< .cse0 |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-17 07:52:00,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:52:00,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367279223] [2023-02-17 07:52:00,675 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:52:00,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251170657] [2023-02-17 07:52:00,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251170657] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:52:00,675 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 07:52:00,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2023-02-17 07:52:00,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517776858] [2023-02-17 07:52:00,675 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 07:52:00,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 07:52:00,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:52:00,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 07:52:00,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=347, Unknown=7, NotChecked=164, Total=600 [2023-02-17 07:52:00,676 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) 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-17 07:52:00,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:52:00,859 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2023-02-17 07:52:00,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 07:52:00,860 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) 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-17 07:52:00,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:52:00,860 INFO L225 Difference]: With dead ends: 43 [2023-02-17 07:52:00,860 INFO L226 Difference]: Without dead ends: 38 [2023-02-17 07:52:00,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 26.4s TimeCoverageRelationStatistics Valid=101, Invalid=460, Unknown=7, NotChecked=188, Total=756 [2023-02-17 07:52:00,861 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:52:00,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 125 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 246 Invalid, 0 Unknown, 41 Unchecked, 0.1s Time] [2023-02-17 07:52:00,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-17 07:52:00,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-02-17 07:52:00,866 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-17 07:52:00,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2023-02-17 07:52:00,867 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 50 [2023-02-17 07:52:00,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:52:00,867 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2023-02-17 07:52:00,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) 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-17 07:52:00,868 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2023-02-17 07:52:00,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-17 07:52:00,868 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:52:00,868 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:52:00,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-17 07:52:01,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-02-17 07:52:01,076 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:52:01,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:52:01,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1898941279, now seen corresponding path program 6 times [2023-02-17 07:52:01,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:52:01,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521541349] [2023-02-17 07:52:01,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:52:01,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:52:01,091 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:52:01,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [771734109] [2023-02-17 07:52:01,092 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-17 07:52:01,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:52:01,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:52:01,093 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 07:52:01,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-17 07:52:01,192 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-02-17 07:52:01,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:52:01,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-17 07:52:01,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:52:01,550 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-17 07:52:01,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:52:03,586 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-17 07:52:07,602 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_26| Int)) (or (= 0 (+ (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47|) (- (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47|)))) (= (mod (+ (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47|) (* 2 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47|) (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47|)) 4) 0))) (not (= |c___VERIFIER_assert_#in~cond| 0))) is different from true [2023-02-17 07:52:13,615 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_26| Int)) (or (= 0 (+ (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47|) (- (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47|)))) (= (mod (+ (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47|) (* 2 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47|) (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47|)) 4) 0))) (= 0 c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| 0))) is different from true [2023-02-17 07:52:17,625 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-17 07:52:17,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:52:17,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521541349] [2023-02-17 07:52:17,629 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:52:17,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771734109] [2023-02-17 07:52:17,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771734109] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:52:17,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 07:52:17,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2023-02-17 07:52:17,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325965998] [2023-02-17 07:52:17,630 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 07:52:17,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 07:52:17,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:52:17,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 07:52:17,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=237, Unknown=4, NotChecked=132, Total=420 [2023-02-17 07:52:17,631 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-17 07:52:17,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:52:17,821 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2023-02-17 07:52:17,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 07:52:17,821 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-17 07:52:17,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:52:17,822 INFO L225 Difference]: With dead ends: 50 [2023-02-17 07:52:17,822 INFO L226 Difference]: Without dead ends: 45 [2023-02-17 07:52:17,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=66, Invalid=326, Unknown=4, NotChecked=156, Total=552 [2023-02-17 07:52:17,823 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 07:52:17,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 151 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 07:52:17,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-02-17 07:52:17,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-02-17 07:52:17,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-17 07:52:17,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2023-02-17 07:52:17,830 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 57 [2023-02-17 07:52:17,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:52:17,830 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2023-02-17 07:52:17,830 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-17 07:52:17,831 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2023-02-17 07:52:17,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-17 07:52:17,831 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:52:17,831 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:52:17,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-17 07:52:18,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:52:18,040 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:52:18,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:52:18,040 INFO L85 PathProgramCache]: Analyzing trace with hash 385378200, now seen corresponding path program 7 times [2023-02-17 07:52:18,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:52:18,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959899384] [2023-02-17 07:52:18,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:52:18,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:52:18,052 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:52:18,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1601572570] [2023-02-17 07:52:18,052 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-17 07:52:18,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:52:18,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:52:18,053 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 07:52:18,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-17 07:52:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:52:18,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-17 07:52:18,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:52:18,236 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-17 07:52:18,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:52:20,273 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-17 07:52:24,289 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_57| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_29| Int)) (or (= 0 (+ (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_29| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_57|) (- (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_57| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_57|)))) (= (mod (+ (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_57| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_57| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_57| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_57|) (* 2 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_57| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_57| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_57|) (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_57| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_57|)) 4) 0)))) is different from true [2023-02-17 07:52:30,313 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_~y~0#1_BEFORE_CALL_57| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_29| Int)) (or (= 0 (+ (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_29| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_57|) (- (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_57| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_57|)))) (= (mod (+ (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_57| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_57| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_57| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_57|) (* 2 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_57| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_57| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_57|) (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_57| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_57|)) 4) 0)))) is different from true [2023-02-17 07:52:34,325 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-17 07:52:34,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:52:34,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959899384] [2023-02-17 07:52:34,329 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:52:34,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601572570] [2023-02-17 07:52:34,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601572570] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:52:34,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 07:52:34,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2023-02-17 07:52:34,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643892208] [2023-02-17 07:52:34,330 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 07:52:34,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-17 07:52:34,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:52:34,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-17 07:52:34,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=269, Unknown=4, NotChecked=140, Total=462 [2023-02-17 07:52:34,331 INFO L87 Difference]: Start difference. First operand 45 states and 50 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-17 07:52:34,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:52:34,523 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2023-02-17 07:52:34,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 07:52:34,523 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-17 07:52:34,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:52:34,523 INFO L225 Difference]: With dead ends: 53 [2023-02-17 07:52:34,524 INFO L226 Difference]: Without dead ends: 48 [2023-02-17 07:52:34,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=68, Invalid=364, Unknown=4, NotChecked=164, Total=600 [2023-02-17 07:52:34,524 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-17 07:52:34,524 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-17 07:52:34,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-02-17 07:52:34,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-02-17 07:52:34,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-17 07:52:34,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2023-02-17 07:52:34,539 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 64 [2023-02-17 07:52:34,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:52:34,539 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2023-02-17 07:52:34,539 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-17 07:52:34,539 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2023-02-17 07:52:34,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-17 07:52:34,544 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:52:34,544 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:52:34,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-17 07:52:34,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-17 07:52:34,749 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:52:34,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:52:34,749 INFO L85 PathProgramCache]: Analyzing trace with hash 2073985217, now seen corresponding path program 8 times [2023-02-17 07:52:34,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:52:34,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284002334] [2023-02-17 07:52:34,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:52:34,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:52:34,757 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:52:34,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1137137327] [2023-02-17 07:52:34,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 07:52:34,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:52:34,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:52:34,762 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-17 07:52:34,764 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-17 07:52:34,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 07:52:34,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:52:34,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-17 07:52:34,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:52:36,842 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 1 1))) (and (= |c_ULTIMATE.start_main_~c~0#1| .cse0) (= |c_ULTIMATE.start_main_~y~0#1| .cse0) (= (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-17 07:52:38,917 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 23 proven. 119 refuted. 0 times theorem prover too weak. 120 trivial. 8 not checked. [2023-02-17 07:52:38,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:52:41,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:52:41,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284002334] [2023-02-17 07:52:41,004 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:52:41,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137137327] [2023-02-17 07:52:41,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137137327] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:52:41,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 07:52:41,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2023-02-17 07:52:41,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086577681] [2023-02-17 07:52:41,004 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 07:52:41,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-17 07:52:41,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:52:41,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-17 07:52:41,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=326, Unknown=3, NotChecked=36, Total=420 [2023-02-17 07:52:41,006 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 17 states, 16 states have (on average 1.9375) 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-17 07:52:45,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 07:52:47,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 07:52:49,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 07:52:51,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 07:52:51,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:52:51,278 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2023-02-17 07:52:51,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-17 07:52:51,278 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.9375) 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-17 07:52:51,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:52:51,280 INFO L225 Difference]: With dead ends: 56 [2023-02-17 07:52:51,280 INFO L226 Difference]: Without dead ends: 51 [2023-02-17 07:52:51,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=74, Invalid=433, Unknown=3, NotChecked=42, Total=552 [2023-02-17 07:52:51,281 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2023-02-17 07:52:51,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 214 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 466 Invalid, 4 Unknown, 50 Unchecked, 8.2s Time] [2023-02-17 07:52:51,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-17 07:52:51,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-02-17 07:52:51,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 07:52:51,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2023-02-17 07:52:51,288 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 71 [2023-02-17 07:52:51,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:52:51,288 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2023-02-17 07:52:51,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.9375) 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-17 07:52:51,289 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2023-02-17 07:52:51,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-02-17 07:52:51,289 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:52:51,290 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:52:51,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-02-17 07:52:51,511 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-17 07:52:51,511 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:52:51,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:52:51,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1353348984, now seen corresponding path program 9 times [2023-02-17 07:52:51,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:52:51,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120954840] [2023-02-17 07:52:51,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:52:51,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:52:51,516 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:52:51,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1857037247] [2023-02-17 07:52:51,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 07:52:51,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:52:51,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:52:51,524 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-17 07:52:51,524 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-17 07:52:51,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2023-02-17 07:52:51,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:52:51,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-17 07:52:51,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:52:51,716 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 28 proven. 154 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-17 07:52:51,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:52:51,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:52:51,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120954840] [2023-02-17 07:52:51,790 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:52:51,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857037247] [2023-02-17 07:52:51,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857037247] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:52:51,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 07:52:51,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2023-02-17 07:52:51,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831331512] [2023-02-17 07:52:51,791 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 07:52:51,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-17 07:52:51,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:52:51,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-17 07:52:51,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2023-02-17 07:52:51,792 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 17 states, 16 states have (on average 2.0625) 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-17 07:52:52,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:52:52,088 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2023-02-17 07:52:52,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-17 07:52:52,088 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0625) 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-17 07:52:52,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:52:52,089 INFO L225 Difference]: With dead ends: 59 [2023-02-17 07:52:52,089 INFO L226 Difference]: Without dead ends: 54 [2023-02-17 07:52:52,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2023-02-17 07:52:52,089 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 07:52:52,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 229 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 07:52:52,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-02-17 07:52:52,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-02-17 07:52:52,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-17 07:52:52,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2023-02-17 07:52:52,098 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 78 [2023-02-17 07:52:52,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:52:52,098 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2023-02-17 07:52:52,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) 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-17 07:52:52,098 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2023-02-17 07:52:52,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-02-17 07:52:52,099 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:52:52,099 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:52:52,108 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-17 07:52:52,303 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-17 07:52:52,304 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:52:52,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:52:52,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1817498849, now seen corresponding path program 10 times [2023-02-17 07:52:52,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:52:52,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693002849] [2023-02-17 07:52:52,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:52:52,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:52:52,309 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:52:52,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [123294891] [2023-02-17 07:52:52,310 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 07:52:52,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:52:52,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:52:52,325 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-17 07:52:52,326 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-17 07:52:52,374 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 07:52:52,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:52:52,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 56 conjunts are in the unsatisfiable core [2023-02-17 07:52:52,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:52:52,557 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 51 proven. 166 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-17 07:52:52,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:52:54,613 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-17 07:52:58,628 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_93| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_38| Int)) (or (= 0 (+ (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_93|) (- (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_93| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_93|)))) (= (mod (+ (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_93| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_93| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_93| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_93|) (* 2 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_93| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_93| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_93|) (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_93| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_93|)) 4) 0))) (not (= |c___VERIFIER_assert_#in~cond| 0))) is different from true [2023-02-17 07:53:04,644 WARN L859 $PredicateComparison]: unable to prove that (or (= 0 c___VERIFIER_assert_~cond) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_93| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_38| Int)) (or (= 0 (+ (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_93|) (- (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_93| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_93|)))) (= (mod (+ (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_93| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_93| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_93| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_93|) (* 2 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_93| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_93| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_93|) (* 3 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_93| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_93|)) 4) 0))) (not (= |c___VERIFIER_assert_#in~cond| 0))) is different from true [2023-02-17 07:53:08,655 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-17 07:53:08,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:53:08,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693002849] [2023-02-17 07:53:08,659 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:53:08,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123294891] [2023-02-17 07:53:08,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123294891] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:53:08,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 07:53:08,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2023-02-17 07:53:08,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336709038] [2023-02-17 07:53:08,659 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 07:53:08,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-17 07:53:08,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:53:08,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-17 07:53:08,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=377, Unknown=4, NotChecked=164, Total=600 [2023-02-17 07:53:08,660 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 18 states, 17 states have (on average 2.0588235294117645) 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-17 07:53:09,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:53:09,024 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2023-02-17 07:53:09,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-17 07:53:09,024 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0588235294117645) 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-17 07:53:09,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:53:09,025 INFO L225 Difference]: With dead ends: 62 [2023-02-17 07:53:09,025 INFO L226 Difference]: Without dead ends: 57 [2023-02-17 07:53:09,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=74, Invalid=490, Unknown=4, NotChecked=188, Total=756 [2023-02-17 07:53:09,026 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 07:53:09,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 276 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 07:53:09,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-17 07:53:09,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-02-17 07:53:09,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-02-17 07:53:09,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2023-02-17 07:53:09,034 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 85 [2023-02-17 07:53:09,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:53:09,034 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2023-02-17 07:53:09,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0588235294117645) 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-17 07:53:09,035 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2023-02-17 07:53:09,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-02-17 07:53:09,035 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:53:09,035 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:53:09,040 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-17 07:53:09,236 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-17 07:53:09,236 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:53:09,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:53:09,236 INFO L85 PathProgramCache]: Analyzing trace with hash 638795608, now seen corresponding path program 11 times [2023-02-17 07:53:09,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:53:09,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736135190] [2023-02-17 07:53:09,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:53:09,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:53:09,241 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 07:53:09,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1495325764] [2023-02-17 07:53:09,242 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-17 07:53:09,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:53:09,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:53:09,243 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-17 07:53:09,244 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-17 07:53:09,362 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2023-02-17 07:53:09,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:53:09,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 07:53:09,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:53:09,440 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2023-02-17 07:53:09,441 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 07:53:09,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:53:09,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736135190] [2023-02-17 07:53:09,441 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 07:53:09,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495325764] [2023-02-17 07:53:09,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495325764] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 07:53:09,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 07:53:09,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-02-17 07:53:09,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576935882] [2023-02-17 07:53:09,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 07:53:09,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-17 07:53:09,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:53:09,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-17 07:53:09,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2023-02-17 07:53:09,443 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 12 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-17 07:53:09,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:53:09,537 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2023-02-17 07:53:09,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 07:53:09,537 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 12 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-17 07:53:09,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:53:09,537 INFO L225 Difference]: With dead ends: 61 [2023-02-17 07:53:09,537 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 07:53:09,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2023-02-17 07:53:09,538 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 07:53:09,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 87 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 07:53:09,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 07:53:09,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 07:53:09,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 07:53:09,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 07:53:09,539 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2023-02-17 07:53:09,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:53:09,539 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 07:53:09,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 12 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-17 07:53:09,539 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 07:53:09,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 07:53:09,541 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 07:53:09,547 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-17 07:53:09,744 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-17 07:53:09,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 07:53:09,754 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 07:53:09,754 INFO L895 garLoopResultBuilder]: At program point L27-2(lines 27 36) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_main_~c~0#1| (- 1)))) (let ((.cse11 (+ .cse4 (- 1)))) (let ((.cse10 (+ .cse11 (- 1)))) (let ((.cse23 (+ .cse10 (- 1))) (.cse7 (+ |ULTIMATE.start_main_~y~0#1| (- 1)))) (let ((.cse15 (+ 1 2)) (.cse8 (+ .cse7 (- 1))) (.cse21 (+ 1 3)) (.cse25 (+ .cse23 (- 1))) (.cse14 (+ 1 1)) (.cse34 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (.cse33 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse32 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse1 (+ 1 0)) (.cse0 (* .cse32 |ULTIMATE.start_main_~y~0#1|)) (.cse30 (or .cse34 .cse33)) (.cse6 (<= |ULTIMATE.start_main_~k~0#1| 10)) (.cse3 (>= |ULTIMATE.start_main_~k~0#1| 0)) (.cse12 (+ 1 .cse14)) (.cse29 (+ .cse25 (- 1))) (.cse28 (+ 1 6)) (.cse22 (+ 1 .cse21)) (.cse26 (+ .cse8 (- 1))) (.cse31 (+ 1 .cse15))) (let ((.cse19 (+ 1 .cse31)) (.cse17 (+ .cse26 (- 1))) (.cse20 (+ 1 4)) (.cse27 (+ 1 .cse22)) (.cse16 (+ 1 .cse28)) (.cse9 (+ 1 7)) (.cse18 (+ .cse29 (- 1))) (.cse24 (+ 1 .cse12)) (.cse2 (or (and .cse3 .cse6 .cse33) (and (or (not .cse6) (not .cse3)) .cse34))) (.cse5 (or (and (= |ULTIMATE.start_main_~y~0#1| .cse1) (= (+ |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) .cse30) (and (= 0 (+ (+ (+ (* 4 |ULTIMATE.start_main_~x~0#1|) (- (* .cse0 |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|))) (- .cse32))) .cse30))) (.cse13 (< (+ 1 (- 1)) |ULTIMATE.start_main_~k~0#1|))) (or (and (= |ULTIMATE.start_main_~x~0#1| (+ .cse0 0)) (= |ULTIMATE.start_main_~c~0#1| .cse1) .cse2 .cse3 (<= 0 .cse4) .cse5 (<= |ULTIMATE.start_main_~c~0#1| .cse1) .cse6 (= .cse7 0) (= .cse4 0) (< 0 |ULTIMATE.start_main_~k~0#1|) (< .cse4 |ULTIMATE.start_main_~k~0#1|)) (and (<= |ULTIMATE.start_main_~c~0#1| (+ 1 9)) (<= 9 .cse4) .cse3 .cse2 (= .cse8 .cse9) .cse5 .cse6 (< 9 |ULTIMATE.start_main_~k~0#1|)) (and (= .cse10 0) (= .cse11 .cse1) (<= 2 .cse4) (<= |ULTIMATE.start_main_~c~0#1| .cse12) (= |ULTIMATE.start_main_~y~0#1| .cse12) .cse2 .cse3 .cse5 (= (mod (+ (* 3 |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|) (* 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) .cse13 (= .cse7 .cse14) (= |ULTIMATE.start_main_~c~0#1| .cse15) (= |ULTIMATE.start_main_~c~0#1| .cse12) (< .cse14 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| .cse15) .cse6) (and (= |ULTIMATE.start_main_~c~0#1| .cse16) .cse3 .cse2 (= |ULTIMATE.start_main_~y~0#1| .cse9) .cse5 (= (+ .cse17 (- 1)) .cse12) (<= |ULTIMATE.start_main_~c~0#1| .cse9) .cse6 (< 7 |ULTIMATE.start_main_~k~0#1|) (<= 7 .cse4) (= .cse18 .cse1)) (and (= |ULTIMATE.start_main_~c~0#1| .cse19) (= |ULTIMATE.start_main_~c~0#1| .cse20) (= .cse7 .cse21) .cse2 (<= 4 .cse4) .cse3 .cse5 (= |ULTIMATE.start_main_~y~0#1| .cse22) (= .cse8 .cse12) (= .cse23 .cse1) (= |ULTIMATE.start_main_~y~0#1| .cse20) .cse13 (< .cse24 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| (+ 1 .cse24)) .cse6 (= .cse25 0)) (and (= |ULTIMATE.start_main_~y~0#1| .cse14) (<= |ULTIMATE.start_main_~c~0#1| .cse14) (= .cse4 .cse1) .cse2 .cse3 .cse5 (= .cse11 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (= .cse8 0) .cse13 (<= 1 .cse4) (= |ULTIMATE.start_main_~c~0#1| .cse14) (= |ULTIMATE.start_main_~x~0#1| (+ .cse0 (+ (* (* 1 1) 1) 0))) .cse6) (and (= .cse4 .cse20) (= .cse4 .cse19) .cse3 .cse2 .cse5 (= .cse7 .cse20) (= .cse25 .cse1) (<= 5 .cse4) (= .cse26 .cse12) (= .cse7 .cse22) (< 5 |ULTIMATE.start_main_~k~0#1|) (= .cse8 .cse21) .cse6 (<= |ULTIMATE.start_main_~c~0#1| (+ 1 5)) (= |ULTIMATE.start_main_~y~0#1| .cse27)) (and (<= |ULTIMATE.start_main_~c~0#1| .cse28) (= .cse29 .cse1) .cse2 .cse3 (= .cse26 .cse21) (= .cse17 .cse12) .cse5 (<= 6 .cse4) (= |ULTIMATE.start_main_~c~0#1| .cse28) (< 6 |ULTIMATE.start_main_~k~0#1|) (= .cse11 .cse20) .cse6 (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse27)) (= .cse8 .cse22)) (and (<= 8 .cse4) (= |ULTIMATE.start_main_~y~0#1| (+ 1 8)) (<= |ULTIMATE.start_main_~c~0#1| (+ 1 .cse16)) .cse2 .cse3 .cse5 (< .cse16 |ULTIMATE.start_main_~k~0#1|) (= .cse7 .cse9) .cse6 (= (+ .cse18 (- 1)) .cse1)) (and .cse2 .cse3 (= |ULTIMATE.start_main_~x~0#1| 0) .cse30 (>= |ULTIMATE.start_main_~c~0#1| 0) .cse6 (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~c~0#1| 0)) (and (= |ULTIMATE.start_main_~c~0#1| .cse24) (< .cse15 |ULTIMATE.start_main_~k~0#1|) (= .cse23 0) (= |ULTIMATE.start_main_~y~0#1| .cse21) .cse2 .cse3 .cse5 (= .cse10 .cse1) (= .cse4 .cse15) .cse13 (= .cse7 .cse12) (= .cse4 .cse12) (<= 3 .cse4) (<= |ULTIMATE.start_main_~c~0#1| .cse31) (= |ULTIMATE.start_main_~c~0#1| .cse31) .cse6))))))))) [2023-02-17 07:53:09,755 INFO L895 garLoopResultBuilder]: At program point L27-3(lines 27 36) the Hoare annotation is: (let ((.cse12 (+ 1 0)) (.cse11 (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))) (.cse10 (+ 1 1))) (let ((.cse2 (+ 1 4)) (.cse9 (+ 1 .cse10)) (.cse3 (+ 1 2)) (.cse7 (+ 1 7)) (.cse6 (+ 1 6)) (.cse4 (+ 1 3)) (.cse0 (or (and (= |ULTIMATE.start_main_~y~0#1| .cse12) (= (+ |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) .cse11) (and (= 0 (let ((.cse13 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (+ (+ (* 4 |ULTIMATE.start_main_~x~0#1|) (- (* (* .cse13 |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|))) (- .cse13)))) .cse11))) (.cse1 (+ |ULTIMATE.start_main_~y~0#1| (- 1)))) (or (and (<= |ULTIMATE.start_main_~k~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|) .cse0 (= .cse1 .cse2) (<= |ULTIMATE.start_main_~c~0#1| (+ 1 5))) (and (< .cse3 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| .cse4) (<= |ULTIMATE.start_main_~c~0#1| (+ 1 .cse3)) (<= |ULTIMATE.start_main_~k~0#1| 4) .cse0) (let ((.cse5 (+ 1 .cse6))) (and (= |ULTIMATE.start_main_~y~0#1| (+ 1 8)) (<= |ULTIMATE.start_main_~c~0#1| (+ 1 .cse5)) .cse0 (< .cse5 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 9))) (and (<= |ULTIMATE.start_main_~c~0#1| (+ 1 9)) (= (+ .cse1 (- 1)) .cse7) .cse0 (<= |ULTIMATE.start_main_~k~0#1| 10) (< 9 |ULTIMATE.start_main_~k~0#1|)) (let ((.cse8 (+ 1 .cse9))) (and (< .cse8 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5) .cse0 (<= |ULTIMATE.start_main_~c~0#1| (+ 1 .cse8)) (= |ULTIMATE.start_main_~y~0#1| .cse2) (< (+ 1 (- 1)) |ULTIMATE.start_main_~k~0#1|))) (and (<= |ULTIMATE.start_main_~c~0#1| .cse9) (<= |ULTIMATE.start_main_~k~0#1| 3) .cse0 (< .cse10 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| .cse3)) (and (= |ULTIMATE.start_main_~x~0#1| 0) .cse11 (= |ULTIMATE.start_main_~y~0#1| 0)) (and (= |ULTIMATE.start_main_~y~0#1| .cse7) .cse0 (<= |ULTIMATE.start_main_~c~0#1| .cse7) (< 7 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 8)) (and (<= |ULTIMATE.start_main_~c~0#1| .cse6) (< 6 |ULTIMATE.start_main_~k~0#1|) .cse0 (<= |ULTIMATE.start_main_~k~0#1| 7) (= |ULTIMATE.start_main_~y~0#1| (+ 1 (+ 1 (+ 1 .cse4))))) (and (= |ULTIMATE.start_main_~y~0#1| .cse10) (<= |ULTIMATE.start_main_~c~0#1| .cse10) .cse0 (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|)) (and .cse0 (<= |ULTIMATE.start_main_~k~0#1| 1) (<= |ULTIMATE.start_main_~c~0#1| .cse12) (= .cse1 0) (< 0 |ULTIMATE.start_main_~k~0#1|))))) [2023-02-17 07:53:09,755 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 07:53:09,755 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 17 40) the Hoare annotation is: true [2023-02-17 07:53:09,755 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2023-02-17 07:53:09,755 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2023-02-17 07:53:09,755 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 07:53:09,755 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 07:53:09,755 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~c~0#1| (- 1)))) (let ((.cse8 (+ .cse0 (- 1)))) (let ((.cse7 (+ .cse8 (- 1)))) (let ((.cse23 (+ .cse7 (- 1))) (.cse12 (+ |ULTIMATE.start_main_~y~0#1| (- 1)))) (let ((.cse14 (+ 1 2)) (.cse3 (+ .cse12 (- 1))) (.cse21 (+ 1 3)) (.cse25 (+ .cse23 (- 1))) (.cse13 (+ 1 1)) (.cse34 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (.cse33 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse32 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse9 (+ 1 0)) (.cse15 (* .cse32 |ULTIMATE.start_main_~y~0#1|)) (.cse30 (or .cse34 .cse33)) (.cse6 (<= |ULTIMATE.start_main_~k~0#1| 10)) (.cse1 (>= |ULTIMATE.start_main_~k~0#1| 0)) (.cse10 (+ 1 .cse13)) (.cse29 (+ .cse25 (- 1))) (.cse28 (+ 1 6)) (.cse22 (+ 1 .cse21)) (.cse26 (+ .cse3 (- 1))) (.cse31 (+ 1 .cse14))) (let ((.cse19 (+ 1 .cse31)) (.cse17 (+ .cse26 (- 1))) (.cse20 (+ 1 4)) (.cse27 (+ 1 .cse22)) (.cse16 (+ 1 .cse28)) (.cse4 (+ 1 7)) (.cse18 (+ .cse29 (- 1))) (.cse24 (+ 1 .cse10)) (.cse2 (or (and .cse1 .cse6 .cse33) (and (or (not .cse6) (not .cse1)) .cse34))) (.cse5 (or (and (= |ULTIMATE.start_main_~y~0#1| .cse9) (= (+ |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) .cse30) (and (= 0 (+ (+ (+ (* 4 |ULTIMATE.start_main_~x~0#1|) (- (* .cse15 |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|))) (- .cse32))) .cse30))) (.cse11 (< (+ 1 (- 1)) |ULTIMATE.start_main_~k~0#1|))) (or (and (<= |ULTIMATE.start_main_~c~0#1| (+ 1 9)) (<= 9 .cse0) .cse1 .cse2 (= .cse3 .cse4) .cse5 .cse6 (< 9 |ULTIMATE.start_main_~k~0#1|)) (and (= .cse7 0) (= .cse8 .cse9) (<= 2 .cse0) (<= |ULTIMATE.start_main_~c~0#1| .cse10) (= |ULTIMATE.start_main_~y~0#1| .cse10) .cse2 .cse1 .cse5 (= (mod (+ (* 3 |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|) (* 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) .cse11 (= .cse12 .cse13) (= |ULTIMATE.start_main_~c~0#1| .cse14) (= |ULTIMATE.start_main_~c~0#1| .cse10) (< .cse13 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| .cse14) .cse6) (and (= |ULTIMATE.start_main_~x~0#1| (+ .cse15 0)) (= |ULTIMATE.start_main_~c~0#1| .cse9) .cse2 .cse1 (<= 0 .cse0) .cse5 (<= |ULTIMATE.start_main_~c~0#1| .cse9) .cse6 (= .cse12 0) (= .cse0 0) (< 0 |ULTIMATE.start_main_~k~0#1|) (< .cse0 |ULTIMATE.start_main_~k~0#1|)) (and (= |ULTIMATE.start_main_~c~0#1| .cse16) .cse1 .cse2 (= |ULTIMATE.start_main_~y~0#1| .cse4) .cse5 (= (+ .cse17 (- 1)) .cse10) (<= |ULTIMATE.start_main_~c~0#1| .cse4) .cse6 (< 7 |ULTIMATE.start_main_~k~0#1|) (<= 7 .cse0) (= .cse18 .cse9)) (and (= |ULTIMATE.start_main_~y~0#1| .cse13) (<= |ULTIMATE.start_main_~c~0#1| .cse13) (= .cse0 .cse9) .cse2 .cse1 .cse5 (= .cse8 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (= .cse3 0) .cse11 (<= 1 .cse0) (= |ULTIMATE.start_main_~c~0#1| .cse13) (= |ULTIMATE.start_main_~x~0#1| (+ .cse15 (+ (* (* 1 1) 1) 0))) .cse6) (and (= |ULTIMATE.start_main_~c~0#1| .cse19) (= |ULTIMATE.start_main_~c~0#1| .cse20) (= .cse12 .cse21) .cse2 (<= 4 .cse0) .cse1 .cse5 (= |ULTIMATE.start_main_~y~0#1| .cse22) (= .cse3 .cse10) (= .cse23 .cse9) (= |ULTIMATE.start_main_~y~0#1| .cse20) .cse11 (< .cse24 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| (+ 1 .cse24)) .cse6 (= .cse25 0)) (and (= .cse0 .cse20) (= .cse0 .cse19) .cse1 .cse2 .cse5 (= .cse12 .cse20) (= .cse25 .cse9) (<= 5 .cse0) (= .cse26 .cse10) (= .cse12 .cse22) (< 5 |ULTIMATE.start_main_~k~0#1|) (= .cse3 .cse21) .cse6 (<= |ULTIMATE.start_main_~c~0#1| (+ 1 5)) (= |ULTIMATE.start_main_~y~0#1| .cse27)) (and (<= |ULTIMATE.start_main_~c~0#1| .cse28) (= .cse29 .cse9) .cse2 .cse1 (= .cse26 .cse21) (= .cse17 .cse10) .cse5 (<= 6 .cse0) (= |ULTIMATE.start_main_~c~0#1| .cse28) (< 6 |ULTIMATE.start_main_~k~0#1|) (= .cse8 .cse20) .cse6 (= |ULTIMATE.start_main_~y~0#1| (+ 1 .cse27)) (= .cse3 .cse22)) (and (<= 8 .cse0) (= |ULTIMATE.start_main_~y~0#1| (+ 1 8)) (<= |ULTIMATE.start_main_~c~0#1| (+ 1 .cse16)) .cse2 .cse1 .cse5 (< .cse16 |ULTIMATE.start_main_~k~0#1|) (= .cse12 .cse4) .cse6 (= (+ .cse18 (- 1)) .cse9)) (and .cse2 .cse1 (= |ULTIMATE.start_main_~x~0#1| 0) .cse30 (>= |ULTIMATE.start_main_~c~0#1| 0) .cse6 (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~c~0#1| 0)) (and (= |ULTIMATE.start_main_~c~0#1| .cse24) (< .cse14 |ULTIMATE.start_main_~k~0#1|) (= .cse23 0) (= |ULTIMATE.start_main_~y~0#1| .cse21) .cse2 .cse1 .cse5 (= .cse7 .cse9) (= .cse0 .cse14) .cse11 (= .cse12 .cse10) (= .cse0 .cse10) (<= 3 .cse0) (<= |ULTIMATE.start_main_~c~0#1| .cse31) (= |ULTIMATE.start_main_~c~0#1| .cse31) .cse6))))))))) [2023-02-17 07:53:09,755 INFO L899 garLoopResultBuilder]: For program point L28-1(lines 27 36) no Hoare annotation was computed. [2023-02-17 07:53:09,755 INFO L899 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2023-02-17 07:53:09,755 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse0 (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)))) (or (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) .cse0) (and (= 0 (let ((.cse1 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (+ (+ (* 4 |ULTIMATE.start_main_~x~0#1|) (- (* (* .cse1 |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|))) (- .cse1)))) .cse0) (and (= |ULTIMATE.start_main_~x~0#1| 0) .cse0 (= |ULTIMATE.start_main_~y~0#1| 0)))) [2023-02-17 07:53:09,755 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2023-02-17 07:53:09,756 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2023-02-17 07:53:09,756 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2023-02-17 07:53:09,756 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 9 15) the Hoare annotation is: true [2023-02-17 07:53:09,756 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2023-02-17 07:53:09,756 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2023-02-17 07:53:09,758 INFO L445 BasicCegarLoop]: Path program histogram: [11, 1, 1, 1] [2023-02-17 07:53:09,759 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 07:53:09,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 07:53:09 BoogieIcfgContainer [2023-02-17 07:53:09,808 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 07:53:09,809 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 07:53:09,809 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 07:53:09,809 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 07:53:09,809 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 07:50:12" (3/4) ... [2023-02-17 07:53:09,811 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 07:53:09,815 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-17 07:53:09,817 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2023-02-17 07:53:09,817 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-17 07:53:09,817 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-17 07:53:09,817 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 07:53:09,842 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 07:53:09,842 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 07:53:09,843 INFO L158 Benchmark]: Toolchain (without parser) took 177786.66ms. Allocated memory was 151.0MB in the beginning and 184.5MB in the end (delta: 33.6MB). Free memory was 114.8MB in the beginning and 152.3MB in the end (delta: -37.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 07:53:09,843 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 121.6MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 07:53:09,843 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.86ms. Allocated memory is still 151.0MB. Free memory was 114.2MB in the beginning and 121.5MB in the end (delta: -7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-17 07:53:09,844 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.32ms. Allocated memory is still 151.0MB. Free memory was 120.8MB in the beginning and 119.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 07:53:09,844 INFO L158 Benchmark]: Boogie Preprocessor took 15.83ms. Allocated memory is still 151.0MB. Free memory was 119.4MB in the beginning and 118.7MB in the end (delta: 680.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 07:53:09,844 INFO L158 Benchmark]: RCFGBuilder took 166.12ms. Allocated memory is still 151.0MB. Free memory was 118.7MB in the beginning and 108.9MB in the end (delta: 9.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-17 07:53:09,844 INFO L158 Benchmark]: TraceAbstraction took 177358.57ms. Allocated memory was 151.0MB in the beginning and 184.5MB in the end (delta: 33.6MB). Free memory was 108.2MB in the beginning and 154.4MB in the end (delta: -46.2MB). Peak memory consumption was 95.4MB. Max. memory is 16.1GB. [2023-02-17 07:53:09,845 INFO L158 Benchmark]: Witness Printer took 33.67ms. Allocated memory is still 184.5MB. Free memory was 154.4MB in the beginning and 152.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 07:53:09,846 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.17ms. Allocated memory is still 121.6MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.86ms. Allocated memory is still 151.0MB. Free memory was 114.2MB in the beginning and 121.5MB in the end (delta: -7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.32ms. Allocated memory is still 151.0MB. Free memory was 120.8MB in the beginning and 119.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 15.83ms. Allocated memory is still 151.0MB. Free memory was 119.4MB in the beginning and 118.7MB in the end (delta: 680.9kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 166.12ms. Allocated memory is still 151.0MB. Free memory was 118.7MB in the beginning and 108.9MB in the end (delta: 9.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 177358.57ms. Allocated memory was 151.0MB in the beginning and 184.5MB in the end (delta: 33.6MB). Free memory was 108.2MB in the beginning and 154.4MB in the end (delta: -46.2MB). Peak memory consumption was 95.4MB. Max. memory is 16.1GB. * Witness Printer took 33.67ms. Allocated memory is still 184.5MB. Free memory was 154.4MB in the beginning and 152.3MB in the end (delta: 2.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: 177.3s, OverallIterations: 14, TraceHistogramMax: 13, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 112 SdHoareTripleChecker+Valid, 9.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 105 mSDsluCounter, 1723 SdHoareTripleChecker+Invalid, 9.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 91 IncrementalHoareTripleChecker+Unchecked, 1428 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3390 IncrementalHoareTripleChecker+Invalid, 3521 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 295 mSDtfsCounter, 3390 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 868 GetRequests, 595 SyntacticMatches, 18 SemanticMatches, 255 ConstructedPredicates, 28 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 105.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=13, InterpolantAutomatonStates: 169, 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, 14 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 35 PreInvPairs, 72 NumberOfFragments, 4215 HoareAnnotationTreeSize, 35 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 160.8s InterpolantComputationTime, 670 NumberOfCodeBlocks, 666 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 662 ConstructedInterpolants, 0 QuantifiedInterpolants, 4593 SizeOfPredicates, 62 NumberOfNonLiveVariables, 1863 ConjunctsInSsa, 441 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 1439/2164 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: ((((((((((((((((((((x == y * y * y + 0 && c == 1 + 0) && (((k >= 0 && k <= 10) && cond == 1) || ((!(k <= 10) || !(k >= 0)) && cond == 0))) && k >= 0) && 0 <= c + -1) && (((y == 1 + 0 && x + -1 * y * y * y == 0) && (cond == 0 || cond == 1)) || (0 == 4 * x + -(y * y * y * y) + -(2 * y * y * y) + -(y * y) && (cond == 0 || cond == 1)))) && c <= 1 + 0) && k <= 10) && y + -1 == 0) && c + -1 == 0) && 0 < k) && c + -1 < k) || (((((((c <= 1 + 9 && 9 <= c + -1) && k >= 0) && (((k >= 0 && k <= 10) && cond == 1) || ((!(k <= 10) || !(k >= 0)) && cond == 0))) && y + -1 + -1 == 1 + 7) && (((y == 1 + 0 && x + -1 * y * y * y == 0) && (cond == 0 || cond == 1)) || (0 == 4 * x + -(y * y * y * y) + -(2 * y * y * y) + -(y * y) && (cond == 0 || cond == 1)))) && k <= 10) && 9 < k)) || (((((((((((((((c + -1 + -1 + -1 == 0 && c + -1 + -1 == 1 + 0) && 2 <= c + -1) && c <= 1 + (1 + 1)) && y == 1 + (1 + 1)) && (((k >= 0 && k <= 10) && cond == 1) || ((!(k <= 10) || !(k >= 0)) && cond == 0))) && k >= 0) && (((y == 1 + 0 && x + -1 * y * y * y == 0) && (cond == 0 || cond == 1)) || (0 == 4 * x + -(y * y * y * y) + -(2 * y * y * y) + -(y * y) && (cond == 0 || cond == 1)))) && (3 * y * y + 2 * y * y * y + 3 * y * y * y * y) % 4 == 0) && 1 + -1 < k) && y + -1 == 1 + 1) && c == 1 + 2) && c == 1 + (1 + 1)) && 1 + 1 < k) && y == 1 + 2) && k <= 10)) || ((((((((((c == 1 + (1 + 6) && k >= 0) && (((k >= 0 && k <= 10) && cond == 1) || ((!(k <= 10) || !(k >= 0)) && cond == 0))) && y == 1 + 7) && (((y == 1 + 0 && x + -1 * y * y * y == 0) && (cond == 0 || cond == 1)) || (0 == 4 * x + -(y * y * y * y) + -(2 * y * y * y) + -(y * y) && (cond == 0 || cond == 1)))) && y + -1 + -1 + -1 + -1 + -1 == 1 + (1 + 1)) && c <= 1 + 7) && k <= 10) && 7 < k) && 7 <= c + -1) && c + -1 + -1 + -1 + -1 + -1 + -1 + -1 == 1 + 0)) || (((((((((((((((c == 1 + (1 + (1 + 2)) && c == 1 + 4) && y + -1 == 1 + 3) && (((k >= 0 && k <= 10) && cond == 1) || ((!(k <= 10) || !(k >= 0)) && cond == 0))) && 4 <= c + -1) && k >= 0) && (((y == 1 + 0 && x + -1 * y * y * y == 0) && (cond == 0 || cond == 1)) || (0 == 4 * x + -(y * y * y * y) + -(2 * y * y * y) + -(y * y) && (cond == 0 || cond == 1)))) && y == 1 + (1 + 3)) && y + -1 + -1 == 1 + (1 + 1)) && c + -1 + -1 + -1 + -1 == 1 + 0) && y == 1 + 4) && 1 + -1 < k) && 1 + (1 + (1 + 1)) < k) && c <= 1 + (1 + (1 + (1 + 1)))) && k <= 10) && c + -1 + -1 + -1 + -1 + -1 == 0)) || (((((((((((((y == 1 + 1 && c <= 1 + 1) && c + -1 == 1 + 0) && (((k >= 0 && k <= 10) && cond == 1) || ((!(k <= 10) || !(k >= 0)) && cond == 0))) && k >= 0) && (((y == 1 + 0 && x + -1 * y * y * y == 0) && (cond == 0 || cond == 1)) || (0 == 4 * x + -(y * y * y * y) + -(2 * y * y * y) + -(y * y) && (cond == 0 || cond == 1)))) && c + -1 + -1 == 0) && 1 < k) && y + -1 + -1 == 0) && 1 + -1 < k) && 1 <= c + -1) && c == 1 + 1) && x == y * y * y + (1 * 1 * 1 + 0)) && k <= 10)) || ((((((((((((((c + -1 == 1 + 4 && c + -1 == 1 + (1 + (1 + 2))) && k >= 0) && (((k >= 0 && k <= 10) && cond == 1) || ((!(k <= 10) || !(k >= 0)) && cond == 0))) && (((y == 1 + 0 && x + -1 * y * y * y == 0) && (cond == 0 || cond == 1)) || (0 == 4 * x + -(y * y * y * y) + -(2 * y * y * y) + -(y * y) && (cond == 0 || cond == 1)))) && y + -1 == 1 + 4) && c + -1 + -1 + -1 + -1 + -1 == 1 + 0) && 5 <= c + -1) && y + -1 + -1 + -1 == 1 + (1 + 1)) && y + -1 == 1 + (1 + 3)) && 5 < k) && y + -1 + -1 == 1 + 3) && k <= 10) && c <= 1 + 5) && y == 1 + (1 + (1 + 3)))) || (((((((((((((c <= 1 + 6 && c + -1 + -1 + -1 + -1 + -1 + -1 == 1 + 0) && (((k >= 0 && k <= 10) && cond == 1) || ((!(k <= 10) || !(k >= 0)) && cond == 0))) && k >= 0) && y + -1 + -1 + -1 == 1 + 3) && y + -1 + -1 + -1 + -1 == 1 + (1 + 1)) && (((y == 1 + 0 && x + -1 * y * y * y == 0) && (cond == 0 || cond == 1)) || (0 == 4 * x + -(y * y * y * y) + -(2 * y * y * y) + -(y * y) && (cond == 0 || cond == 1)))) && 6 <= c + -1) && c == 1 + 6) && 6 < k) && c + -1 + -1 == 1 + 4) && k <= 10) && y == 1 + (1 + (1 + (1 + 3)))) && y + -1 + -1 == 1 + (1 + 3))) || (((((((((8 <= c + -1 && y == 1 + 8) && c <= 1 + (1 + (1 + 6))) && (((k >= 0 && k <= 10) && cond == 1) || ((!(k <= 10) || !(k >= 0)) && cond == 0))) && k >= 0) && (((y == 1 + 0 && x + -1 * y * y * y == 0) && (cond == 0 || cond == 1)) || (0 == 4 * x + -(y * y * y * y) + -(2 * y * y * y) + -(y * y) && (cond == 0 || cond == 1)))) && 1 + (1 + 6) < k) && y + -1 == 1 + 7) && k <= 10) && c + -1 + -1 + -1 + -1 + -1 + -1 + -1 + -1 == 1 + 0)) || ((((((((((k >= 0 && k <= 10) && cond == 1) || ((!(k <= 10) || !(k >= 0)) && cond == 0)) && k >= 0) && x == 0) && (cond == 0 || cond == 1)) && c >= 0) && k <= 10) && y == 0) && c == 0)) || (((((((((((((((c == 1 + (1 + (1 + 1)) && 1 + 2 < k) && c + -1 + -1 + -1 + -1 == 0) && y == 1 + 3) && (((k >= 0 && k <= 10) && cond == 1) || ((!(k <= 10) || !(k >= 0)) && cond == 0))) && k >= 0) && (((y == 1 + 0 && x + -1 * y * y * y == 0) && (cond == 0 || cond == 1)) || (0 == 4 * x + -(y * y * y * y) + -(2 * y * y * y) + -(y * y) && (cond == 0 || cond == 1)))) && c + -1 + -1 + -1 == 1 + 0) && c + -1 == 1 + 2) && 1 + -1 < k) && y + -1 == 1 + (1 + 1)) && c + -1 == 1 + (1 + 1)) && 3 <= c + -1) && c <= 1 + (1 + 2)) && c == 1 + (1 + 2)) && k <= 10) RESULT: Ultimate proved your program to be correct! [2023-02-17 07:53:09,879 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