./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 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_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-?-26d01a9 [2023-02-17 02:31:00,848 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 02:31:00,850 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 02:31:00,882 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 02:31:00,882 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 02:31:00,885 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 02:31:00,887 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 02:31:00,889 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 02:31:00,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 02:31:00,895 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 02:31:00,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 02:31:00,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 02:31:00,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 02:31:00,901 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 02:31:00,903 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 02:31:00,904 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 02:31:00,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 02:31:00,907 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 02:31:00,908 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 02:31:00,912 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 02:31:00,914 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 02:31:00,915 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 02:31:00,916 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 02:31:00,916 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 02:31:00,924 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 02:31:00,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 02:31:00,924 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 02:31:00,926 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 02:31:00,926 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 02:31:00,927 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 02:31:00,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 02:31:00,929 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 02:31:00,930 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 02:31:00,931 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 02:31:00,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 02:31:00,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 02:31:00,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 02:31:00,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 02:31:00,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 02:31:00,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 02:31:00,941 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 02:31:00,942 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 02:31:00,980 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 02:31:00,980 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 02:31:00,981 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 02:31:00,981 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 02:31:00,982 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 02:31:00,982 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 02:31:00,982 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 02:31:00,983 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 02:31:00,983 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 02:31:00,983 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 02:31:00,984 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 02:31:00,984 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 02:31:00,984 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 02:31:00,984 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 02:31:00,985 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 02:31:00,985 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 02:31:00,985 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 02:31:00,985 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 02:31:00,985 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 02:31:00,985 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 02:31:00,986 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 02:31:00,986 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 02:31:00,986 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 02:31:00,986 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 02:31:00,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:31:00,987 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 02:31:00,987 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 02:31:00,987 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 02:31:00,988 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 02:31:00,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 02:31:00,988 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 02:31:00,988 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 02:31:00,989 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 02:31:00,989 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 02:31:00,989 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 02:31:00,989 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-17 02:31:01,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 02:31:01,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 02:31:01,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 02:31:01,259 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 02:31:01,260 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 02:31:01,261 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-17 02:31:02,531 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 02:31:02,745 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 02:31:02,745 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound10.c [2023-02-17 02:31:02,751 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/717b0e35f/a2510926a00641ce8fdcef0b51860cbf/FLAG08f22e811 [2023-02-17 02:31:02,761 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/717b0e35f/a2510926a00641ce8fdcef0b51860cbf [2023-02-17 02:31:02,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 02:31:02,765 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 02:31:02,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 02:31:02,766 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 02:31:02,771 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 02:31:02,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:31:02" (1/1) ... [2023-02-17 02:31:02,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b90232b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:31:02, skipping insertion in model container [2023-02-17 02:31:02,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:31:02" (1/1) ... [2023-02-17 02:31:02,779 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 02:31:02,795 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 02:31:02,933 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-17 02:31:02,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:31:02,960 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 02:31:02,972 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-17 02:31:02,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:31:02,993 INFO L208 MainTranslator]: Completed translation [2023-02-17 02:31:02,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:31:02 WrapperNode [2023-02-17 02:31:02,994 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 02:31:02,995 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 02:31:02,995 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 02:31:02,995 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 02:31:03,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:31:02" (1/1) ... [2023-02-17 02:31:03,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:31:02" (1/1) ... [2023-02-17 02:31:03,017 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2023-02-17 02:31:03,017 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 02:31:03,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 02:31:03,018 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 02:31:03,018 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 02:31:03,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:31:02" (1/1) ... [2023-02-17 02:31:03,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:31:02" (1/1) ... [2023-02-17 02:31:03,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:31:02" (1/1) ... [2023-02-17 02:31:03,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:31:02" (1/1) ... [2023-02-17 02:31:03,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:31:02" (1/1) ... [2023-02-17 02:31:03,031 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:31:02" (1/1) ... [2023-02-17 02:31:03,032 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:31:02" (1/1) ... [2023-02-17 02:31:03,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:31:02" (1/1) ... [2023-02-17 02:31:03,035 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 02:31:03,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 02:31:03,036 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 02:31:03,036 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 02:31:03,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:31:02" (1/1) ... [2023-02-17 02:31:03,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:31:03,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:31:03,074 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-17 02:31:03,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-17 02:31:03,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 02:31:03,113 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-17 02:31:03,113 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-17 02:31:03,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 02:31:03,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 02:31:03,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 02:31:03,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-17 02:31:03,116 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-17 02:31:03,170 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 02:31:03,173 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 02:31:03,300 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 02:31:03,305 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 02:31:03,305 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-17 02:31:03,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:31:03 BoogieIcfgContainer [2023-02-17 02:31:03,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 02:31:03,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 02:31:03,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 02:31:03,312 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 02:31:03,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 02:31:02" (1/3) ... [2023-02-17 02:31:03,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a76b62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:31:03, skipping insertion in model container [2023-02-17 02:31:03,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:31:02" (2/3) ... [2023-02-17 02:31:03,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a76b62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:31:03, skipping insertion in model container [2023-02-17 02:31:03,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:31:03" (3/3) ... [2023-02-17 02:31:03,315 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound10.c [2023-02-17 02:31:03,330 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 02:31:03,330 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 02:31:03,373 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 02:31:03,379 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;@14454761, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 02:31:03,379 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 02:31:03,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-17 02:31:03,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 02:31:03,389 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:31:03,390 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:31:03,391 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:31:03,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:31:03,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1845349065, now seen corresponding path program 1 times [2023-02-17 02:31:03,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:31:03,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956929161] [2023-02-17 02:31:03,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:31:03,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:31:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:31:03,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:31:03,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956929161] [2023-02-17 02:31:03,544 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-17 02:31:03,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694260982] [2023-02-17 02:31:03,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:31:03,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:31:03,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:31:03,553 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:31:03,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 02:31:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:31:03,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-17 02:31:03,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:31:03,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 02:31:03,694 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:31:03,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694260982] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:31:03,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:31:03,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 02:31:03,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333401921] [2023-02-17 02:31:03,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:31:03,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 02:31:03,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:31:03,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 02:31:03,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 02:31:03,739 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 02:31:03,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:31:03,775 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2023-02-17 02:31:03,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 02:31:03,777 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-02-17 02:31:03,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:31:03,783 INFO L225 Difference]: With dead ends: 45 [2023-02-17 02:31:03,784 INFO L226 Difference]: Without dead ends: 20 [2023-02-17 02:31:03,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 02:31:03,793 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:31:03,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:31:03,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-17 02:31:03,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-02-17 02:31:03,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 02:31:03,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2023-02-17 02:31:03,824 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 18 [2023-02-17 02:31:03,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:31:03,824 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-02-17 02:31:03,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 02:31:03,825 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2023-02-17 02:31:03,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 02:31:03,826 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:31:03,826 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:31:03,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-17 02:31:04,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-17 02:31:04,027 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:31:04,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:31:04,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1506842435, now seen corresponding path program 1 times [2023-02-17 02:31:04,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:31:04,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126861922] [2023-02-17 02:31:04,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:31:04,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:31:04,055 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:31:04,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [335842196] [2023-02-17 02:31:04,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:31:04,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:31:04,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:31:04,058 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:31:04,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 02:31:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:31:04,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 02:31:04,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:31:04,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 02:31:04,151 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:31:04,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:31:04,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126861922] [2023-02-17 02:31:04,152 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:31:04,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335842196] [2023-02-17 02:31:04,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335842196] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:31:04,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:31:04,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:31:04,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767194182] [2023-02-17 02:31:04,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:31:04,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:31:04,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:31:04,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:31:04,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:31:04,156 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 02:31:04,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:31:04,288 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2023-02-17 02:31:04,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 02:31:04,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2023-02-17 02:31:04,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:31:04,290 INFO L225 Difference]: With dead ends: 31 [2023-02-17 02:31:04,290 INFO L226 Difference]: Without dead ends: 27 [2023-02-17 02:31:04,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:31:04,292 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:31:04,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 69 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:31:04,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-17 02:31:04,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-02-17 02:31:04,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-17 02:31:04,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-02-17 02:31:04,302 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 18 [2023-02-17 02:31:04,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:31:04,303 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-02-17 02:31:04,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 02:31:04,303 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-02-17 02:31:04,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-17 02:31:04,304 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:31:04,304 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:31:04,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-17 02:31:04,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-02-17 02:31:04,510 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:31:04,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:31:04,511 INFO L85 PathProgramCache]: Analyzing trace with hash 903983968, now seen corresponding path program 1 times [2023-02-17 02:31:04,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:31:04,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324250597] [2023-02-17 02:31:04,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:31:04,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:31:04,526 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:31:04,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1580626092] [2023-02-17 02:31:04,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:31:04,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:31:04,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:31:04,531 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:31:04,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 02:31:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:31:04,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 02:31:04,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:31:04,728 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 02:31:04,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:31:05,101 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 02:31:05,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:31:05,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324250597] [2023-02-17 02:31:05,102 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:31:05,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580626092] [2023-02-17 02:31:05,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580626092] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:31:05,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:31:05,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2023-02-17 02:31:05,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74391831] [2023-02-17 02:31:05,103 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:31:05,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 02:31:05,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:31:05,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 02:31:05,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-02-17 02:31:05,106 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 02:31:05,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:31:05,219 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2023-02-17 02:31:05,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 02:31:05,220 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2023-02-17 02:31:05,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:31:05,223 INFO L225 Difference]: With dead ends: 38 [2023-02-17 02:31:05,223 INFO L226 Difference]: Without dead ends: 34 [2023-02-17 02:31:05,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-02-17 02:31:05,227 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:31:05,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 89 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:31:05,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-17 02:31:05,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2023-02-17 02:31:05,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-17 02:31:05,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2023-02-17 02:31:05,237 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2023-02-17 02:31:05,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:31:05,238 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2023-02-17 02:31:05,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 02:31:05,238 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2023-02-17 02:31:05,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-17 02:31:05,239 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:31:05,239 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:31:05,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-17 02:31:05,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:31:05,444 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:31:05,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:31:05,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1648043046, now seen corresponding path program 1 times [2023-02-17 02:31:05,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:31:05,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499877202] [2023-02-17 02:31:05,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:31:05,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:31:05,456 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:31:05,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1428388102] [2023-02-17 02:31:05,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:31:05,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:31:05,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:31:05,458 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:31:05,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-17 02:31:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:31:05,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-17 02:31:05,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:31:07,651 WARN L859 $PredicateComparison]: unable to prove that (and (< 0 |c_ULTIMATE.start_main_~k~0#1|) (= |c_ULTIMATE.start_main_~y~0#1| (+ 0 1)) (<= |c_ULTIMATE.start_main_~k~0#1| 1) (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 5) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 11) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))) is different from true [2023-02-17 02:31:07,689 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-17 02:31:07,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:31:09,727 WARN L837 $PredicateComparison]: unable to prove that (or (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 5) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 11) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))) (= (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~k~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) is different from false [2023-02-17 02:31:13,772 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| Int)) (or (= (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|)) (= (mod (+ (* 6 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* 2 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* 11 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* 5 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|)) 12) 0)))) is different from true [2023-02-17 02:31:19,805 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (= c___VERIFIER_assert_~cond 0) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| Int)) (or (= (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|)) (= (mod (+ (* 6 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* 2 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* 11 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* 5 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|)) 12) 0)))) is different from true [2023-02-17 02:31:29,622 WARN L837 $PredicateComparison]: unable to prove that (or (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 5) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 11) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1| 1))) (= (* |ULTIMATE.start_main_~k~0#1| .cse0) (* .cse0 .cse0))) (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|)))) is different from false [2023-02-17 02:31:29,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:31:29,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499877202] [2023-02-17 02:31:29,633 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:31:29,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428388102] [2023-02-17 02:31:29,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428388102] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:31:29,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 02:31:29,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2023-02-17 02:31:29,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297598889] [2023-02-17 02:31:29,634 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 02:31:29,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 02:31:29,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:31:29,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 02:31:29,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=106, Unknown=7, NotChecked=120, Total=272 [2023-02-17 02:31:29,636 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-17 02:31:31,724 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 0 1))) (and (< 0 |c_ULTIMATE.start_main_~k~0#1|) (= |c_ULTIMATE.start_main_~y~0#1| .cse0) (<= |c_ULTIMATE.start_main_~k~0#1| 1) (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 5) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 11) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12)) (<= |c_ULTIMATE.start_main_~c~0#1| .cse0))) is different from true [2023-02-17 02:31:31,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:31:31,754 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2023-02-17 02:31:31,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 02:31:31,755 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 36 [2023-02-17 02:31:31,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:31:31,756 INFO L225 Difference]: With dead ends: 38 [2023-02-17 02:31:31,756 INFO L226 Difference]: Without dead ends: 32 [2023-02-17 02:31:31,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=60, Invalid=166, Unknown=8, NotChecked=186, Total=420 [2023-02-17 02:31:31,757 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:31:31,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 106 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 41 Unchecked, 0.1s Time] [2023-02-17 02:31:31,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-17 02:31:31,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-17 02:31:31,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 02:31:31,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2023-02-17 02:31:31,774 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 36 [2023-02-17 02:31:31,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:31:31,775 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2023-02-17 02:31:31,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-17 02:31:31,775 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2023-02-17 02:31:31,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-17 02:31:31,777 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:31:31,777 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:31:31,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-17 02:31:31,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:31:31,978 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:31:31,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:31:31,978 INFO L85 PathProgramCache]: Analyzing trace with hash -426505545, now seen corresponding path program 2 times [2023-02-17 02:31:31,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:31:31,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385154788] [2023-02-17 02:31:31,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:31:31,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:31:31,993 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:31:31,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [456393170] [2023-02-17 02:31:31,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 02:31:31,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:31:31,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:31:31,995 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:31:32,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-17 02:31:32,055 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 02:31:32,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:31:32,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-17 02:31:32,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:31:32,131 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-17 02:31:32,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:31:32,243 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-17 02:31:32,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:31:32,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385154788] [2023-02-17 02:31:32,245 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:31:32,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456393170] [2023-02-17 02:31:32,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456393170] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:31:32,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:31:32,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2023-02-17 02:31:32,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234545008] [2023-02-17 02:31:32,246 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:31:32,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-17 02:31:32,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:31:32,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-17 02:31:32,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-02-17 02:31:32,248 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 17 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 9 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) [2023-02-17 02:31:32,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:31:32,561 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2023-02-17 02:31:32,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-17 02:31:32,561 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 9 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) Word has length 43 [2023-02-17 02:31:32,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:31:32,562 INFO L225 Difference]: With dead ends: 51 [2023-02-17 02:31:32,562 INFO L226 Difference]: Without dead ends: 43 [2023-02-17 02:31:32,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2023-02-17 02:31:32,563 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 20 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:31:32,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 165 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:31:32,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-17 02:31:32,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2023-02-17 02:31:32,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-17 02:31:32,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2023-02-17 02:31:32,577 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 43 [2023-02-17 02:31:32,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:31:32,577 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2023-02-17 02:31:32,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 9 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) [2023-02-17 02:31:32,578 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2023-02-17 02:31:32,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-17 02:31:32,579 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:31:32,579 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:31:32,587 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-17 02:31:32,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:31:32,785 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:31:32,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:31:32,786 INFO L85 PathProgramCache]: Analyzing trace with hash 66449050, now seen corresponding path program 3 times [2023-02-17 02:31:32,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:31:32,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611545551] [2023-02-17 02:31:32,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:31:32,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:31:32,797 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:31:32,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [586863149] [2023-02-17 02:31:32,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 02:31:32,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:31:32,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:31:32,809 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:31:32,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-17 02:31:32,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-02-17 02:31:32,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:31:33,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-17 02:31:33,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:31:35,045 WARN L859 $PredicateComparison]: unable to prove that (and (= (+ 1 1) (+ |c_ULTIMATE.start_main_~c~0#1| (- 1))) (= |c_ULTIMATE.start_main_~y~0#1| (+ 2 1)) (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 5) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 11) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))) is different from true [2023-02-17 02:31:37,168 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 50 refuted. 0 times theorem prover too weak. 70 trivial. 5 not checked. [2023-02-17 02:31:37,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:31:45,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:31:45,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611545551] [2023-02-17 02:31:45,277 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:31:45,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586863149] [2023-02-17 02:31:45,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586863149] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:31:45,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 02:31:45,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2023-02-17 02:31:45,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803610308] [2023-02-17 02:31:45,278 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 02:31:45,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 02:31:45,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:31:45,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 02:31:45,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=4, NotChecked=30, Total=306 [2023-02-17 02:31:45,279 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 8 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2023-02-17 02:31:47,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 02:31:49,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 02:31:51,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 02:31:53,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 02:31:55,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 02:31:59,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 02:32:01,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 02:32:03,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 02:32:05,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 02:32:07,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 02:32:09,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 02:32:11,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 02:32:14,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 02:32:14,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:32:14,006 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2023-02-17 02:32:14,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 02:32:14,007 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 8 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 64 [2023-02-17 02:32:14,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:32:14,011 INFO L225 Difference]: With dead ends: 50 [2023-02-17 02:32:14,011 INFO L226 Difference]: Without dead ends: 44 [2023-02-17 02:32:14,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=4, NotChecked=36, Total=420 [2023-02-17 02:32:14,012 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 26.7s IncrementalHoareTripleChecker+Time [2023-02-17 02:32:14,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 187 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 269 Invalid, 13 Unknown, 51 Unchecked, 26.7s Time] [2023-02-17 02:32:14,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-17 02:32:14,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-02-17 02:32:14,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:32:14,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2023-02-17 02:32:14,027 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 64 [2023-02-17 02:32:14,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:32:14,027 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2023-02-17 02:32:14,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 8 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2023-02-17 02:32:14,028 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2023-02-17 02:32:14,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-17 02:32:14,028 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:32:14,029 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:32:14,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-17 02:32:14,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:32:14,235 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:32:14,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:32:14,235 INFO L85 PathProgramCache]: Analyzing trace with hash 357326839, now seen corresponding path program 4 times [2023-02-17 02:32:14,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:32:14,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218355171] [2023-02-17 02:32:14,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:32:14,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:32:14,244 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:32:14,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1490886613] [2023-02-17 02:32:14,244 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 02:32:14,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:32:14,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:32:14,246 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:32:14,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-17 02:32:14,288 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 02:32:14,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:32:14,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-17 02:32:14,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:32:14,405 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 16 proven. 66 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2023-02-17 02:32:14,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:32:14,619 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 16 proven. 63 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2023-02-17 02:32:14,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:32:14,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218355171] [2023-02-17 02:32:14,620 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:32:14,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490886613] [2023-02-17 02:32:14,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490886613] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:32:14,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:32:14,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2023-02-17 02:32:14,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583098381] [2023-02-17 02:32:14,621 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:32:14,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-17 02:32:14,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:32:14,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-17 02:32:14,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2023-02-17 02:32:14,623 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 25 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 18 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 18 states have call predecessors, (20), 18 states have call successors, (20) [2023-02-17 02:32:15,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:32:15,499 INFO L93 Difference]: Finished difference Result 75 states and 97 transitions. [2023-02-17 02:32:15,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-17 02:32:15,499 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 18 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 18 states have call predecessors, (20), 18 states have call successors, (20) Word has length 71 [2023-02-17 02:32:15,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:32:15,500 INFO L225 Difference]: With dead ends: 75 [2023-02-17 02:32:15,500 INFO L226 Difference]: Without dead ends: 67 [2023-02-17 02:32:15,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=335, Invalid=1387, Unknown=0, NotChecked=0, Total=1722 [2023-02-17 02:32:15,505 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 49 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 02:32:15,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 339 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 02:32:15,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-02-17 02:32:15,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2023-02-17 02:32:15,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-02-17 02:32:15,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2023-02-17 02:32:15,538 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 71 [2023-02-17 02:32:15,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:32:15,539 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2023-02-17 02:32:15,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 18 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 18 states have call predecessors, (20), 18 states have call successors, (20) [2023-02-17 02:32:15,540 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2023-02-17 02:32:15,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-02-17 02:32:15,543 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:32:15,543 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 14, 14, 14, 13, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:32:15,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-17 02:32:15,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:32:15,751 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:32:15,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:32:15,752 INFO L85 PathProgramCache]: Analyzing trace with hash 2004694042, now seen corresponding path program 5 times [2023-02-17 02:32:15,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:32:15,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81655280] [2023-02-17 02:32:15,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:32:15,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:32:15,776 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:32:15,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1891262299] [2023-02-17 02:32:15,777 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-17 02:32:15,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:32:15,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:32:15,783 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:32:15,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-17 02:32:16,627 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2023-02-17 02:32:16,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:32:16,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 02:32:16,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:32:16,794 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 403 proven. 3 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2023-02-17 02:32:16,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:32:16,952 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 303 proven. 3 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2023-02-17 02:32:16,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:32:16,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81655280] [2023-02-17 02:32:16,953 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:32:16,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891262299] [2023-02-17 02:32:16,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891262299] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:32:16,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:32:16,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2023-02-17 02:32:16,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003566270] [2023-02-17 02:32:16,954 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:32:16,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-17 02:32:16,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:32:16,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-17 02:32:16,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=694, Unknown=0, NotChecked=0, Total=1056 [2023-02-17 02:32:16,956 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand has 33 states, 33 states have (on average 2.242424242424242) internal successors, (74), 31 states have internal predecessors, (74), 30 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 29 states have call predecessors, (34), 30 states have call successors, (34) [2023-02-17 02:32:17,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:32:17,091 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2023-02-17 02:32:17,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-17 02:32:17,092 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.242424242424242) internal successors, (74), 31 states have internal predecessors, (74), 30 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 29 states have call predecessors, (34), 30 states have call successors, (34) Word has length 120 [2023-02-17 02:32:17,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:32:17,093 INFO L225 Difference]: With dead ends: 71 [2023-02-17 02:32:17,093 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 02:32:17,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=367, Invalid=755, Unknown=0, NotChecked=0, Total=1122 [2023-02-17 02:32:17,094 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 3 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:32:17,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 252 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:32:17,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 02:32:17,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 02:32:17,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 02:32:17,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 02:32:17,095 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 120 [2023-02-17 02:32:17,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:32:17,095 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 02:32:17,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.242424242424242) internal successors, (74), 31 states have internal predecessors, (74), 30 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 29 states have call predecessors, (34), 30 states have call successors, (34) [2023-02-17 02:32:17,096 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 02:32:17,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 02:32:17,098 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 02:32:17,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-02-17 02:32:17,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-02-17 02:32:17,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 02:32:17,324 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 02:32:17,325 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (let ((.cse35 (+ |ULTIMATE.start_main_~c~0#1| 1))) (let ((.cse31 (+ |ULTIMATE.start_main_~y~0#1| 1)) (.cse36 (+ .cse35 1))) (let ((.cse37 (+ .cse36 1)) (.cse33 (+ .cse31 1))) (let ((.cse25 (+ .cse33 1)) (.cse34 (+ .cse37 1))) (let ((.cse14 (+ 0 1)) (.cse18 (+ .cse34 1)) (.cse28 (+ .cse25 1))) (let ((.cse26 (< .cse37 |ULTIMATE.start_main_~k~0#1|)) (.cse30 (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (.cse24 (< .cse36 |ULTIMATE.start_main_~k~0#1|)) (.cse32 (< .cse35 |ULTIMATE.start_main_~k~0#1|)) (.cse20 (+ .cse28 1)) (.cse27 (< .cse34 |ULTIMATE.start_main_~k~0#1|)) (.cse21 (< .cse18 |ULTIMATE.start_main_~k~0#1|)) (.cse29 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse23 (= |ULTIMATE.start_main_~y~0#1| .cse14)) (.cse6 (+ (- 1) |ULTIMATE.start_main_~y~0#1|))) (let ((.cse13 (+ (- 1) .cse6)) (.cse3 (+ 1 1)) (.cse16 (+ 3 1)) (.cse1 (+ 2 1)) (.cse17 (= (mod (+ (* 6 |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| 11) (* 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|) (* 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|)) 12) 0)) (.cse15 (+ 4 1)) (.cse0 (>= |ULTIMATE.start_main_~k~0#1| 0)) (.cse2 (or (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (+ (- (* (* (* (* 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|)) (+ (- (* (* |ULTIMATE.start_main_~y~0#1| (* (* (* 6 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|)) |ULTIMATE.start_main_~y~0#1|)) (* (* (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| (* (- 2) |ULTIMATE.start_main_~y~0#1|)))) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|))) .cse29)) 0) (and .cse23 (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 0)))) (.cse22 (or (= (* .cse20 .cse20) (* .cse20 |ULTIMATE.start_main_~k~0#1|)) (not .cse27) .cse21)) (.cse4 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)) (.cse5 (<= |ULTIMATE.start_main_~k~0#1| 10)) (.cse10 (or (= (* .cse33 .cse33) (* |ULTIMATE.start_main_~k~0#1| .cse33)) .cse24 (not .cse32))) (.cse7 (or (= (* .cse31 |ULTIMATE.start_main_~k~0#1|) (* .cse31 .cse31)) (not .cse30) .cse32)) (.cse8 (or (= (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse29) .cse30)) (.cse9 (<= |ULTIMATE.start_main_~k~0#1| 256)) (.cse11 (or .cse27 (not .cse26) (= (* .cse28 .cse28) (* .cse28 |ULTIMATE.start_main_~k~0#1|)))) (.cse12 (or (not .cse24) (= (* .cse25 |ULTIMATE.start_main_~k~0#1|) (* .cse25 .cse25)) .cse26))) (or (and .cse0 (= .cse1 |ULTIMATE.start_main_~c~0#1|) .cse2 (= .cse3 .cse4) (= .cse1 |ULTIMATE.start_main_~y~0#1|) .cse5 (= .cse3 .cse6) .cse7 .cse8 .cse9 (<= 2 .cse4)) (and .cse0 .cse2 (<= 7 .cse4) .cse5 .cse10 .cse7 .cse8 .cse9 .cse11 .cse12) (and .cse0 (= .cse3 |ULTIMATE.start_main_~y~0#1|) .cse2 (<= 1 .cse4) (= .cse3 |ULTIMATE.start_main_~c~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| .cse3) (= .cse13 0) .cse5 .cse10 .cse7 .cse8 .cse9 (= .cse4 .cse14)) (and .cse0 (= .cse13 .cse1) (<= 4 .cse4) .cse2 (= |ULTIMATE.start_main_~c~0#1| .cse15) .cse5 (= .cse3 (+ (- 1) .cse13)) (< .cse16 |ULTIMATE.start_main_~k~0#1|) .cse8 .cse9 (<= |ULTIMATE.start_main_~c~0#1| (+ .cse16 1)) .cse17) (and (= .cse1 .cse4) .cse0 (= .cse13 .cse3) .cse2 (= |ULTIMATE.start_main_~c~0#1| .cse16) (<= 3 .cse4) .cse5 (= .cse6 .cse1) .cse8 .cse9 .cse17) (and .cse0 (<= 5 .cse4) (or (< (+ .cse18 1) |ULTIMATE.start_main_~k~0#1|) (let ((.cse19 (+ .cse20 1))) (= (* .cse19 .cse19) (* |ULTIMATE.start_main_~k~0#1| .cse19))) (not .cse21)) .cse2 .cse22 .cse5 .cse10 .cse7 (< .cse15 |ULTIMATE.start_main_~k~0#1|) .cse9 (= (+ 5 1) |ULTIMATE.start_main_~y~0#1|) .cse11 .cse12 (<= |ULTIMATE.start_main_~c~0#1| (+ .cse15 1))) (and .cse0 (<= 0 .cse4) .cse2 (= .cse4 0) (= .cse6 0) .cse23 .cse5 (<= |ULTIMATE.start_main_~c~0#1| .cse14) (< 0 |ULTIMATE.start_main_~k~0#1|) .cse8 .cse9 (= |ULTIMATE.start_main_~c~0#1| .cse14)) (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 (= |ULTIMATE.start_main_~y~0#1| 0) (>= |ULTIMATE.start_main_~c~0#1| 0) .cse5 .cse9 (= |ULTIMATE.start_main_~x~0#1| 0)) (and .cse0 (<= 9 .cse4) .cse2 .cse5 .cse10 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse5 .cse10 .cse7 .cse8 .cse9 (<= 8 .cse4) .cse12) (and .cse0 .cse2 .cse22 (<= 6 .cse4) .cse5 .cse10 .cse7 .cse8 .cse9 .cse11 .cse12))))))))) [2023-02-17 02:32:17,325 INFO L899 garLoopResultBuilder]: For program point L29-1(lines 28 37) no Hoare annotation was computed. [2023-02-17 02:32:17,325 INFO L902 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2023-02-17 02:32:17,325 INFO L895 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: (and (>= |ULTIMATE.start_main_~k~0#1| 0) (<= |ULTIMATE.start_main_~k~0#1| 10) (<= |ULTIMATE.start_main_~k~0#1| 256)) [2023-02-17 02:32:17,325 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 02:32:17,325 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 17 42) the Hoare annotation is: true [2023-02-17 02:32:17,326 INFO L899 garLoopResultBuilder]: For program point L40(line 40) no Hoare annotation was computed. [2023-02-17 02:32:17,326 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 02:32:17,326 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 02:32:17,326 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 37) the Hoare annotation is: (let ((.cse35 (+ |ULTIMATE.start_main_~c~0#1| 1))) (let ((.cse31 (+ |ULTIMATE.start_main_~y~0#1| 1)) (.cse36 (+ .cse35 1))) (let ((.cse37 (+ .cse36 1)) (.cse33 (+ .cse31 1))) (let ((.cse25 (+ .cse33 1)) (.cse34 (+ .cse37 1))) (let ((.cse14 (+ 0 1)) (.cse18 (+ .cse34 1)) (.cse28 (+ .cse25 1))) (let ((.cse26 (< .cse37 |ULTIMATE.start_main_~k~0#1|)) (.cse30 (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (.cse24 (< .cse36 |ULTIMATE.start_main_~k~0#1|)) (.cse32 (< .cse35 |ULTIMATE.start_main_~k~0#1|)) (.cse20 (+ .cse28 1)) (.cse27 (< .cse34 |ULTIMATE.start_main_~k~0#1|)) (.cse21 (< .cse18 |ULTIMATE.start_main_~k~0#1|)) (.cse29 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse23 (= |ULTIMATE.start_main_~y~0#1| .cse14)) (.cse6 (+ (- 1) |ULTIMATE.start_main_~y~0#1|))) (let ((.cse13 (+ (- 1) .cse6)) (.cse3 (+ 1 1)) (.cse16 (+ 3 1)) (.cse1 (+ 2 1)) (.cse17 (= (mod (+ (* 6 |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| 11) (* 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|) (* 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|)) 12) 0)) (.cse15 (+ 4 1)) (.cse0 (>= |ULTIMATE.start_main_~k~0#1| 0)) (.cse2 (or (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (+ (- (* (* (* (* 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|)) (+ (- (* (* |ULTIMATE.start_main_~y~0#1| (* (* (* 6 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|)) |ULTIMATE.start_main_~y~0#1|)) (* (* (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| (* (- 2) |ULTIMATE.start_main_~y~0#1|)))) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|))) .cse29)) 0) (and .cse23 (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 0)))) (.cse22 (or (= (* .cse20 .cse20) (* .cse20 |ULTIMATE.start_main_~k~0#1|)) (not .cse27) .cse21)) (.cse4 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)) (.cse5 (<= |ULTIMATE.start_main_~k~0#1| 10)) (.cse10 (or (= (* .cse33 .cse33) (* |ULTIMATE.start_main_~k~0#1| .cse33)) .cse24 (not .cse32))) (.cse7 (or (= (* .cse31 |ULTIMATE.start_main_~k~0#1|) (* .cse31 .cse31)) (not .cse30) .cse32)) (.cse8 (or (= (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse29) .cse30)) (.cse9 (<= |ULTIMATE.start_main_~k~0#1| 256)) (.cse11 (or .cse27 (not .cse26) (= (* .cse28 .cse28) (* .cse28 |ULTIMATE.start_main_~k~0#1|)))) (.cse12 (or (not .cse24) (= (* .cse25 |ULTIMATE.start_main_~k~0#1|) (* .cse25 .cse25)) .cse26))) (or (and .cse0 (= .cse1 |ULTIMATE.start_main_~c~0#1|) .cse2 (= .cse3 .cse4) (= .cse1 |ULTIMATE.start_main_~y~0#1|) .cse5 (= .cse3 .cse6) .cse7 .cse8 .cse9 (<= 2 .cse4)) (and .cse0 .cse2 (<= 7 .cse4) .cse5 .cse10 .cse7 .cse8 .cse9 .cse11 .cse12) (and .cse0 (= .cse3 |ULTIMATE.start_main_~y~0#1|) .cse2 (<= 1 .cse4) (= .cse3 |ULTIMATE.start_main_~c~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| .cse3) (= .cse13 0) .cse5 .cse10 .cse7 .cse8 .cse9 (= .cse4 .cse14)) (and .cse0 (= .cse13 .cse1) (<= 4 .cse4) .cse2 (= |ULTIMATE.start_main_~c~0#1| .cse15) .cse5 (= .cse3 (+ (- 1) .cse13)) (< .cse16 |ULTIMATE.start_main_~k~0#1|) .cse8 .cse9 (<= |ULTIMATE.start_main_~c~0#1| (+ .cse16 1)) .cse17) (and (= .cse1 .cse4) .cse0 (= .cse13 .cse3) .cse2 (= |ULTIMATE.start_main_~c~0#1| .cse16) (<= 3 .cse4) .cse5 (= .cse6 .cse1) .cse8 .cse9 .cse17) (and .cse0 (<= 5 .cse4) (or (< (+ .cse18 1) |ULTIMATE.start_main_~k~0#1|) (let ((.cse19 (+ .cse20 1))) (= (* .cse19 .cse19) (* |ULTIMATE.start_main_~k~0#1| .cse19))) (not .cse21)) .cse2 .cse22 .cse5 .cse10 .cse7 (< .cse15 |ULTIMATE.start_main_~k~0#1|) .cse9 (= (+ 5 1) |ULTIMATE.start_main_~y~0#1|) .cse11 .cse12 (<= |ULTIMATE.start_main_~c~0#1| (+ .cse15 1))) (and .cse0 (<= 0 .cse4) .cse2 (= .cse4 0) (= .cse6 0) .cse23 .cse5 (<= |ULTIMATE.start_main_~c~0#1| .cse14) (< 0 |ULTIMATE.start_main_~k~0#1|) .cse8 .cse9 (= |ULTIMATE.start_main_~c~0#1| .cse14)) (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 (= |ULTIMATE.start_main_~y~0#1| 0) (>= |ULTIMATE.start_main_~c~0#1| 0) .cse5 .cse9 (= |ULTIMATE.start_main_~x~0#1| 0)) (and .cse0 (<= 9 .cse4) .cse2 .cse5 .cse10 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse5 .cse10 .cse7 .cse8 .cse9 (<= 8 .cse4) .cse12) (and .cse0 .cse2 .cse22 (<= 6 .cse4) .cse5 .cse10 .cse7 .cse8 .cse9 .cse11 .cse12))))))))) [2023-02-17 02:32:17,327 INFO L895 garLoopResultBuilder]: At program point L28-3(lines 28 37) the Hoare annotation is: (let ((.cse32 (+ |ULTIMATE.start_main_~c~0#1| 1))) (let ((.cse16 (+ |ULTIMATE.start_main_~y~0#1| 1)) (.cse31 (+ .cse32 1))) (let ((.cse30 (+ .cse31 1)) (.cse18 (+ .cse16 1))) (let ((.cse21 (+ .cse18 1)) (.cse29 (+ .cse30 1))) (let ((.cse27 (+ .cse29 1)) (.cse24 (+ .cse21 1)) (.cse13 (+ 0 1))) (let ((.cse17 (< .cse32 |ULTIMATE.start_main_~k~0#1|)) (.cse12 (= |ULTIMATE.start_main_~y~0#1| .cse13)) (.cse19 (< .cse31 |ULTIMATE.start_main_~k~0#1|)) (.cse22 (< .cse30 |ULTIMATE.start_main_~k~0#1|)) (.cse23 (< .cse29 |ULTIMATE.start_main_~k~0#1|)) (.cse25 (+ .cse24 1)) (.cse26 (< .cse27 |ULTIMATE.start_main_~k~0#1|)) (.cse20 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse0 (>= |ULTIMATE.start_main_~k~0#1| 0)) (.cse11 (= (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse20)) (.cse1 (or (< (+ .cse27 1) |ULTIMATE.start_main_~k~0#1|) (let ((.cse28 (+ .cse25 1))) (= (* .cse28 .cse28) (* |ULTIMATE.start_main_~k~0#1| .cse28))) (not .cse26))) (.cse3 (or (= (* .cse25 .cse25) (* .cse25 |ULTIMATE.start_main_~k~0#1|)) (not .cse23) .cse26)) (.cse4 (<= |ULTIMATE.start_main_~k~0#1| 10)) (.cse9 (or .cse23 (not .cse22) (= (* .cse24 .cse24) (* .cse24 |ULTIMATE.start_main_~k~0#1|)))) (.cse10 (or (not .cse19) (= (* .cse21 |ULTIMATE.start_main_~k~0#1|) (* .cse21 .cse21)) .cse22)) (.cse2 (or (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (+ (- (* (* (* (* 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|)) (+ (- (* (* |ULTIMATE.start_main_~y~0#1| (* (* (* 6 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|)) |ULTIMATE.start_main_~y~0#1|)) (* (* (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| (* (- 2) |ULTIMATE.start_main_~y~0#1|)))) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|))) .cse20)) 0) (and .cse12 (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 0)))) (.cse14 (+ (- 1) (+ (- 1) |ULTIMATE.start_main_~y~0#1|))) (.cse5 (or (= (* .cse18 .cse18) (* |ULTIMATE.start_main_~k~0#1| .cse18)) .cse19 (not .cse17))) (.cse6 (or (= (* .cse16 |ULTIMATE.start_main_~k~0#1|) (* .cse16 .cse16)) (not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) .cse17)) (.cse8 (<= |ULTIMATE.start_main_~k~0#1| 256))) (or (let ((.cse7 (+ 4 1))) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_main_~k~0#1| 6) .cse3 .cse4 .cse5 .cse6 (< .cse7 |ULTIMATE.start_main_~k~0#1|) .cse8 (= (+ 5 1) |ULTIMATE.start_main_~y~0#1|) .cse9 .cse10 (<= |ULTIMATE.start_main_~c~0#1| (+ .cse7 1)))) (and .cse11 .cse2 .cse5 .cse6 .cse8) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10) (and (<= |ULTIMATE.start_main_~k~0#1| 1) .cse2 .cse12 (<= |ULTIMATE.start_main_~c~0#1| .cse13) (< 0 |ULTIMATE.start_main_~k~0#1|)) (and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0)) (let ((.cse15 (+ 3 1))) (and (= .cse14 (+ 2 1)) .cse2 (<= |ULTIMATE.start_main_~k~0#1| 5) .cse5 (< .cse15 |ULTIMATE.start_main_~k~0#1|) .cse6 .cse8 (<= |ULTIMATE.start_main_~c~0#1| (+ .cse15 1)) (= (mod (+ (* 6 |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| 11) (* 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|) (* 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|)) 12) 0))) (and (<= |ULTIMATE.start_main_~k~0#1| 2) .cse2 (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| (+ 1 1)) (= .cse14 0) .cse5 .cse6 .cse8))))))))) [2023-02-17 02:32:17,327 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2023-02-17 02:32:17,327 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse33 (+ |ULTIMATE.start_main_~c~0#1| 1))) (let ((.cse17 (+ |ULTIMATE.start_main_~y~0#1| 1)) (.cse32 (+ .cse33 1))) (let ((.cse31 (+ .cse32 1)) (.cse19 (+ .cse17 1))) (let ((.cse22 (+ .cse19 1)) (.cse30 (+ .cse31 1))) (let ((.cse28 (+ .cse30 1)) (.cse25 (+ .cse22 1)) (.cse13 (+ 0 1))) (let ((.cse18 (< .cse33 |ULTIMATE.start_main_~k~0#1|)) (.cse12 (= |ULTIMATE.start_main_~y~0#1| .cse13)) (.cse20 (< .cse32 |ULTIMATE.start_main_~k~0#1|)) (.cse23 (< .cse31 |ULTIMATE.start_main_~k~0#1|)) (.cse24 (< .cse30 |ULTIMATE.start_main_~k~0#1|)) (.cse26 (+ .cse25 1)) (.cse27 (< .cse28 |ULTIMATE.start_main_~k~0#1|)) (.cse21 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse0 (>= |ULTIMATE.start_main_~k~0#1| 0)) (.cse11 (= (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse21)) (.cse1 (or (< (+ .cse28 1) |ULTIMATE.start_main_~k~0#1|) (let ((.cse29 (+ .cse26 1))) (= (* .cse29 .cse29) (* |ULTIMATE.start_main_~k~0#1| .cse29))) (not .cse27))) (.cse3 (or (= (* .cse26 .cse26) (* .cse26 |ULTIMATE.start_main_~k~0#1|)) (not .cse24) .cse27)) (.cse4 (<= |ULTIMATE.start_main_~k~0#1| 10)) (.cse9 (or .cse24 (not .cse23) (= (* .cse25 .cse25) (* .cse25 |ULTIMATE.start_main_~k~0#1|)))) (.cse10 (or (not .cse20) (= (* .cse22 |ULTIMATE.start_main_~k~0#1|) (* .cse22 .cse22)) .cse23)) (.cse14 (= (mod (+ (* 6 |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| 11) (* 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|) (* 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|)) 12) 0)) (.cse2 (or (= (+ (* |ULTIMATE.start_main_~x~0#1| 12) (+ (+ (- (* (* (* (* 5 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|)) (+ (- (* (* |ULTIMATE.start_main_~y~0#1| (* (* (* 6 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|)) |ULTIMATE.start_main_~y~0#1|)) (* (* (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| (* (- 2) |ULTIMATE.start_main_~y~0#1|)))) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|))) .cse21)) 0) (and .cse12 (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 0)))) (.cse15 (+ (- 1) (+ (- 1) |ULTIMATE.start_main_~y~0#1|))) (.cse5 (or (= (* .cse19 .cse19) (* |ULTIMATE.start_main_~k~0#1| .cse19)) .cse20 (not .cse18))) (.cse6 (or (= (* .cse17 |ULTIMATE.start_main_~k~0#1|) (* .cse17 .cse17)) (not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) .cse18)) (.cse8 (<= |ULTIMATE.start_main_~k~0#1| 256))) (or (let ((.cse7 (+ 4 1))) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_main_~k~0#1| 6) .cse3 .cse4 .cse5 .cse6 (< .cse7 |ULTIMATE.start_main_~k~0#1|) .cse8 (= (+ 5 1) |ULTIMATE.start_main_~y~0#1|) .cse9 .cse10 (<= |ULTIMATE.start_main_~c~0#1| (+ .cse7 1)))) (and .cse11 .cse2 .cse5 .cse6 .cse8) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10) (and (<= |ULTIMATE.start_main_~k~0#1| 1) .cse2 .cse12 (<= |ULTIMATE.start_main_~c~0#1| .cse13) (< 0 |ULTIMATE.start_main_~k~0#1|) .cse14) (and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0)) (let ((.cse16 (+ 3 1))) (and (= .cse15 (+ 2 1)) .cse2 (<= |ULTIMATE.start_main_~k~0#1| 5) .cse5 (< .cse16 |ULTIMATE.start_main_~k~0#1|) .cse6 .cse8 (<= |ULTIMATE.start_main_~c~0#1| (+ .cse16 1)) .cse14)) (and (<= |ULTIMATE.start_main_~k~0#1| 2) .cse2 (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| (+ 1 1)) (= .cse15 0) .cse5 .cse6 .cse8))))))))) [2023-02-17 02:32:17,328 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 6 8) the Hoare annotation is: true [2023-02-17 02:32:17,328 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2023-02-17 02:32:17,328 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2023-02-17 02:32:17,328 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2023-02-17 02:32:17,328 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2023-02-17 02:32:17,328 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2023-02-17 02:32:17,328 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2023-02-17 02:32:17,328 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 9 15) the Hoare annotation is: true [2023-02-17 02:32:17,329 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2023-02-17 02:32:17,329 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2023-02-17 02:32:17,331 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2023-02-17 02:32:17,333 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 02:32:17,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 02:32:17 BoogieIcfgContainer [2023-02-17 02:32:17,364 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 02:32:17,365 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 02:32:17,365 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 02:32:17,365 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 02:32:17,366 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:31:03" (3/4) ... [2023-02-17 02:32:17,368 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 02:32:17,386 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-02-17 02:32:17,387 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-17 02:32:17,389 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-02-17 02:32:17,390 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-17 02:32:17,390 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-17 02:32:17,390 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 02:32:17,435 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 02:32:17,438 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 02:32:17,438 INFO L158 Benchmark]: Toolchain (without parser) took 74673.45ms. Allocated memory is still 167.8MB. Free memory was 137.8MB in the beginning and 134.9MB in the end (delta: 2.9MB). Peak memory consumption was 98.6MB. Max. memory is 16.1GB. [2023-02-17 02:32:17,438 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 119.5MB. Free memory was 87.7MB in the beginning and 87.5MB in the end (delta: 132.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 02:32:17,439 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.28ms. Allocated memory is still 167.8MB. Free memory was 137.4MB in the beginning and 127.0MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 02:32:17,439 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.45ms. Allocated memory is still 167.8MB. Free memory was 127.0MB in the beginning and 125.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 02:32:17,439 INFO L158 Benchmark]: Boogie Preprocessor took 17.04ms. Allocated memory is still 167.8MB. Free memory was 125.7MB in the beginning and 124.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 02:32:17,439 INFO L158 Benchmark]: RCFGBuilder took 271.80ms. Allocated memory is still 167.8MB. Free memory was 124.4MB in the beginning and 114.4MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 02:32:17,440 INFO L158 Benchmark]: TraceAbstraction took 74055.25ms. Allocated memory is still 167.8MB. Free memory was 114.0MB in the beginning and 43.4MB in the end (delta: 70.6MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2023-02-17 02:32:17,440 INFO L158 Benchmark]: Witness Printer took 72.67ms. Allocated memory is still 167.8MB. Free memory was 43.4MB in the beginning and 134.9MB in the end (delta: -91.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 02:32:17,442 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.18ms. Allocated memory is still 119.5MB. Free memory was 87.7MB in the beginning and 87.5MB in the end (delta: 132.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.28ms. Allocated memory is still 167.8MB. Free memory was 137.4MB in the beginning and 127.0MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.45ms. Allocated memory is still 167.8MB. Free memory was 127.0MB in the beginning and 125.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.04ms. Allocated memory is still 167.8MB. Free memory was 125.7MB in the beginning and 124.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 271.80ms. Allocated memory is still 167.8MB. Free memory was 124.4MB in the beginning and 114.4MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 74055.25ms. Allocated memory is still 167.8MB. Free memory was 114.0MB in the beginning and 43.4MB in the end (delta: 70.6MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. * Witness Printer took 72.67ms. Allocated memory is still 167.8MB. Free memory was 43.4MB in the beginning and 134.9MB in the end (delta: -91.6MB). 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: 74.0s, OverallIterations: 8, TraceHistogramMax: 16, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 32.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 13 mSolverCounterUnknown, 117 SdHoareTripleChecker+Valid, 27.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 109 mSDsluCounter, 1234 SdHoareTripleChecker+Invalid, 27.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 92 IncrementalHoareTripleChecker+Unchecked, 1005 mSDsCounter, 104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1334 IncrementalHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104 mSolverCounterUnsat, 229 mSDtfsCounter, 1334 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 716 GetRequests, 563 SyntacticMatches, 4 SemanticMatches, 149 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 35.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=7, InterpolantAutomatonStates: 99, 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, 8 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 43 PreInvPairs, 81 NumberOfFragments, 6712 HoareAnnotationTreeSize, 43 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 37.9s InterpolantComputationTime, 413 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 642 ConstructedInterpolants, 0 QuantifiedInterpolants, 4005 SizeOfPredicates, 26 NumberOfNonLiveVariables, 998 ConjunctsInSsa, 169 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 1914/2130 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: (((((((((((((((((((k >= 0 && 2 + 1 == c) && (x * 12 + (-(5 * y * y * y * y) + (-(y * (6 * y * y * y) * y) + y * (y * (y * (-2 * y))) * y * y) + y * y) == 0 || (y == 0 + 1 && x + -1 * y * y * y * y * y == 0))) && 1 + 1 == -1 + c) && 2 + 1 == y) && k <= 10) && 1 + 1 == -1 + y) && (((y + 1) * k == (y + 1) * (y + 1) || !(c < k)) || c + 1 < k)) && (k * y == y * y || c < k)) && k <= 256) && 2 <= -1 + c) || (((((((((k >= 0 && (x * 12 + (-(5 * y * y * y * y) + (-(y * (6 * y * y * y) * y) + y * (y * (y * (-2 * y))) * y * y) + y * y) == 0 || (y == 0 + 1 && x + -1 * y * y * y * y * y == 0))) && 7 <= -1 + c) && k <= 10) && (((y + 1 + 1) * (y + 1 + 1) == k * (y + 1 + 1) || c + 1 + 1 < k) || !(c + 1 < k))) && (((y + 1) * k == (y + 1) * (y + 1) || !(c < k)) || c + 1 < k)) && (k * y == y * y || c < k)) && k <= 256) && ((c + 1 + 1 + 1 + 1 < k || !(c + 1 + 1 + 1 < k)) || (y + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1) == (y + 1 + 1 + 1 + 1) * k)) && ((!(c + 1 + 1 < k) || (y + 1 + 1 + 1) * k == (y + 1 + 1 + 1) * (y + 1 + 1 + 1)) || c + 1 + 1 + 1 < k))) || (((((((((((((k >= 0 && 1 + 1 == y) && (x * 12 + (-(5 * y * y * y * y) + (-(y * (6 * y * y * y) * y) + y * (y * (y * (-2 * y))) * y * y) + y * y) == 0 || (y == 0 + 1 && x + -1 * y * y * y * y * y == 0))) && 1 <= -1 + c) && 1 + 1 == c) && 1 < k) && c <= 1 + 1) && -1 + (-1 + y) == 0) && k <= 10) && (((y + 1 + 1) * (y + 1 + 1) == k * (y + 1 + 1) || c + 1 + 1 < k) || !(c + 1 < k))) && (((y + 1) * k == (y + 1) * (y + 1) || !(c < k)) || c + 1 < k)) && (k * y == y * y || c < k)) && k <= 256) && -1 + c == 0 + 1)) || (((((((((((k >= 0 && -1 + (-1 + y) == 2 + 1) && 4 <= -1 + c) && (x * 12 + (-(5 * y * y * y * y) + (-(y * (6 * y * y * y) * y) + y * (y * (y * (-2 * y))) * y * y) + y * y) == 0 || (y == 0 + 1 && x + -1 * y * y * y * y * y == 0))) && c == 4 + 1) && k <= 10) && 1 + 1 == -1 + (-1 + (-1 + y))) && 3 + 1 < k) && (k * y == y * y || c < k)) && k <= 256) && c <= 3 + 1 + 1) && (6 * y * y * y * y * y + y * y * 11 + 2 * y * y * y * y * y * y + 5 * y * y * y * y) % 12 == 0)) || ((((((((((2 + 1 == -1 + c && k >= 0) && -1 + (-1 + y) == 1 + 1) && (x * 12 + (-(5 * y * y * y * y) + (-(y * (6 * y * y * y) * y) + y * (y * (y * (-2 * y))) * y * y) + y * y) == 0 || (y == 0 + 1 && x + -1 * y * y * y * y * y == 0))) && c == 3 + 1) && 3 <= -1 + c) && k <= 10) && -1 + y == 2 + 1) && (k * y == y * y || c < k)) && k <= 256) && (6 * y * y * y * y * y + y * y * 11 + 2 * y * y * y * y * y * y + 5 * y * y * y * y) % 12 == 0)) || (((((((((((((k >= 0 && 5 <= -1 + c) && ((c + 1 + 1 + 1 + 1 + 1 + 1 < k || (y + 1 + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1 + 1) == k * (y + 1 + 1 + 1 + 1 + 1 + 1)) || !(c + 1 + 1 + 1 + 1 + 1 < k))) && (x * 12 + (-(5 * y * y * y * y) + (-(y * (6 * y * y * y) * y) + y * (y * (y * (-2 * y))) * y * y) + y * y) == 0 || (y == 0 + 1 && x + -1 * y * y * y * y * y == 0))) && (((y + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1) == (y + 1 + 1 + 1 + 1 + 1) * k || !(c + 1 + 1 + 1 + 1 < k)) || c + 1 + 1 + 1 + 1 + 1 < k)) && k <= 10) && (((y + 1 + 1) * (y + 1 + 1) == k * (y + 1 + 1) || c + 1 + 1 < k) || !(c + 1 < k))) && (((y + 1) * k == (y + 1) * (y + 1) || !(c < k)) || c + 1 < k)) && 4 + 1 < k) && k <= 256) && 5 + 1 == y) && ((c + 1 + 1 + 1 + 1 < k || !(c + 1 + 1 + 1 < k)) || (y + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1) == (y + 1 + 1 + 1 + 1) * k)) && ((!(c + 1 + 1 < k) || (y + 1 + 1 + 1) * k == (y + 1 + 1 + 1) * (y + 1 + 1 + 1)) || c + 1 + 1 + 1 < k)) && c <= 4 + 1 + 1)) || (((((((((((k >= 0 && 0 <= -1 + c) && (x * 12 + (-(5 * y * y * y * y) + (-(y * (6 * y * y * y) * y) + y * (y * (y * (-2 * y))) * y * y) + y * y) == 0 || (y == 0 + 1 && x + -1 * y * y * y * y * y == 0))) && -1 + c == 0) && -1 + y == 0) && y == 0 + 1) && k <= 10) && c <= 0 + 1) && 0 < k) && (k * y == y * y || c < k)) && k <= 256) && c == 0 + 1)) || ((((((c == 0 && k >= 0) && y == 0) && c >= 0) && k <= 10) && k <= 256) && x == 0)) || (((((((k >= 0 && 9 <= -1 + c) && (x * 12 + (-(5 * y * y * y * y) + (-(y * (6 * y * y * y) * y) + y * (y * (y * (-2 * y))) * y * y) + y * y) == 0 || (y == 0 + 1 && x + -1 * y * y * y * y * y == 0))) && k <= 10) && (((y + 1 + 1) * (y + 1 + 1) == k * (y + 1 + 1) || c + 1 + 1 < k) || !(c + 1 < k))) && (((y + 1) * k == (y + 1) * (y + 1) || !(c < k)) || c + 1 < k)) && (k * y == y * y || c < k)) && k <= 256)) || ((((((((k >= 0 && (x * 12 + (-(5 * y * y * y * y) + (-(y * (6 * y * y * y) * y) + y * (y * (y * (-2 * y))) * y * y) + y * y) == 0 || (y == 0 + 1 && x + -1 * y * y * y * y * y == 0))) && k <= 10) && (((y + 1 + 1) * (y + 1 + 1) == k * (y + 1 + 1) || c + 1 + 1 < k) || !(c + 1 < k))) && (((y + 1) * k == (y + 1) * (y + 1) || !(c < k)) || c + 1 < k)) && (k * y == y * y || c < k)) && k <= 256) && 8 <= -1 + c) && ((!(c + 1 + 1 < k) || (y + 1 + 1 + 1) * k == (y + 1 + 1 + 1) * (y + 1 + 1 + 1)) || c + 1 + 1 + 1 < k))) || ((((((((((k >= 0 && (x * 12 + (-(5 * y * y * y * y) + (-(y * (6 * y * y * y) * y) + y * (y * (y * (-2 * y))) * y * y) + y * y) == 0 || (y == 0 + 1 && x + -1 * y * y * y * y * y == 0))) && (((y + 1 + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1 + 1) == (y + 1 + 1 + 1 + 1 + 1) * k || !(c + 1 + 1 + 1 + 1 < k)) || c + 1 + 1 + 1 + 1 + 1 < k)) && 6 <= -1 + c) && k <= 10) && (((y + 1 + 1) * (y + 1 + 1) == k * (y + 1 + 1) || c + 1 + 1 < k) || !(c + 1 < k))) && (((y + 1) * k == (y + 1) * (y + 1) || !(c < k)) || c + 1 < k)) && (k * y == y * y || c < k)) && k <= 256) && ((c + 1 + 1 + 1 + 1 < k || !(c + 1 + 1 + 1 < k)) || (y + 1 + 1 + 1 + 1) * (y + 1 + 1 + 1 + 1) == (y + 1 + 1 + 1 + 1) * k)) && ((!(c + 1 + 1 < k) || (y + 1 + 1 + 1) * k == (y + 1 + 1 + 1) * (y + 1 + 1 + 1)) || c + 1 + 1 + 1 < k)) RESULT: Ultimate proved your program to be correct! [2023-02-17 02:32:17,470 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