./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dbc7fc96c6d4708331280184201322c719c7fb1504d84fafd0b9583653597d2e --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 02:31:18,743 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 02:31:18,744 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 02:31:18,784 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 02:31:18,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 02:31:18,794 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 02:31:18,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 02:31:18,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 02:31:18,802 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 02:31:18,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 02:31:18,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 02:31:18,805 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 02:31:18,807 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 02:31:18,809 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 02:31:18,813 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 02:31:18,815 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 02:31:18,817 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 02:31:18,822 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 02:31:18,823 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 02:31:18,824 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 02:31:18,827 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 02:31:18,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 02:31:18,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 02:31:18,831 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 02:31:18,833 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 02:31:18,839 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 02:31:18,840 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 02:31:18,841 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 02:31:18,842 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 02:31:18,843 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 02:31:18,844 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 02:31:18,845 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 02:31:18,846 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 02:31:18,847 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 02:31:18,849 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 02:31:18,849 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 02:31:18,850 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 02:31:18,850 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 02:31:18,850 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 02:31:18,852 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 02:31:18,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 02:31:18,856 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 02:31:18,895 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 02:31:18,895 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 02:31:18,896 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 02:31:18,896 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 02:31:18,897 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 02:31:18,897 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 02:31:18,898 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 02:31:18,898 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 02:31:18,898 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 02:31:18,899 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 02:31:18,900 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 02:31:18,900 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 02:31:18,900 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 02:31:18,900 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 02:31:18,900 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 02:31:18,900 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 02:31:18,901 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 02:31:18,901 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 02:31:18,901 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 02:31:18,901 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 02:31:18,901 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 02:31:18,902 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 02:31:18,902 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 02:31:18,902 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 02:31:18,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:31:18,902 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 02:31:18,902 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 02:31:18,903 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 02:31:18,903 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 02:31:18,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 02:31:18,904 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 02:31:18,904 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 02:31:18,904 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 02:31:18,904 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 02:31:18,904 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 02:31:18,905 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 -> dbc7fc96c6d4708331280184201322c719c7fb1504d84fafd0b9583653597d2e [2023-02-17 02:31:19,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 02:31:19,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 02:31:19,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 02:31:19,161 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 02:31:19,162 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 02:31:19,163 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound2.c [2023-02-17 02:31:20,099 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 02:31:20,278 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 02:31:20,279 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound2.c [2023-02-17 02:31:20,283 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a96f49b5/f9a46d110cea4d049b7823213b60cf2e/FLAG76ca73938 [2023-02-17 02:31:20,292 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a96f49b5/f9a46d110cea4d049b7823213b60cf2e [2023-02-17 02:31:20,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 02:31:20,294 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 02:31:20,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 02:31:20,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 02:31:20,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 02:31:20,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:31:20" (1/1) ... [2023-02-17 02:31:20,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68850f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:31:20, skipping insertion in model container [2023-02-17 02:31:20,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:31:20" (1/1) ... [2023-02-17 02:31:20,303 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 02:31:20,312 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 02:31:20,395 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/ps6-ll_valuebound2.c[458,471] [2023-02-17 02:31:20,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:31:20,411 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 02:31:20,419 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/ps6-ll_valuebound2.c[458,471] [2023-02-17 02:31:20,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:31:20,432 INFO L208 MainTranslator]: Completed translation [2023-02-17 02:31:20,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:31:20 WrapperNode [2023-02-17 02:31:20,432 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 02:31:20,433 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 02:31:20,433 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 02:31:20,433 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 02:31:20,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:31:20" (1/1) ... [2023-02-17 02:31:20,441 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:31:20" (1/1) ... [2023-02-17 02:31:20,452 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2023-02-17 02:31:20,452 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 02:31:20,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 02:31:20,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 02:31:20,453 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 02:31:20,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:31:20" (1/1) ... [2023-02-17 02:31:20,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:31:20" (1/1) ... [2023-02-17 02:31:20,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:31:20" (1/1) ... [2023-02-17 02:31:20,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:31:20" (1/1) ... [2023-02-17 02:31:20,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:31:20" (1/1) ... [2023-02-17 02:31:20,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:31:20" (1/1) ... [2023-02-17 02:31:20,464 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:31:20" (1/1) ... [2023-02-17 02:31:20,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:31:20" (1/1) ... [2023-02-17 02:31:20,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 02:31:20,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 02:31:20,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 02:31:20,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 02:31:20,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:31:20" (1/1) ... [2023-02-17 02:31:20,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:31:20,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:31:20,489 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 02:31:20,491 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 02:31:20,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 02:31:20,526 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-17 02:31:20,526 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-17 02:31:20,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 02:31:20,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 02:31:20,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 02:31:20,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-17 02:31:20,528 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-17 02:31:20,621 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 02:31:20,624 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 02:31:20,782 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 02:31:20,787 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 02:31:20,787 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-17 02:31:20,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:31:20 BoogieIcfgContainer [2023-02-17 02:31:20,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 02:31:20,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 02:31:20,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 02:31:20,794 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 02:31:20,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 02:31:20" (1/3) ... [2023-02-17 02:31:20,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d93335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:31:20, skipping insertion in model container [2023-02-17 02:31:20,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:31:20" (2/3) ... [2023-02-17 02:31:20,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d93335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:31:20, skipping insertion in model container [2023-02-17 02:31:20,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:31:20" (3/3) ... [2023-02-17 02:31:20,797 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound2.c [2023-02-17 02:31:20,811 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 02:31:20,812 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 02:31:20,868 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 02:31:20,876 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;@3c450c0e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 02:31:20,877 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 02:31:20,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-17 02:31:20,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 02:31:20,890 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:31:20,890 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:31:20,891 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:31:20,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:31:20,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1845349065, now seen corresponding path program 1 times [2023-02-17 02:31:20,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:31:20,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791698369] [2023-02-17 02:31:20,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:31:20,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:31:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:31:21,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:31:21,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791698369] [2023-02-17 02:31:21,022 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-17 02:31:21,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071494509] [2023-02-17 02:31:21,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:31:21,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:31:21,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:31:21,054 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 02:31:21,108 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 02:31:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:31:21,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-17 02:31:21,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:31:21,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 02:31:21,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:31:21,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071494509] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:31:21,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:31:21,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 02:31:21,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796144641] [2023-02-17 02:31:21,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:31:21,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 02:31:21,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:31:21,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 02:31:21,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 02:31:21,201 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 02:31:21,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:31:21,215 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2023-02-17 02:31:21,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 02:31:21,216 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-02-17 02:31:21,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:31:21,221 INFO L225 Difference]: With dead ends: 45 [2023-02-17 02:31:21,223 INFO L226 Difference]: Without dead ends: 20 [2023-02-17 02:31:21,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 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 02:31:21,230 INFO L413 NwaCegarLoop]: 27 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, 27 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 02:31:21,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:31:21,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-17 02:31:21,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-02-17 02:31:21,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 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 02:31:21,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2023-02-17 02:31:21,273 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 18 [2023-02-17 02:31:21,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:31:21,274 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-02-17 02:31:21,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 02:31:21,274 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2023-02-17 02:31:21,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 02:31:21,275 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:31:21,275 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:31:21,280 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 02:31:21,479 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 02:31:21,480 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:31:21,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:31:21,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1506842435, now seen corresponding path program 1 times [2023-02-17 02:31:21,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:31:21,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134296502] [2023-02-17 02:31:21,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:31:21,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:31:21,494 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:31:21,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1847241501] [2023-02-17 02:31:21,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:31:21,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:31:21,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:31:21,519 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 02:31:21,523 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 02:31:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:31:21,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 02:31:21,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:31:21,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 02:31:21,582 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:31:21,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:31:21,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134296502] [2023-02-17 02:31:21,582 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:31:21,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847241501] [2023-02-17 02:31:21,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847241501] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:31:21,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:31:21,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:31:21,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494611835] [2023-02-17 02:31:21,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:31:21,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:31:21,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:31:21,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:31:21,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:31:21,585 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 02:31:21,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:31:21,703 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2023-02-17 02:31:21,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 02:31:21,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2023-02-17 02:31:21,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:31:21,704 INFO L225 Difference]: With dead ends: 31 [2023-02-17 02:31:21,704 INFO L226 Difference]: Without dead ends: 27 [2023-02-17 02:31:21,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:31:21,706 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:31:21,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 69 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:31:21,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-17 02:31:21,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-02-17 02:31:21,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-17 02:31:21,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-02-17 02:31:21,725 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 18 [2023-02-17 02:31:21,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:31:21,726 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-02-17 02:31:21,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 02:31:21,726 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-02-17 02:31:21,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-17 02:31:21,727 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:31:21,727 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:31:21,743 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 02:31:21,932 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 02:31:21,932 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:31:21,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:31:21,933 INFO L85 PathProgramCache]: Analyzing trace with hash 903983968, now seen corresponding path program 1 times [2023-02-17 02:31:21,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:31:21,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579868798] [2023-02-17 02:31:21,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:31:21,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:31:21,954 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:31:21,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1516375348] [2023-02-17 02:31:21,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:31:21,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:31:21,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:31:21,956 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 02:31:21,958 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 02:31:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:31:22,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 02:31:22,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:31:22,076 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 02:31:22,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:31:22,425 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 02:31:22,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:31:22,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579868798] [2023-02-17 02:31:22,425 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:31:22,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516375348] [2023-02-17 02:31:22,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516375348] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:31:22,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:31:22,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2023-02-17 02:31:22,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068545114] [2023-02-17 02:31:22,426 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:31:22,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 02:31:22,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:31:22,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 02:31:22,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-02-17 02:31:22,427 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 02:31:22,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:31:22,558 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2023-02-17 02:31:22,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 02:31:22,560 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2023-02-17 02:31:22,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:31:22,562 INFO L225 Difference]: With dead ends: 38 [2023-02-17 02:31:22,562 INFO L226 Difference]: Without dead ends: 34 [2023-02-17 02:31:22,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-02-17 02:31:22,566 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:31:22,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 89 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:31:22,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-17 02:31:22,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2023-02-17 02:31:22,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-17 02:31:22,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2023-02-17 02:31:22,585 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2023-02-17 02:31:22,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:31:22,587 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2023-02-17 02:31:22,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 02:31:22,587 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2023-02-17 02:31:22,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-17 02:31:22,588 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:31:22,588 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:31:22,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-17 02:31:22,793 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 02:31:22,793 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:31:22,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:31:22,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1648043046, now seen corresponding path program 1 times [2023-02-17 02:31:22,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:31:22,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325039011] [2023-02-17 02:31:22,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:31:22,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:31:22,816 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:31:22,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [424142860] [2023-02-17 02:31:22,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:31:22,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:31:22,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:31:22,823 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 02:31:22,825 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 02:31:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:31:22,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-17 02:31:22,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:31:24,954 WARN L859 $PredicateComparison]: unable to prove that (and (< 0 |c_ULTIMATE.start_main_~k~0#1|) (= |c_ULTIMATE.start_main_~y~0#1| (+ 0 1)) (<= |c_ULTIMATE.start_main_~k~0#1| 1) (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 5) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 11) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))) is different from true [2023-02-17 02:31:24,974 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-17 02:31:24,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:31:27,001 WARN L837 $PredicateComparison]: unable to prove that (or (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 5) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 11) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))) (= (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~k~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) is different from false [2023-02-17 02:31:31,029 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_4| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| Int)) (or (= (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|)) (= (mod (+ (* 6 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* 2 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* 11 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* 5 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|)) 12) 0)))) is different from true [2023-02-17 02:31:37,068 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (= c___VERIFIER_assert_~cond 0) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| Int)) (or (= (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|)) (= (mod (+ (* 6 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* 2 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* 11 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* 5 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|)) 12) 0)))) is different from true [2023-02-17 02:31:39,087 WARN L837 $PredicateComparison]: unable to prove that (or (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 5) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 11) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))) (= (* |c_ULTIMATE.start_main_~y~0#1| |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_~c~0#1| |c_ULTIMATE.start_main_~k~0#1|)) is different from false [2023-02-17 02:31:41,134 WARN L837 $PredicateComparison]: unable to prove that (or (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 5) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 11) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1| 1))) (= (* |ULTIMATE.start_main_~k~0#1| .cse0) (* .cse0 .cse0))) (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|)))) is different from false [2023-02-17 02:31:41,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:31:41,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325039011] [2023-02-17 02:31:41,145 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:31:41,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424142860] [2023-02-17 02:31:41,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424142860] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:31:41,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 02:31:41,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2023-02-17 02:31:41,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194593149] [2023-02-17 02:31:41,146 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 02:31:41,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 02:31:41,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:31:41,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 02:31:41,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=93, Unknown=6, NotChecked=138, Total=272 [2023-02-17 02:31:41,151 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-17 02:31:41,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:31:41,263 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2023-02-17 02:31:41,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 02:31:41,265 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 36 [2023-02-17 02:31:41,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:31:41,267 INFO L225 Difference]: With dead ends: 38 [2023-02-17 02:31:41,267 INFO L226 Difference]: Without dead ends: 32 [2023-02-17 02:31:41,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=53, Invalid=147, Unknown=6, NotChecked=174, Total=380 [2023-02-17 02:31:41,273 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:31:41,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 105 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 35 Unchecked, 0.1s Time] [2023-02-17 02:31:41,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-17 02:31:41,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-17 02:31:41,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 02:31:41,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2023-02-17 02:31:41,279 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 36 [2023-02-17 02:31:41,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:31:41,280 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2023-02-17 02:31:41,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-17 02:31:41,280 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2023-02-17 02:31:41,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-17 02:31:41,281 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:31:41,281 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:31:41,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-17 02:31:41,486 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 02:31:41,486 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:31:41,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:31:41,486 INFO L85 PathProgramCache]: Analyzing trace with hash -426505545, now seen corresponding path program 2 times [2023-02-17 02:31:41,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:31:41,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691751348] [2023-02-17 02:31:41,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:31:41,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:31:41,507 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:31:41,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1119845065] [2023-02-17 02:31:41,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 02:31:41,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:31:41,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:31:41,508 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 02:31:41,567 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 02:31:41,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 02:31:41,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:31:41,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-17 02:31:41,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:31:41,639 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-17 02:31:41,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:31:41,711 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-17 02:31:41,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:31:41,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691751348] [2023-02-17 02:31:41,712 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:31:41,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119845065] [2023-02-17 02:31:41,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119845065] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:31:41,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:31:41,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2023-02-17 02:31:41,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061084763] [2023-02-17 02:31:41,713 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:31:41,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-17 02:31:41,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:31:41,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-17 02:31:41,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-02-17 02:31:41,714 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 17 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 9 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) [2023-02-17 02:31:41,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:31:41,941 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2023-02-17 02:31:41,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-17 02:31:41,941 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 9 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) Word has length 43 [2023-02-17 02:31:41,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:31:41,942 INFO L225 Difference]: With dead ends: 51 [2023-02-17 02:31:41,942 INFO L226 Difference]: Without dead ends: 43 [2023-02-17 02:31:41,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2023-02-17 02:31:41,943 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 19 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:31:41,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 175 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:31:41,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-17 02:31:41,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2023-02-17 02:31:41,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 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 02:31:41,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2023-02-17 02:31:41,952 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 43 [2023-02-17 02:31:41,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:31:41,952 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2023-02-17 02:31:41,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 9 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) [2023-02-17 02:31:41,952 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2023-02-17 02:31:41,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-17 02:31:41,953 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:31:41,954 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:31:41,960 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 02:31:42,158 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 02:31:42,158 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:31:42,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:31:42,159 INFO L85 PathProgramCache]: Analyzing trace with hash 66449050, now seen corresponding path program 3 times [2023-02-17 02:31:42,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:31:42,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256295964] [2023-02-17 02:31:42,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:31:42,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:31:42,167 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:31:42,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2003304775] [2023-02-17 02:31:42,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 02:31:42,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:31:42,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:31:42,168 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 02:31:42,170 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 02:31:42,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-02-17 02:31:42,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:31:42,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-17 02:31:42,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:31:42,249 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 95 proven. 3 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-02-17 02:31:42,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:31:42,308 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 59 proven. 3 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-02-17 02:31:42,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:31:42,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256295964] [2023-02-17 02:31:42,309 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:31:42,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003304775] [2023-02-17 02:31:42,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003304775] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:31:42,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:31:42,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2023-02-17 02:31:42,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51895402] [2023-02-17 02:31:42,310 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:31:42,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-17 02:31:42,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:31:42,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-17 02:31:42,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2023-02-17 02:31:42,311 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 15 states have internal predecessors, (42), 14 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 13 states have call predecessors, (18), 14 states have call successors, (18) [2023-02-17 02:31:42,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:31:42,357 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2023-02-17 02:31:42,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 02:31:42,358 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 15 states have internal predecessors, (42), 14 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 13 states have call predecessors, (18), 14 states have call successors, (18) Word has length 64 [2023-02-17 02:31:42,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:31:42,358 INFO L225 Difference]: With dead ends: 47 [2023-02-17 02:31:42,358 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 02:31:42,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2023-02-17 02:31:42,359 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:31:42,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 133 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:31:42,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 02:31:42,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 02:31:42,360 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 02:31:42,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 02:31:42,361 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2023-02-17 02:31:42,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:31:42,361 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 02:31:42,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 15 states have internal predecessors, (42), 14 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 13 states have call predecessors, (18), 14 states have call successors, (18) [2023-02-17 02:31:42,361 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 02:31:42,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 02:31:42,363 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 02:31:42,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-17 02:31:42,568 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 02:31:42,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 02:31:42,576 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 02:31:42,576 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (let ((.cse12 (+ 0 1))) (let ((.cse13 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse11 (= |ULTIMATE.start_main_~y~0#1| .cse12))) (let ((.cse0 (>= |ULTIMATE.start_main_~k~0#1| 0)) (.cse1 (<= |ULTIMATE.start_main_~k~0#1| 2)) (.cse3 (or (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (+ (- (* (* (* (* 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|)) (+ (- (* (* |ULTIMATE.start_main_~y~0#1| (* (* (* 6 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|)) |ULTIMATE.start_main_~y~0#1|)) (* (* (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| (* (- 2) |ULTIMATE.start_main_~y~0#1|)))) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|))) .cse13)) 0) (and .cse11 (= (+ |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| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 0)))) (.cse4 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)) (.cse5 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (.cse10 (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (.cse2 (<= |ULTIMATE.start_main_~k~0#1| 256))) (or (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 .cse1 (= |ULTIMATE.start_main_~y~0#1| 0) (>= |ULTIMATE.start_main_~c~0#1| 0) .cse2 (= |ULTIMATE.start_main_~x~0#1| 0)) (let ((.cse8 (+ |ULTIMATE.start_main_~c~0#1| 1))) (let ((.cse7 (+ |ULTIMATE.start_main_~y~0#1| 1)) (.cse9 (< .cse8 |ULTIMATE.start_main_~k~0#1|))) (and .cse0 .cse1 .cse3 (<= 1 .cse4) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| (+ 1 1)) (= (+ (- 1) .cse5) 0) (or (let ((.cse6 (+ .cse7 1))) (= (* .cse6 .cse6) (* |ULTIMATE.start_main_~k~0#1| .cse6))) (< (+ .cse8 1) |ULTIMATE.start_main_~k~0#1|) (not .cse9)) (or (= (* .cse7 |ULTIMATE.start_main_~k~0#1|) (* .cse7 .cse7)) (not .cse10) .cse9) .cse2))) (and .cse0 (<= 0 .cse4) .cse1 .cse3 (= .cse4 0) (= .cse5 0) .cse11 (<= |ULTIMATE.start_main_~c~0#1| .cse12) (< 0 |ULTIMATE.start_main_~k~0#1|) (or (= (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse13) .cse10) .cse2))))) [2023-02-17 02:31:42,577 INFO L899 garLoopResultBuilder]: For program point L29-1(lines 28 37) no Hoare annotation was computed. [2023-02-17 02:31:42,577 INFO L902 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2023-02-17 02:31:42,577 INFO L895 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: (and (>= |ULTIMATE.start_main_~k~0#1| 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (<= |ULTIMATE.start_main_~k~0#1| 256)) [2023-02-17 02:31:42,577 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 02:31:42,577 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 17 42) the Hoare annotation is: true [2023-02-17 02:31:42,577 INFO L899 garLoopResultBuilder]: For program point L40(line 40) no Hoare annotation was computed. [2023-02-17 02:31:42,577 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 02:31:42,577 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 02:31:42,578 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 37) the Hoare annotation is: (let ((.cse12 (+ 0 1))) (let ((.cse13 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse11 (= |ULTIMATE.start_main_~y~0#1| .cse12))) (let ((.cse0 (>= |ULTIMATE.start_main_~k~0#1| 0)) (.cse1 (<= |ULTIMATE.start_main_~k~0#1| 2)) (.cse3 (or (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (+ (- (* (* (* (* 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|)) (+ (- (* (* |ULTIMATE.start_main_~y~0#1| (* (* (* 6 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|)) |ULTIMATE.start_main_~y~0#1|)) (* (* (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| (* (- 2) |ULTIMATE.start_main_~y~0#1|)))) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|))) .cse13)) 0) (and .cse11 (= (+ |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| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 0)))) (.cse4 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)) (.cse5 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (.cse10 (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (.cse2 (<= |ULTIMATE.start_main_~k~0#1| 256))) (or (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 .cse1 (= |ULTIMATE.start_main_~y~0#1| 0) (>= |ULTIMATE.start_main_~c~0#1| 0) .cse2 (= |ULTIMATE.start_main_~x~0#1| 0)) (let ((.cse8 (+ |ULTIMATE.start_main_~c~0#1| 1))) (let ((.cse7 (+ |ULTIMATE.start_main_~y~0#1| 1)) (.cse9 (< .cse8 |ULTIMATE.start_main_~k~0#1|))) (and .cse0 .cse1 .cse3 (<= 1 .cse4) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| (+ 1 1)) (= (+ (- 1) .cse5) 0) (or (let ((.cse6 (+ .cse7 1))) (= (* .cse6 .cse6) (* |ULTIMATE.start_main_~k~0#1| .cse6))) (< (+ .cse8 1) |ULTIMATE.start_main_~k~0#1|) (not .cse9)) (or (= (* .cse7 |ULTIMATE.start_main_~k~0#1|) (* .cse7 .cse7)) (not .cse10) .cse9) .cse2))) (and .cse0 (<= 0 .cse4) .cse1 .cse3 (= .cse4 0) (= .cse5 0) .cse11 (<= |ULTIMATE.start_main_~c~0#1| .cse12) (< 0 |ULTIMATE.start_main_~k~0#1|) (or (= (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse13) .cse10) .cse2))))) [2023-02-17 02:31:42,578 INFO L895 garLoopResultBuilder]: At program point L28-3(lines 28 37) the Hoare annotation is: (let ((.cse6 (+ 0 1)) (.cse10 (+ |ULTIMATE.start_main_~c~0#1| 1))) (let ((.cse7 (+ |ULTIMATE.start_main_~y~0#1| 1)) (.cse8 (< .cse10 |ULTIMATE.start_main_~k~0#1|)) (.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse5 (= |ULTIMATE.start_main_~y~0#1| .cse6))) (let ((.cse1 (or (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (+ (- (* (* (* (* 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|)) (+ (- (* (* |ULTIMATE.start_main_~y~0#1| (* (* (* 6 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|)) |ULTIMATE.start_main_~y~0#1|)) (* (* (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| (* (- 2) |ULTIMATE.start_main_~y~0#1|)))) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|))) .cse0)) 0) (and .cse5 (= (+ |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| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 0)))) (.cse2 (or (let ((.cse9 (+ .cse7 1))) (= (* .cse9 .cse9) (* |ULTIMATE.start_main_~k~0#1| .cse9))) (< (+ .cse10 1) |ULTIMATE.start_main_~k~0#1|) (not .cse8))) (.cse3 (or (= (* .cse7 |ULTIMATE.start_main_~k~0#1|) (* .cse7 .cse7)) (not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) .cse8)) (.cse4 (<= |ULTIMATE.start_main_~k~0#1| 256))) (or (and (= (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse0) .cse1 .cse2 .cse3 .cse4) (and (<= |ULTIMATE.start_main_~k~0#1| 1) .cse1 .cse5 (<= |ULTIMATE.start_main_~c~0#1| .cse6) (< 0 |ULTIMATE.start_main_~k~0#1|)) (and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0)) (and (<= |ULTIMATE.start_main_~k~0#1| 2) .cse1 (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| (+ 1 1)) (= (+ (- 1) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) 0) .cse2 .cse3 .cse4))))) [2023-02-17 02:31:42,578 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2023-02-17 02:31:42,578 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse6 (+ 0 1)) (.cse10 (+ |ULTIMATE.start_main_~c~0#1| 1))) (let ((.cse7 (+ |ULTIMATE.start_main_~y~0#1| 1)) (.cse8 (< .cse10 |ULTIMATE.start_main_~k~0#1|)) (.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse5 (= |ULTIMATE.start_main_~y~0#1| .cse6))) (let ((.cse1 (or (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (+ (- (* (* (* (* 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|)) (+ (- (* (* |ULTIMATE.start_main_~y~0#1| (* (* (* 6 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|)) |ULTIMATE.start_main_~y~0#1|)) (* (* (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| (* (- 2) |ULTIMATE.start_main_~y~0#1|)))) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|))) .cse0)) 0) (and .cse5 (= (+ |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| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 0)))) (.cse2 (or (let ((.cse9 (+ .cse7 1))) (= (* .cse9 .cse9) (* |ULTIMATE.start_main_~k~0#1| .cse9))) (< (+ .cse10 1) |ULTIMATE.start_main_~k~0#1|) (not .cse8))) (.cse3 (or (= (* .cse7 |ULTIMATE.start_main_~k~0#1|) (* .cse7 .cse7)) (not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) .cse8)) (.cse4 (<= |ULTIMATE.start_main_~k~0#1| 256))) (or (and (= (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse0) .cse1 .cse2 .cse3 .cse4) (and (<= |ULTIMATE.start_main_~k~0#1| 1) .cse1 .cse5 (<= |ULTIMATE.start_main_~c~0#1| .cse6) (< 0 |ULTIMATE.start_main_~k~0#1|)) (and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0)) (and (<= |ULTIMATE.start_main_~k~0#1| 2) .cse1 (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| (+ 1 1)) (= (+ (- 1) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) 0) .cse2 .cse3 .cse4))))) [2023-02-17 02:31:42,578 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 6 8) the Hoare annotation is: true [2023-02-17 02:31:42,579 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2023-02-17 02:31:42,579 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2023-02-17 02:31:42,579 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2023-02-17 02:31:42,579 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2023-02-17 02:31:42,579 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2023-02-17 02:31:42,579 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2023-02-17 02:31:42,579 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 9 15) the Hoare annotation is: true [2023-02-17 02:31:42,579 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2023-02-17 02:31:42,579 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2023-02-17 02:31:42,582 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2023-02-17 02:31:42,583 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 02:31:42,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 02:31:42 BoogieIcfgContainer [2023-02-17 02:31:42,594 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 02:31:42,595 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 02:31:42,595 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 02:31:42,608 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 02:31:42,609 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:31:20" (3/4) ... [2023-02-17 02:31:42,611 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 02:31:42,615 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-02-17 02:31:42,616 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-17 02:31:42,618 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-02-17 02:31:42,618 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-17 02:31:42,618 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-17 02:31:42,618 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 02:31:42,643 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 02:31:42,644 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 02:31:42,644 INFO L158 Benchmark]: Toolchain (without parser) took 22349.85ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 124.1MB in the beginning and 81.6MB in the end (delta: 42.5MB). Peak memory consumption was 73.6MB. Max. memory is 16.1GB. [2023-02-17 02:31:42,644 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory is still 98.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 02:31:42,644 INFO L158 Benchmark]: CACSL2BoogieTranslator took 137.41ms. Allocated memory is still 155.2MB. Free memory was 124.1MB in the beginning and 113.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 02:31:42,645 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.43ms. Allocated memory is still 155.2MB. Free memory was 113.6MB in the beginning and 112.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 02:31:42,645 INFO L158 Benchmark]: Boogie Preprocessor took 12.78ms. Allocated memory is still 155.2MB. Free memory was 112.2MB in the beginning and 110.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 02:31:42,645 INFO L158 Benchmark]: RCFGBuilder took 323.50ms. Allocated memory is still 155.2MB. Free memory was 110.8MB in the beginning and 120.3MB in the end (delta: -9.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-02-17 02:31:42,645 INFO L158 Benchmark]: TraceAbstraction took 21803.36ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 119.5MB in the beginning and 83.7MB in the end (delta: 35.8MB). Peak memory consumption was 69.9MB. Max. memory is 16.1GB. [2023-02-17 02:31:42,646 INFO L158 Benchmark]: Witness Printer took 48.82ms. Allocated memory is still 186.6MB. Free memory was 83.7MB in the beginning and 81.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 02:31:42,647 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.15ms. Allocated memory is still 125.8MB. Free memory is still 98.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 137.41ms. Allocated memory is still 155.2MB. Free memory was 124.1MB in the beginning and 113.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.43ms. Allocated memory is still 155.2MB. Free memory was 113.6MB in the beginning and 112.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 12.78ms. Allocated memory is still 155.2MB. Free memory was 112.2MB in the beginning and 110.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 323.50ms. Allocated memory is still 155.2MB. Free memory was 110.8MB in the beginning and 120.3MB in the end (delta: -9.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 21803.36ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 119.5MB in the beginning and 83.7MB in the end (delta: 35.8MB). Peak memory consumption was 69.9MB. Max. memory is 16.1GB. * Witness Printer took 48.82ms. Allocated memory is still 186.6MB. Free memory was 83.7MB in the beginning and 81.6MB 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 3 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.7s, OverallIterations: 6, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 58 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52 mSDsluCounter, 598 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 35 IncrementalHoareTripleChecker+Unchecked, 465 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 489 IncrementalHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 133 mSDtfsCounter, 489 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 362 GetRequests, 285 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 12.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=5, InterpolantAutomatonStates: 51, 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, 6 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 29 PreInvPairs, 45 NumberOfFragments, 1320 HoareAnnotationTreeSize, 29 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 19.0s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 327 ConstructedInterpolants, 0 QuantifiedInterpolants, 1362 SizeOfPredicates, 17 NumberOfNonLiveVariables, 576 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 401/433 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: 28]: Loop Invariant Derived loop invariant: (((((((c == 0 && k >= 0) && k <= 2) && y == 0) && c >= 0) && k <= 256) && x == 0) || (((((((((k >= 0 && k <= 2) && (x * 12 + (-(5 * y * y * y * y) + (-(y * (6 * y * y * y) * y) + y * (y * (y * (-2 * y))) * y * y) + y * y) == 0 || (y == 0 + 1 && x + -1 * y * y * y * y * y == 0))) && 1 <= -1 + c) && 1 < k) && c <= 1 + 1) && -1 + (-1 + y) == 0) && (((y + 1 + 1) * (y + 1 + 1) == k * (y + 1 + 1) || c + 1 + 1 < k) || !(c + 1 < k))) && (((y + 1) * k == (y + 1) * (y + 1) || !(c < k)) || c + 1 < k)) && k <= 256)) || ((((((((((k >= 0 && 0 <= -1 + c) && k <= 2) && (x * 12 + (-(5 * y * y * y * y) + (-(y * (6 * y * y * y) * y) + y * (y * (y * (-2 * y))) * y * y) + y * y) == 0 || (y == 0 + 1 && x + -1 * y * y * y * y * y == 0))) && -1 + c == 0) && -1 + y == 0) && y == 0 + 1) && c <= 0 + 1) && 0 < k) && (k * y == y * y || c < k)) && k <= 256) RESULT: Ultimate proved your program to be correct! [2023-02-17 02:31:42,678 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