./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e8d55036 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_valuebound10.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c9e40c4fcbf0a2270c810eae17f30e2b9a539f72a78b9b7061997095813940b --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 21:32:35,380 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 21:32:35,382 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 21:32:35,416 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 21:32:35,417 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 21:32:35,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 21:32:35,420 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 21:32:35,422 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 21:32:35,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 21:32:35,425 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 21:32:35,425 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 21:32:35,426 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 21:32:35,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 21:32:35,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 21:32:35,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 21:32:35,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 21:32:35,432 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 21:32:35,435 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 21:32:35,436 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 21:32:35,438 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 21:32:35,441 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 21:32:35,443 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 21:32:35,444 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 21:32:35,444 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 21:32:35,446 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 21:32:35,448 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 21:32:35,449 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 21:32:35,449 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 21:32:35,450 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 21:32:35,451 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 21:32:35,451 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 21:32:35,452 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 21:32:35,453 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 21:32:35,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 21:32:35,454 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 21:32:35,455 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 21:32:35,455 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 21:32:35,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 21:32:35,456 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 21:32:35,457 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 21:32:35,458 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 21:32:35,459 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 21:32:35,471 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 21:32:35,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 21:32:35,471 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 21:32:35,471 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 21:32:35,472 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 21:32:35,472 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 21:32:35,472 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 21:32:35,473 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 21:32:35,473 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 21:32:35,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 21:32:35,473 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 21:32:35,473 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 21:32:35,473 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 21:32:35,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 21:32:35,474 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 21:32:35,474 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 21:32:35,474 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 21:32:35,474 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 21:32:35,474 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 21:32:35,474 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 21:32:35,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 21:32:35,474 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 21:32:35,475 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 21:32:35,475 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 21:32:35,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 21:32:35,475 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 21:32:35,476 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 21:32:35,476 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 21:32:35,476 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 21:32:35,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 21:32:35,477 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 21:32:35,477 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 21:32:35,477 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 21:32:35,477 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 21:32:35,478 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 21:32:35,478 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 -> 1c9e40c4fcbf0a2270c810eae17f30e2b9a539f72a78b9b7061997095813940b [2023-02-15 21:32:35,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 21:32:35,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 21:32:35,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 21:32:35,643 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 21:32:35,643 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 21:32:35,644 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound10.c [2023-02-15 21:32:36,674 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 21:32:36,811 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 21:32:36,811 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound10.c [2023-02-15 21:32:36,815 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54c6776bb/30595708af204aeeac3169587c3caf51/FLAG971ad18d0 [2023-02-15 21:32:36,824 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54c6776bb/30595708af204aeeac3169587c3caf51 [2023-02-15 21:32:36,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 21:32:36,826 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 21:32:36,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 21:32:36,829 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 21:32:36,831 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 21:32:36,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:32:36" (1/1) ... [2023-02-15 21:32:36,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23a7e1db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:32:36, skipping insertion in model container [2023-02-15 21:32:36,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:32:36" (1/1) ... [2023-02-15 21:32:36,836 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 21:32:36,845 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 21:32:36,928 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_valuebound10.c[458,471] [2023-02-15 21:32:36,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 21:32:36,942 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 21:32:36,949 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_valuebound10.c[458,471] [2023-02-15 21:32:36,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 21:32:36,960 INFO L208 MainTranslator]: Completed translation [2023-02-15 21:32:36,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:32:36 WrapperNode [2023-02-15 21:32:36,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 21:32:36,962 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 21:32:36,962 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 21:32:36,962 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 21:32:36,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:32:36" (1/1) ... [2023-02-15 21:32:36,969 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:32:36" (1/1) ... [2023-02-15 21:32:36,978 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2023-02-15 21:32:36,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 21:32:36,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 21:32:36,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 21:32:36,979 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 21:32:36,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:32:36" (1/1) ... [2023-02-15 21:32:36,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:32:36" (1/1) ... [2023-02-15 21:32:36,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:32:36" (1/1) ... [2023-02-15 21:32:36,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:32:36" (1/1) ... [2023-02-15 21:32:36,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:32:36" (1/1) ... [2023-02-15 21:32:36,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:32:36" (1/1) ... [2023-02-15 21:32:36,990 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:32:36" (1/1) ... [2023-02-15 21:32:36,990 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:32:36" (1/1) ... [2023-02-15 21:32:36,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 21:32:36,992 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 21:32:36,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 21:32:36,992 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 21:32:36,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:32:36" (1/1) ... [2023-02-15 21:32:36,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 21:32:37,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:32:37,015 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-15 21:32:37,021 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-15 21:32:37,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 21:32:37,040 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-15 21:32:37,040 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-15 21:32:37,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 21:32:37,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 21:32:37,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 21:32:37,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-15 21:32:37,040 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-15 21:32:37,087 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 21:32:37,090 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 21:32:37,190 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 21:32:37,194 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 21:32:37,194 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 21:32:37,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:32:37 BoogieIcfgContainer [2023-02-15 21:32:37,195 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 21:32:37,196 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 21:32:37,197 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 21:32:37,199 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 21:32:37,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 09:32:36" (1/3) ... [2023-02-15 21:32:37,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1509121e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 09:32:37, skipping insertion in model container [2023-02-15 21:32:37,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:32:36" (2/3) ... [2023-02-15 21:32:37,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1509121e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 09:32:37, skipping insertion in model container [2023-02-15 21:32:37,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:32:37" (3/3) ... [2023-02-15 21:32:37,200 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound10.c [2023-02-15 21:32:37,211 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 21:32:37,211 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 21:32:37,240 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 21:32:37,245 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;@6bf7bf47, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 21:32:37,246 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 21:32:37,248 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-15 21:32:37,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 21:32:37,253 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:32:37,254 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:32:37,255 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:32:37,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:32:37,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1845349065, now seen corresponding path program 1 times [2023-02-15 21:32:37,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:32:37,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636832074] [2023-02-15 21:32:37,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:32:37,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:32:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:32:37,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:32:37,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636832074] [2023-02-15 21:32:37,372 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-15 21:32:37,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691163733] [2023-02-15 21:32:37,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:32:37,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:32:37,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:32:37,377 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-15 21:32:37,393 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-15 21:32:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:32:37,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 21:32:37,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:32:37,504 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-15 21:32:37,505 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:32:37,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691163733] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:32:37,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:32:37,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 21:32:37,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297574868] [2023-02-15 21:32:37,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:32:37,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 21:32:37,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:32:37,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 21:32:37,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 21:32:37,533 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-15 21:32:37,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:32:37,551 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2023-02-15 21:32:37,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 21:32:37,556 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-15 21:32:37,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:32:37,565 INFO L225 Difference]: With dead ends: 45 [2023-02-15 21:32:37,565 INFO L226 Difference]: Without dead ends: 20 [2023-02-15 21:32:37,567 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-15 21:32:37,571 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-15 21:32:37,571 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-15 21:32:37,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-15 21:32:37,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-02-15 21:32:37,606 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-15 21:32:37,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2023-02-15 21:32:37,608 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 18 [2023-02-15 21:32:37,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:32:37,608 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-02-15 21:32:37,608 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-15 21:32:37,609 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2023-02-15 21:32:37,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 21:32:37,609 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:32:37,610 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:32:37,618 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-15 21:32:37,818 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-15 21:32:37,820 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:32:37,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:32:37,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1506842435, now seen corresponding path program 1 times [2023-02-15 21:32:37,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:32:37,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595185660] [2023-02-15 21:32:37,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:32:37,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:32:37,832 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 21:32:37,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [272824291] [2023-02-15 21:32:37,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:32:37,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:32:37,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:32:37,853 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-15 21:32:37,856 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-15 21:32:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:32:37,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 21:32:37,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:32:38,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:32:38,034 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:32:38,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:32:38,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595185660] [2023-02-15 21:32:38,035 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 21:32:38,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272824291] [2023-02-15 21:32:38,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272824291] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:32:38,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:32:38,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 21:32:38,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961651763] [2023-02-15 21:32:38,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:32:38,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 21:32:38,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:32:38,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 21:32:38,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 21:32:38,038 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:32:38,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:32:38,223 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2023-02-15 21:32:38,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 21:32:38,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2023-02-15 21:32:38,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:32:38,224 INFO L225 Difference]: With dead ends: 31 [2023-02-15 21:32:38,224 INFO L226 Difference]: Without dead ends: 27 [2023-02-15 21:32:38,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-15 21:32:38,226 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:32:38,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 77 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 21:32:38,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-15 21:32:38,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-02-15 21:32:38,233 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-15 21:32:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-02-15 21:32:38,233 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 18 [2023-02-15 21:32:38,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:32:38,234 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-02-15 21:32:38,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:32:38,234 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-02-15 21:32:38,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 21:32:38,235 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:32:38,235 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-15 21:32:38,243 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-15 21:32:38,440 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-15 21:32:38,440 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:32:38,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:32:38,441 INFO L85 PathProgramCache]: Analyzing trace with hash 903983968, now seen corresponding path program 1 times [2023-02-15 21:32:38,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:32:38,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294279392] [2023-02-15 21:32:38,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:32:38,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:32:38,455 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 21:32:38,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1620423485] [2023-02-15 21:32:38,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:32:38,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:32:38,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:32:38,458 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-15 21:32:38,460 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-15 21:32:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:32:38,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 21:32:38,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:32:38,595 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-15 21:32:38,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:32:38,755 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-15 21:32:38,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:32:38,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294279392] [2023-02-15 21:32:38,756 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 21:32:38,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620423485] [2023-02-15 21:32:38,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620423485] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:32:38,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:32:38,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2023-02-15 21:32:38,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446254228] [2023-02-15 21:32:38,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:32:38,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 21:32:38,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:32:38,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 21:32:38,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-02-15 21:32:38,759 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-15 21:32:38,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:32:38,840 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2023-02-15 21:32:38,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 21:32:38,841 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-15 21:32:38,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:32:38,841 INFO L225 Difference]: With dead ends: 38 [2023-02-15 21:32:38,842 INFO L226 Difference]: Without dead ends: 34 [2023-02-15 21:32:38,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-02-15 21:32:38,843 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-15 21:32:38,843 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-15 21:32:38,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-15 21:32:38,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2023-02-15 21:32:38,850 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-15 21:32:38,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2023-02-15 21:32:38,850 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2023-02-15 21:32:38,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:32:38,851 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2023-02-15 21:32:38,851 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-15 21:32:38,851 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2023-02-15 21:32:38,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 21:32:38,852 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:32:38,852 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-15 21:32:38,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 21:32:39,057 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-15 21:32:39,057 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:32:39,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:32:39,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1648043046, now seen corresponding path program 1 times [2023-02-15 21:32:39,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:32:39,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137633400] [2023-02-15 21:32:39,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:32:39,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:32:39,077 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 21:32:39,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1147145583] [2023-02-15 21:32:39,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:32:39,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:32:39,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:32:39,082 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-15 21:32:39,084 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-15 21:32:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:32:39,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-15 21:32:39,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:32:39,267 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-15 21:32:39,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:32:43,328 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (= (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~k~0#1|) .cse0) (not (= (mod (+ .cse0 (* 10 |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|) (* 7 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 6 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 12) 0)))) is different from false [2023-02-15 21:33:05,196 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_4| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|))) (or (= (mod (+ (* 10 |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|) (* 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|) (* 7 |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|) .cse0) 12) 0) (= (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_4|) .cse0)))) (not (= |c___VERIFIER_assert_#in~cond| 0))) is different from true [2023-02-15 21:33:23,300 WARN L859 $PredicateComparison]: unable to prove that (or (= 0 c___VERIFIER_assert_~cond) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_4| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|))) (or (= (mod (+ (* 10 |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|) (* 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|) (* 7 |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|) .cse0) 12) 0) (= (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_4|) .cse0)))) (not (= |c___VERIFIER_assert_#in~cond| 0))) is different from true [2023-02-15 21:33:27,342 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (= (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~k~0#1|) .cse0) (< |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~k~0#1|) (not (= (mod (+ .cse0 (* 10 |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|) (* 7 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 6 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 12) 0)))) is different from false [2023-02-15 21:33:35,419 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (not (= (mod (+ .cse0 (* 10 |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|) (* 7 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 6 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 12) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (= (+ |ULTIMATE.start_main_~k~0#1| (* |ULTIMATE.start_main_~k~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (+ (* 2 |c_ULTIMATE.start_main_~y~0#1|) .cse0 1)) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|) (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)))))) is different from false [2023-02-15 21:33:37,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:33:37,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137633400] [2023-02-15 21:33:37,440 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 21:33:37,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147145583] [2023-02-15 21:33:37,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147145583] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:33:37,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-15 21:33:37,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2023-02-15 21:33:37,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423369649] [2023-02-15 21:33:37,440 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-15 21:33:37,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 21:33:37,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:33:37,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 21:33:37,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=92, Unknown=5, NotChecked=110, Total=240 [2023-02-15 21:33:37,441 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 4 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-15 21:33:37,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:33:37,541 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2023-02-15 21:33:37,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 21:33:37,541 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 4 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-15 21:33:37,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:33:37,542 INFO L225 Difference]: With dead ends: 38 [2023-02-15 21:33:37,542 INFO L226 Difference]: Without dead ends: 32 [2023-02-15 21:33:37,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=51, Invalid=146, Unknown=5, NotChecked=140, Total=342 [2023-02-15 21:33:37,543 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:33:37,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 105 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:33:37,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-15 21:33:37,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-15 21:33:37,551 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-15 21:33:37,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2023-02-15 21:33:37,553 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 36 [2023-02-15 21:33:37,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:33:37,554 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2023-02-15 21:33:37,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 4 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-15 21:33:37,554 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2023-02-15 21:33:37,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 21:33:37,555 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:33:37,555 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-15 21:33:37,563 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-15 21:33:37,756 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-15 21:33:37,757 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:33:37,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:33:37,757 INFO L85 PathProgramCache]: Analyzing trace with hash -426505545, now seen corresponding path program 2 times [2023-02-15 21:33:37,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:33:37,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966356015] [2023-02-15 21:33:37,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:33:37,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:33:37,765 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 21:33:37,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [769680497] [2023-02-15 21:33:37,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 21:33:37,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:33:37,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:33:37,784 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-15 21:33:37,784 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-15 21:33:37,826 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 21:33:37,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:33:37,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 21:33:37,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:33:37,958 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-15 21:33:37,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:33:42,072 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (not (= (mod (+ .cse0 (* 10 |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|) (* 7 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 6 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 12) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (= (+ |ULTIMATE.start_main_~k~0#1| (* |ULTIMATE.start_main_~k~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (+ (* 2 |c_ULTIMATE.start_main_~y~0#1|) .cse0 1)) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|) (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)))))) is different from false [2023-02-15 21:33:42,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:33:42,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966356015] [2023-02-15 21:33:42,075 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 21:33:42,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769680497] [2023-02-15 21:33:42,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769680497] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:33:42,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-15 21:33:42,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2023-02-15 21:33:42,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768157332] [2023-02-15 21:33:42,075 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-15 21:33:42,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 21:33:42,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:33:42,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 21:33:42,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=148, Unknown=1, NotChecked=24, Total=210 [2023-02-15 21:33:42,076 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 21:33:42,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:33:42,184 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2023-02-15 21:33:42,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 21:33:42,185 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 43 [2023-02-15 21:33:42,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:33:42,185 INFO L225 Difference]: With dead ends: 41 [2023-02-15 21:33:42,185 INFO L226 Difference]: Without dead ends: 35 [2023-02-15 21:33:42,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=56, Invalid=219, Unknown=1, NotChecked=30, Total=306 [2023-02-15 21:33:42,186 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:33:42,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 127 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:33:42,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-15 21:33:42,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-02-15 21:33:42,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 21:33:42,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-02-15 21:33:42,197 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 43 [2023-02-15 21:33:42,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:33:42,198 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-02-15 21:33:42,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 21:33:42,199 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-02-15 21:33:42,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-15 21:33:42,200 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:33:42,200 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:33:42,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 21:33:42,405 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-15 21:33:42,405 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:33:42,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:33:42,406 INFO L85 PathProgramCache]: Analyzing trace with hash 173594938, now seen corresponding path program 3 times [2023-02-15 21:33:42,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:33:42,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217157138] [2023-02-15 21:33:42,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:33:42,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:33:42,418 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 21:33:42,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [175889618] [2023-02-15 21:33:42,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 21:33:42,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:33:42,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:33:42,424 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-15 21:33:42,426 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-15 21:33:42,541 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-15 21:33:42,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:33:42,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-15 21:33:42,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:33:42,650 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 15 proven. 25 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-02-15 21:33:42,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:33:46,768 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (not (= (mod (+ .cse0 (* 10 |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|) (* 7 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 6 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 12) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (= (+ |ULTIMATE.start_main_~k~0#1| (* |ULTIMATE.start_main_~k~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (+ (* 2 |c_ULTIMATE.start_main_~y~0#1|) .cse0 1)) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|) (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)))))) is different from false [2023-02-15 21:33:46,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:33:46,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217157138] [2023-02-15 21:33:46,770 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 21:33:46,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175889618] [2023-02-15 21:33:46,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175889618] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:33:46,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-15 21:33:46,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-02-15 21:33:46,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699920469] [2023-02-15 21:33:46,771 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-15 21:33:46,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 21:33:46,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:33:46,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 21:33:46,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=173, Unknown=1, NotChecked=26, Total=240 [2023-02-15 21:33:46,772 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-15 21:33:46,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:33:46,920 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2023-02-15 21:33:46,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 21:33:46,921 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 50 [2023-02-15 21:33:46,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:33:46,923 INFO L225 Difference]: With dead ends: 44 [2023-02-15 21:33:46,923 INFO L226 Difference]: Without dead ends: 38 [2023-02-15 21:33:46,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=59, Invalid=250, Unknown=1, NotChecked=32, Total=342 [2023-02-15 21:33:46,925 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:33:46,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 136 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:33:46,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-15 21:33:46,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-02-15 21:33:46,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-15 21:33:46,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2023-02-15 21:33:46,944 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 50 [2023-02-15 21:33:46,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:33:46,944 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2023-02-15 21:33:46,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-15 21:33:46,945 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2023-02-15 21:33:46,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-15 21:33:46,951 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:33:46,953 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:33:46,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 21:33:47,157 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-15 21:33:47,157 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:33:47,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:33:47,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1013596503, now seen corresponding path program 4 times [2023-02-15 21:33:47,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:33:47,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307460542] [2023-02-15 21:33:47,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:33:47,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:33:47,165 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 21:33:47,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1999440810] [2023-02-15 21:33:47,165 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 21:33:47,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:33:47,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:33:47,166 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 21:33:47,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 21:33:47,198 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 21:33:47,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:33:47,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-15 21:33:47,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:33:47,390 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-02-15 21:33:47,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:33:47,608 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-02-15 21:33:47,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:33:47,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307460542] [2023-02-15 21:33:47,608 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 21:33:47,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999440810] [2023-02-15 21:33:47,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999440810] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:33:47,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:33:47,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2023-02-15 21:33:47,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289724014] [2023-02-15 21:33:47,608 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:33:47,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-15 21:33:47,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:33:47,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-15 21:33:47,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2023-02-15 21:33:47,610 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 21 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 14 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2023-02-15 21:33:48,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:33:48,298 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2023-02-15 21:33:48,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 21:33:48,299 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 14 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) Word has length 57 [2023-02-15 21:33:48,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:33:48,299 INFO L225 Difference]: With dead ends: 63 [2023-02-15 21:33:48,299 INFO L226 Difference]: Without dead ends: 55 [2023-02-15 21:33:48,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2023-02-15 21:33:48,300 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 32 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 21:33:48,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 286 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 21:33:48,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-15 21:33:48,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2023-02-15 21:33:48,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-02-15 21:33:48,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2023-02-15 21:33:48,313 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 57 [2023-02-15 21:33:48,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:33:48,313 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2023-02-15 21:33:48,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 14 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2023-02-15 21:33:48,313 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2023-02-15 21:33:48,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-02-15 21:33:48,314 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:33:48,314 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:33:48,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 21:33:48,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:33:48,519 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:33:48,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:33:48,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1063034534, now seen corresponding path program 5 times [2023-02-15 21:33:48,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:33:48,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768413398] [2023-02-15 21:33:48,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:33:48,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:33:48,527 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 21:33:48,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1456623517] [2023-02-15 21:33:48,527 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 21:33:48,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:33:48,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:33:48,528 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 21:33:48,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 21:33:49,834 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2023-02-15 21:33:49,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:33:49,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-15 21:33:49,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:33:50,060 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 51 proven. 136 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2023-02-15 21:33:50,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:34:51,303 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51|))) (or (= (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_34| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51|) .cse0) (= (mod (+ (* 6 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51|) (* 10 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51|) .cse0 (* 7 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51|)) 12) 0)))) (not (= |c___VERIFIER_assert_#in~cond| 0))) is different from true [2023-02-15 21:35:09,348 WARN L859 $PredicateComparison]: unable to prove that (or (= 0 c___VERIFIER_assert_~cond) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51|))) (or (= (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_34| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51|) .cse0) (= (mod (+ (* 6 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51|) (* 10 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51|) .cse0 (* 7 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_51|)) 12) 0)))) (not (= |c___VERIFIER_assert_#in~cond| 0))) is different from true [2023-02-15 21:35:13,361 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (= (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~k~0#1|) .cse0) (< |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~k~0#1|) (not (= (mod (+ .cse0 (* 10 |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|) (* 7 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 6 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 12) 0)))) is different from false [2023-02-15 21:35:21,399 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (not (= (mod (+ .cse0 (* 10 |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|) (* 7 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 6 |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 12) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (= (+ |ULTIMATE.start_main_~k~0#1| (* |ULTIMATE.start_main_~k~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (+ (* 2 |c_ULTIMATE.start_main_~y~0#1|) .cse0 1)) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|) (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)))))) is different from false [2023-02-15 21:35:23,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:35:23,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768413398] [2023-02-15 21:35:23,417 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 21:35:23,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456623517] [2023-02-15 21:35:23,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456623517] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:35:23,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-15 21:35:23,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2023-02-15 21:35:23,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479125488] [2023-02-15 21:35:23,418 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-15 21:35:23,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 21:35:23,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:35:23,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 21:35:23,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=323, Unknown=21, NotChecked=156, Total=552 [2023-02-15 21:35:23,419 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 17 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 12 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2023-02-15 21:35:29,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:35:29,783 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2023-02-15 21:35:29,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 21:35:29,783 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 12 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 92 [2023-02-15 21:35:29,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:35:29,784 INFO L225 Difference]: With dead ends: 62 [2023-02-15 21:35:29,784 INFO L226 Difference]: Without dead ends: 56 [2023-02-15 21:35:29,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 53.3s TimeCoverageRelationStatistics Valid=71, Invalid=427, Unknown=24, NotChecked=180, Total=702 [2023-02-15 21:35:29,785 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 21:35:29,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 316 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 21:35:29,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-02-15 21:35:29,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-02-15 21:35:29,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-02-15 21:35:29,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2023-02-15 21:35:29,803 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 92 [2023-02-15 21:35:29,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:35:29,804 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2023-02-15 21:35:29,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 12 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2023-02-15 21:35:29,805 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2023-02-15 21:35:29,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-02-15 21:35:29,809 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:35:29,809 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 11, 11, 11, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:35:29,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 21:35:30,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-02-15 21:35:30,016 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 21:35:30,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:35:30,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1524389175, now seen corresponding path program 6 times [2023-02-15 21:35:30,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:35:30,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052134580] [2023-02-15 21:35:30,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:35:30,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:35:30,027 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 21:35:30,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [127337693] [2023-02-15 21:35:30,027 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-15 21:35:30,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:35:30,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:35:30,028 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 21:35:30,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 21:35:30,802 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2023-02-15 21:35:30,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:35:30,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-15 21:35:30,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:35:31,194 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 24 proven. 168 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2023-02-15 21:35:31,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:35:31,729 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 24 proven. 168 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2023-02-15 21:35:31,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:35:31,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052134580] [2023-02-15 21:35:31,729 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 21:35:31,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127337693] [2023-02-15 21:35:31,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127337693] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:35:31,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:35:31,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2023-02-15 21:35:31,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420837110] [2023-02-15 21:35:31,729 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:35:31,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-15 21:35:31,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:35:31,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-15 21:35:31,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=909, Unknown=0, NotChecked=0, Total=1056 [2023-02-15 21:35:31,731 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 33 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 29 states have internal predecessors, (64), 25 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (28), 24 states have call predecessors, (28), 25 states have call successors, (28) [2023-02-15 21:35:32,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:35:32,289 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2023-02-15 21:35:32,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 21:35:32,289 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 29 states have internal predecessors, (64), 25 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (28), 24 states have call predecessors, (28), 25 states have call successors, (28) Word has length 99 [2023-02-15 21:35:32,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:35:32,289 INFO L225 Difference]: With dead ends: 69 [2023-02-15 21:35:32,289 INFO L226 Difference]: Without dead ends: 0 [2023-02-15 21:35:32,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2023-02-15 21:35:32,291 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 15 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 21:35:32,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 438 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 21:35:32,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-15 21:35:32,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-15 21:35:32,291 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-15 21:35:32,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-15 21:35:32,291 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2023-02-15 21:35:32,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:35:32,291 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 21:35:32,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 29 states have internal predecessors, (64), 25 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (28), 24 states have call predecessors, (28), 25 states have call successors, (28) [2023-02-15 21:35:32,292 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-15 21:35:32,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-15 21:35:32,294 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 21:35:32,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 21:35:32,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:35:32,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-15 21:35:33,696 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-15 21:35:33,697 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (let ((.cse3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse2 (or (= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~k~0#1|) .cse3) (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))) (.cse0 (= (+ (* 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|)) (* 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|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* 12 |ULTIMATE.start_main_~x~0#1|) .cse3))) (.cse1 (<= |ULTIMATE.start_main_~k~0#1| 10))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|)) (and (= |ULTIMATE.start_main_~y~0#1| 10) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~c~0#1|) .cse0 (<= 10 |ULTIMATE.start_main_~k~0#1|) .cse1) (and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1) .cse0 .cse1 (< 0 |ULTIMATE.start_main_~k~0#1|)) (and (= |ULTIMATE.start_main_~c~0#1| 3) (= |ULTIMATE.start_main_~y~0#1| 3) .cse2 .cse0 .cse1) (and (= |ULTIMATE.start_main_~y~0#1| 8) (= |ULTIMATE.start_main_~c~0#1| 8) .cse2 .cse0 .cse1) (and (= |ULTIMATE.start_main_~c~0#1| 6) .cse2 .cse0 .cse1 (= |ULTIMATE.start_main_~y~0#1| 6)) (and (= |ULTIMATE.start_main_~x~0#1| 0) (<= 0 |ULTIMATE.start_main_~k~0#1|) .cse1 (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~c~0#1| 0)) (and (= |ULTIMATE.start_main_~y~0#1| 5) .cse2 .cse0 .cse1 (= |ULTIMATE.start_main_~c~0#1| 5)) (and .cse2 .cse0 (= |ULTIMATE.start_main_~y~0#1| 7) .cse1 (= |ULTIMATE.start_main_~c~0#1| 7)) (and (= |ULTIMATE.start_main_~y~0#1| 9) (<= |ULTIMATE.start_main_~c~0#1| 9) .cse0 (<= 9 |ULTIMATE.start_main_~c~0#1|) .cse1 (< 8 |ULTIMATE.start_main_~k~0#1|)) (and (= |ULTIMATE.start_main_~c~0#1| 2) .cse0 .cse1 (< 1 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 2))))) [2023-02-15 21:35:33,697 INFO L899 garLoopResultBuilder]: For program point L29-1(lines 28 37) no Hoare annotation was computed. [2023-02-15 21:35:33,697 INFO L902 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2023-02-15 21:35:33,697 INFO L895 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 10)) [2023-02-15 21:35:33,697 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-15 21:35:33,697 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 17 42) the Hoare annotation is: true [2023-02-15 21:35:33,697 INFO L899 garLoopResultBuilder]: For program point L40(line 40) no Hoare annotation was computed. [2023-02-15 21:35:33,697 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-15 21:35:33,698 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-15 21:35:33,698 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 37) the Hoare annotation is: (let ((.cse3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse2 (or (= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~k~0#1|) .cse3) (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))) (.cse0 (= (+ (* 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|)) (* 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|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* 12 |ULTIMATE.start_main_~x~0#1|) .cse3))) (.cse1 (<= |ULTIMATE.start_main_~k~0#1| 10))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|)) (and (= |ULTIMATE.start_main_~y~0#1| 10) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~c~0#1|) .cse0 (<= 10 |ULTIMATE.start_main_~k~0#1|) .cse1) (and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1) .cse0 .cse1 (< 0 |ULTIMATE.start_main_~k~0#1|)) (and (= |ULTIMATE.start_main_~c~0#1| 3) (= |ULTIMATE.start_main_~y~0#1| 3) .cse2 .cse0 .cse1) (and (= |ULTIMATE.start_main_~y~0#1| 8) (= |ULTIMATE.start_main_~c~0#1| 8) .cse2 .cse0 .cse1) (and (= |ULTIMATE.start_main_~c~0#1| 6) .cse2 .cse0 .cse1 (= |ULTIMATE.start_main_~y~0#1| 6)) (and (= |ULTIMATE.start_main_~x~0#1| 0) (<= 0 |ULTIMATE.start_main_~k~0#1|) .cse1 (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~c~0#1| 0)) (and (= |ULTIMATE.start_main_~y~0#1| 5) .cse2 .cse0 .cse1 (= |ULTIMATE.start_main_~c~0#1| 5)) (and .cse2 .cse0 (= |ULTIMATE.start_main_~y~0#1| 7) .cse1 (= |ULTIMATE.start_main_~c~0#1| 7)) (and (= |ULTIMATE.start_main_~y~0#1| 9) (<= |ULTIMATE.start_main_~c~0#1| 9) .cse0 (<= 9 |ULTIMATE.start_main_~c~0#1|) .cse1 (< 8 |ULTIMATE.start_main_~k~0#1|)) (and (= |ULTIMATE.start_main_~c~0#1| 2) .cse0 .cse1 (< 1 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 2))))) [2023-02-15 21:35:33,698 INFO L895 garLoopResultBuilder]: At program point L28-3(lines 28 37) the Hoare annotation is: (let ((.cse1 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse0 (= (+ (* 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|)) (* 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|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* 12 |ULTIMATE.start_main_~x~0#1|) .cse1)))) (or (and (= |ULTIMATE.start_main_~y~0#1| 3) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 3) .cse0) (and .cse0 (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 2)) (let ((.cse4 (< (+ |ULTIMATE.start_main_~c~0#1| 3) |ULTIMATE.start_main_~k~0#1|)) (.cse2 (< (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|)) (.cse3 (< (+ |ULTIMATE.start_main_~c~0#1| 2) |ULTIMATE.start_main_~k~0#1|))) (and (= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~k~0#1|) .cse1) (or .cse2 (not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))) (or (not .cse3) .cse4) (or (not .cse4) (< (+ |ULTIMATE.start_main_~c~0#1| 4) |ULTIMATE.start_main_~k~0#1|)) (<= 0 |ULTIMATE.start_main_~k~0#1|) .cse0 (or (not .cse2) .cse3) (<= |ULTIMATE.start_main_~k~0#1| 10))) (and (= |ULTIMATE.start_main_~y~0#1| 1) .cse0 (<= |ULTIMATE.start_main_~k~0#1| 1) (< 0 |ULTIMATE.start_main_~k~0#1|)) (and (= |ULTIMATE.start_main_~x~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))))) [2023-02-15 21:35:33,698 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2023-02-15 21:35:33,698 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse1 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse0 (= (+ (* 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|)) (* 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|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* 12 |ULTIMATE.start_main_~x~0#1|) .cse1)))) (or (and (= |ULTIMATE.start_main_~y~0#1| 3) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 3) .cse0) (and .cse0 (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 2)) (let ((.cse4 (< (+ |ULTIMATE.start_main_~c~0#1| 3) |ULTIMATE.start_main_~k~0#1|)) (.cse2 (< (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|)) (.cse3 (< (+ |ULTIMATE.start_main_~c~0#1| 2) |ULTIMATE.start_main_~k~0#1|))) (and (= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~k~0#1|) .cse1) (or .cse2 (not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))) (or (not .cse3) .cse4) (or (not .cse4) (< (+ |ULTIMATE.start_main_~c~0#1| 4) |ULTIMATE.start_main_~k~0#1|)) (<= 0 |ULTIMATE.start_main_~k~0#1|) .cse0 (or (not .cse2) .cse3) (<= |ULTIMATE.start_main_~k~0#1| 10))) (and (= |ULTIMATE.start_main_~y~0#1| 1) .cse0 (<= |ULTIMATE.start_main_~k~0#1| 1) (< 0 |ULTIMATE.start_main_~k~0#1|)) (and (= |ULTIMATE.start_main_~x~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))))) [2023-02-15 21:35:33,698 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 6 8) the Hoare annotation is: true [2023-02-15 21:35:33,699 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2023-02-15 21:35:33,699 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2023-02-15 21:35:33,699 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2023-02-15 21:35:33,699 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2023-02-15 21:35:33,699 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2023-02-15 21:35:33,699 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2023-02-15 21:35:33,699 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 9 15) the Hoare annotation is: true [2023-02-15 21:35:33,699 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2023-02-15 21:35:33,699 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2023-02-15 21:35:33,701 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2023-02-15 21:35:33,703 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 21:35:33,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 09:35:33 BoogieIcfgContainer [2023-02-15 21:35:33,736 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 21:35:33,737 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 21:35:33,737 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 21:35:33,737 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 21:35:33,738 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:32:37" (3/4) ... [2023-02-15 21:35:33,740 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-15 21:35:33,744 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-02-15 21:35:33,744 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-15 21:35:33,747 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-02-15 21:35:33,748 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-15 21:35:33,748 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-15 21:35:33,748 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-15 21:35:33,780 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 21:35:33,780 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 21:35:33,780 INFO L158 Benchmark]: Toolchain (without parser) took 176953.97ms. Allocated memory was 151.0MB in the beginning and 241.2MB in the end (delta: 90.2MB). Free memory was 102.8MB in the beginning and 107.6MB in the end (delta: -4.9MB). Peak memory consumption was 87.9MB. Max. memory is 16.1GB. [2023-02-15 21:35:33,781 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory was 53.2MB in the beginning and 53.0MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 21:35:33,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 134.02ms. Allocated memory is still 151.0MB. Free memory was 102.3MB in the beginning and 91.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 21:35:33,781 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.22ms. Allocated memory is still 151.0MB. Free memory was 91.8MB in the beginning and 90.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 21:35:33,781 INFO L158 Benchmark]: Boogie Preprocessor took 12.12ms. Allocated memory is still 151.0MB. Free memory was 90.2MB in the beginning and 89.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 21:35:33,782 INFO L158 Benchmark]: RCFGBuilder took 203.67ms. Allocated memory is still 151.0MB. Free memory was 89.1MB in the beginning and 78.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 21:35:33,782 INFO L158 Benchmark]: TraceAbstraction took 176539.73ms. Allocated memory was 151.0MB in the beginning and 241.2MB in the end (delta: 90.2MB). Free memory was 78.1MB in the beginning and 109.7MB in the end (delta: -31.5MB). Peak memory consumption was 102.6MB. Max. memory is 16.1GB. [2023-02-15 21:35:33,782 INFO L158 Benchmark]: Witness Printer took 43.22ms. Allocated memory is still 241.2MB. Free memory was 109.7MB in the beginning and 107.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 21:35:33,784 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory was 53.2MB in the beginning and 53.0MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 134.02ms. Allocated memory is still 151.0MB. Free memory was 102.3MB in the beginning and 91.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.22ms. Allocated memory is still 151.0MB. Free memory was 91.8MB in the beginning and 90.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 12.12ms. Allocated memory is still 151.0MB. Free memory was 90.2MB in the beginning and 89.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 203.67ms. Allocated memory is still 151.0MB. Free memory was 89.1MB in the beginning and 78.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 176539.73ms. Allocated memory was 151.0MB in the beginning and 241.2MB in the end (delta: 90.2MB). Free memory was 78.1MB in the beginning and 109.7MB in the end (delta: -31.5MB). Peak memory consumption was 102.6MB. Max. memory is 16.1GB. * Witness Printer took 43.22ms. Allocated memory is still 241.2MB. Free memory was 109.7MB in the beginning and 107.6MB in the end (delta: 2.0MB). 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: 176.5s, OverallIterations: 9, TraceHistogramMax: 13, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 105 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 99 mSDsluCounter, 1601 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1357 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2317 IncrementalHoareTripleChecker+Invalid, 2391 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 244 mSDtfsCounter, 2317 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 711 GetRequests, 550 SyntacticMatches, 2 SemanticMatches, 159 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 70.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=8, InterpolantAutomatonStates: 106, 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, 9 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 43 PreInvPairs, 83 NumberOfFragments, 1511 HoareAnnotationTreeSize, 43 FomulaSimplifications, 352 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 1770 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 162.2s InterpolantComputationTime, 456 NumberOfCodeBlocks, 447 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 607 ConstructedInterpolants, 0 QuantifiedInterpolants, 2993 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1120 ConjunctsInSsa, 235 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 1089/1673 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: (((((((((((((6 * (y * y * y * y * y) + 5 * (y * y * y * y) + 2 * (y * y * y * y * y * y) == 12 * x + y * y && k <= 10) && y == 4) && c == 4) && 3 < k) || ((((y == 10 && k <= c) && 6 * (y * y * y * y * y) + 5 * (y * y * y * y) + 2 * (y * y * y * y * y * y) == 12 * x + y * y) && 10 <= k) && k <= 10)) || ((((c == 1 && y == 1) && 6 * (y * y * y * y * y) + 5 * (y * y * y * y) + 2 * (y * y * y * y * y * y) == 12 * x + y * y) && k <= 10) && 0 < k)) || ((((c == 3 && y == 3) && (y * k == y * y || c < k)) && 6 * (y * y * y * y * y) + 5 * (y * y * y * y) + 2 * (y * y * y * y * y * y) == 12 * x + y * y) && k <= 10)) || ((((y == 8 && c == 8) && (y * k == y * y || c < k)) && 6 * (y * y * y * y * y) + 5 * (y * y * y * y) + 2 * (y * y * y * y * y * y) == 12 * x + y * y) && k <= 10)) || ((((c == 6 && (y * k == y * y || c < k)) && 6 * (y * y * y * y * y) + 5 * (y * y * y * y) + 2 * (y * y * y * y * y * y) == 12 * x + y * y) && k <= 10) && y == 6)) || ((((x == 0 && 0 <= k) && k <= 10) && y == 0) && c == 0)) || ((((y == 5 && (y * k == y * y || c < k)) && 6 * (y * y * y * y * y) + 5 * (y * y * y * y) + 2 * (y * y * y * y * y * y) == 12 * x + y * y) && k <= 10) && c == 5)) || (((((y * k == y * y || c < k) && 6 * (y * y * y * y * y) + 5 * (y * y * y * y) + 2 * (y * y * y * y * y * y) == 12 * x + y * y) && y == 7) && k <= 10) && c == 7)) || (((((y == 9 && c <= 9) && 6 * (y * y * y * y * y) + 5 * (y * y * y * y) + 2 * (y * y * y * y * y * y) == 12 * x + y * y) && 9 <= c) && k <= 10) && 8 < k)) || ((((c == 2 && 6 * (y * y * y * y * y) + 5 * (y * y * y * y) + 2 * (y * y * y * y * y * y) == 12 * x + y * y) && k <= 10) && 1 < k) && y == 2) RESULT: Ultimate proved your program to be correct! [2023-02-15 21:35:33,839 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