./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound5.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/ps4-ll_valuebound5.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 b2a54f54b02d2bb65a6f46eeae11edba1907f4f082d2aaa313102e422e7e6122 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 03:58:04,706 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 03:58:04,707 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 03:58:04,724 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 03:58:04,725 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 03:58:04,725 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 03:58:04,726 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 03:58:04,727 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 03:58:04,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 03:58:04,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 03:58:04,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 03:58:04,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 03:58:04,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 03:58:04,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 03:58:04,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 03:58:04,733 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 03:58:04,734 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 03:58:04,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 03:58:04,735 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 03:58:04,736 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 03:58:04,737 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 03:58:04,738 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 03:58:04,739 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 03:58:04,739 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 03:58:04,741 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 03:58:04,742 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 03:58:04,742 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 03:58:04,742 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 03:58:04,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 03:58:04,743 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 03:58:04,743 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 03:58:04,744 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 03:58:04,744 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 03:58:04,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 03:58:04,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 03:58:04,745 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 03:58:04,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 03:58:04,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 03:58:04,746 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 03:58:04,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 03:58:04,747 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 03:58:04,748 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 03:58:04,761 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 03:58:04,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 03:58:04,761 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 03:58:04,761 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 03:58:04,762 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 03:58:04,762 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 03:58:04,763 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 03:58:04,763 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 03:58:04,763 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 03:58:04,763 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 03:58:04,763 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 03:58:04,763 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 03:58:04,764 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 03:58:04,764 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 03:58:04,764 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 03:58:04,764 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 03:58:04,764 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 03:58:04,764 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 03:58:04,765 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 03:58:04,765 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 03:58:04,765 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 03:58:04,765 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 03:58:04,765 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 03:58:04,765 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 03:58:04,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 03:58:04,766 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 03:58:04,766 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 03:58:04,766 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 03:58:04,766 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 03:58:04,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 03:58:04,767 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 03:58:04,767 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 03:58:04,767 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 03:58:04,767 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 03:58:04,767 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 03:58:04,767 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 -> b2a54f54b02d2bb65a6f46eeae11edba1907f4f082d2aaa313102e422e7e6122 [2023-02-18 03:58:04,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 03:58:04,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 03:58:04,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 03:58:04,964 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 03:58:04,964 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 03:58:04,965 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound5.c [2023-02-18 03:58:06,079 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 03:58:06,204 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 03:58:06,204 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound5.c [2023-02-18 03:58:06,208 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aae2c45ac/0006651bd209426fa486b536041bbba9/FLAG38d151946 [2023-02-18 03:58:06,217 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aae2c45ac/0006651bd209426fa486b536041bbba9 [2023-02-18 03:58:06,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 03:58:06,219 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 03:58:06,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 03:58:06,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 03:58:06,222 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 03:58:06,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 03:58:06" (1/1) ... [2023-02-18 03:58:06,223 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6644d2e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:58:06, skipping insertion in model container [2023-02-18 03:58:06,223 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 03:58:06" (1/1) ... [2023-02-18 03:58:06,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 03:58:06,237 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 03:58:06,338 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound5.c[458,471] [2023-02-18 03:58:06,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 03:58:06,358 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 03:58:06,368 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound5.c[458,471] [2023-02-18 03:58:06,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 03:58:06,388 INFO L208 MainTranslator]: Completed translation [2023-02-18 03:58:06,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:58:06 WrapperNode [2023-02-18 03:58:06,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 03:58:06,390 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 03:58:06,390 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 03:58:06,390 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 03:58:06,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:58:06" (1/1) ... [2023-02-18 03:58:06,398 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:58:06" (1/1) ... [2023-02-18 03:58:06,409 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2023-02-18 03:58:06,409 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 03:58:06,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 03:58:06,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 03:58:06,410 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 03:58:06,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:58:06" (1/1) ... [2023-02-18 03:58:06,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:58:06" (1/1) ... [2023-02-18 03:58:06,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:58:06" (1/1) ... [2023-02-18 03:58:06,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:58:06" (1/1) ... [2023-02-18 03:58:06,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:58:06" (1/1) ... [2023-02-18 03:58:06,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:58:06" (1/1) ... [2023-02-18 03:58:06,434 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:58:06" (1/1) ... [2023-02-18 03:58:06,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:58:06" (1/1) ... [2023-02-18 03:58:06,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 03:58:06,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 03:58:06,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 03:58:06,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 03:58:06,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:58:06" (1/1) ... [2023-02-18 03:58:06,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 03:58:06,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:58:06,470 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-18 03:58:06,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-18 03:58:06,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 03:58:06,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 03:58:06,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 03:58:06,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 03:58:06,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 03:58:06,501 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 03:58:06,542 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 03:58:06,544 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 03:58:06,670 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 03:58:06,674 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 03:58:06,675 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-18 03:58:06,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 03:58:06 BoogieIcfgContainer [2023-02-18 03:58:06,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 03:58:06,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 03:58:06,679 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 03:58:06,681 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 03:58:06,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 03:58:06" (1/3) ... [2023-02-18 03:58:06,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca78d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 03:58:06, skipping insertion in model container [2023-02-18 03:58:06,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 03:58:06" (2/3) ... [2023-02-18 03:58:06,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca78d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 03:58:06, skipping insertion in model container [2023-02-18 03:58:06,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 03:58:06" (3/3) ... [2023-02-18 03:58:06,683 INFO L112 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound5.c [2023-02-18 03:58:06,694 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 03:58:06,694 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 03:58:06,733 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 03:58:06,738 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;@513bd19, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 03:58:06,738 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 03:58:06,740 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 03:58:06,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 03:58:06,745 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:58:06,745 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:58:06,745 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:58:06,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:58:06,749 INFO L85 PathProgramCache]: Analyzing trace with hash -589436290, now seen corresponding path program 1 times [2023-02-18 03:58:06,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:58:06,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386789350] [2023-02-18 03:58:06,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:58:06,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:58:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:58:06,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:58:06,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386789350] [2023-02-18 03:58:06,855 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-18 03:58:06,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540610652] [2023-02-18 03:58:06,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:58:06,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:58:06,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:58:06,858 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 03:58:06,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-18 03:58:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:58:06,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-18 03:58:06,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:58:06,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 03:58:06,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 03:58:06,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540610652] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 03:58:06,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 03:58:06,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 03:58:06,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133133225] [2023-02-18 03:58:06,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 03:58:06,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 03:58:06,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:58:06,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 03:58:06,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 03:58:06,999 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 03:58:07,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:58:07,013 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2023-02-18 03:58:07,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 03:58:07,014 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-18 03:58:07,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:58:07,018 INFO L225 Difference]: With dead ends: 35 [2023-02-18 03:58:07,019 INFO L226 Difference]: Without dead ends: 15 [2023-02-18 03:58:07,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 03:58:07,026 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 03:58:07,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 03:58:07,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-02-18 03:58:07,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-02-18 03:58:07,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 03:58:07,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2023-02-18 03:58:07,047 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 9 [2023-02-18 03:58:07,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:58:07,048 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-02-18 03:58:07,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 03:58:07,048 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2023-02-18 03:58:07,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 03:58:07,049 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:58:07,050 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:58:07,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-18 03:58:07,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-18 03:58:07,256 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:58:07,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:58:07,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1187358532, now seen corresponding path program 1 times [2023-02-18 03:58:07,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:58:07,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161940404] [2023-02-18 03:58:07,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:58:07,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:58:07,285 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:58:07,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1531286405] [2023-02-18 03:58:07,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:58:07,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:58:07,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:58:07,288 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 03:58:07,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-18 03:58:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:58:07,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 03:58:07,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:58:07,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 03:58:07,370 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 03:58:07,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:58:07,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161940404] [2023-02-18 03:58:07,372 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:58:07,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531286405] [2023-02-18 03:58:07,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531286405] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 03:58:07,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 03:58:07,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 03:58:07,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603450719] [2023-02-18 03:58:07,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 03:58:07,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 03:58:07,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:58:07,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 03:58:07,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 03:58:07,376 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 03:58:07,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:58:07,411 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2023-02-18 03:58:07,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 03:58:07,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-18 03:58:07,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:58:07,412 INFO L225 Difference]: With dead ends: 26 [2023-02-18 03:58:07,412 INFO L226 Difference]: Without dead ends: 22 [2023-02-18 03:58:07,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 03:58:07,413 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 03:58:07,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 45 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 03:58:07,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-18 03:58:07,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-18 03:58:07,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 03:58:07,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2023-02-18 03:58:07,419 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 9 [2023-02-18 03:58:07,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:58:07,419 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2023-02-18 03:58:07,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 03:58:07,419 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2023-02-18 03:58:07,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-18 03:58:07,420 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:58:07,420 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:58:07,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 03:58:07,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-02-18 03:58:07,625 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:58:07,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:58:07,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1781398469, now seen corresponding path program 1 times [2023-02-18 03:58:07,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:58:07,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607777907] [2023-02-18 03:58:07,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:58:07,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:58:07,638 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:58:07,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2109542076] [2023-02-18 03:58:07,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:58:07,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:58:07,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:58:07,641 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 03:58:07,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-18 03:58:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:58:07,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 03:58:07,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:58:07,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 03:58:07,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:58:08,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 03:58:08,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:58:08,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607777907] [2023-02-18 03:58:08,030 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:58:08,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109542076] [2023-02-18 03:58:08,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109542076] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 03:58:08,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 03:58:08,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2023-02-18 03:58:08,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674860529] [2023-02-18 03:58:08,031 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 03:58:08,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 03:58:08,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:58:08,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 03:58:08,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-02-18 03:58:08,033 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 03:58:08,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:58:08,125 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2023-02-18 03:58:08,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 03:58:08,126 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2023-02-18 03:58:08,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:58:08,127 INFO L225 Difference]: With dead ends: 33 [2023-02-18 03:58:08,127 INFO L226 Difference]: Without dead ends: 27 [2023-02-18 03:58:08,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-02-18 03:58:08,129 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 20 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 03:58:08,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 39 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 03:58:08,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-18 03:58:08,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2023-02-18 03:58:08,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 03:58:08,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2023-02-18 03:58:08,142 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 16 [2023-02-18 03:58:08,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:58:08,143 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2023-02-18 03:58:08,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 03:58:08,143 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2023-02-18 03:58:08,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-18 03:58:08,144 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:58:08,144 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:58:08,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-18 03:58:08,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:58:08,348 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:58:08,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:58:08,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1711372296, now seen corresponding path program 1 times [2023-02-18 03:58:08,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:58:08,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272579042] [2023-02-18 03:58:08,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:58:08,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:58:08,357 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:58:08,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [862143533] [2023-02-18 03:58:08,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:58:08,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:58:08,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:58:08,375 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 03:58:08,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-18 03:58:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 03:58:08,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-18 03:58:08,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:58:13,972 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (.cse1 (* |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|))) (and (< 0 |c_ULTIMATE.start_main_~k~0#1|) (= (mod (+ .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) .cse1) 4) 0) (= |c_ULTIMATE.start_main_~y~0#1| (+ 0 1)) (<= |c_ULTIMATE.start_main_~k~0#1| 1) (<= (+ (div (+ (* 2 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) .cse0 .cse1) 4) (* (- 1) |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 0))) is different from true [2023-02-18 03:58:14,005 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 03:58:14,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:58:35,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:58:35,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272579042] [2023-02-18 03:58:35,991 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:58:35,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862143533] [2023-02-18 03:58:35,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862143533] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 03:58:35,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 03:58:35,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2023-02-18 03:58:35,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397414744] [2023-02-18 03:58:35,993 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 03:58:35,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 03:58:35,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:58:35,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 03:58:35,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=162, Unknown=6, NotChecked=26, Total=240 [2023-02-18 03:58:35,994 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 03:58:38,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 03:58:39,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 03:58:41,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 03:58:43,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 03:58:43,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:58:43,310 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2023-02-18 03:58:43,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 03:58:43,310 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2023-02-18 03:58:43,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:58:43,311 INFO L225 Difference]: With dead ends: 31 [2023-02-18 03:58:43,311 INFO L226 Difference]: Without dead ends: 26 [2023-02-18 03:58:43,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=68, Invalid=236, Unknown=6, NotChecked=32, Total=342 [2023-02-18 03:58:43,314 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2023-02-18 03:58:43,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 46 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 3 Unknown, 22 Unchecked, 7.3s Time] [2023-02-18 03:58:43,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-18 03:58:43,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-02-18 03:58:43,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 03:58:43,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2023-02-18 03:58:43,320 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 22 [2023-02-18 03:58:43,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:58:43,320 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2023-02-18 03:58:43,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 03:58:43,320 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2023-02-18 03:58:43,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-18 03:58:43,321 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:58:43,321 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:58:43,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-18 03:58:43,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:58:43,526 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:58:43,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:58:43,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1075497887, now seen corresponding path program 2 times [2023-02-18 03:58:43,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:58:43,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352034615] [2023-02-18 03:58:43,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:58:43,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:58:43,533 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:58:43,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [140971508] [2023-02-18 03:58:43,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 03:58:43,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:58:43,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:58:43,550 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 03:58:43,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-18 03:58:43,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 03:58:43,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 03:58:43,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-18 03:58:43,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:58:45,614 WARN L859 $PredicateComparison]: unable to prove that (and (= (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| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0) (= (+ (- 1) |c_ULTIMATE.start_main_~y~0#1|) 0) (= 0 (+ |c_ULTIMATE.start_main_~c~0#1| (- 1)))) is different from true [2023-02-18 03:58:45,674 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2023-02-18 03:58:45,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:58:49,772 WARN L837 $PredicateComparison]: unable to prove that (or (not (= (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| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1| 1))) (+ (* |ULTIMATE.start_main_~k~0#1| .cse0) (- (* .cse0 .cse0)))) 0) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|)))) is different from false [2023-02-18 03:58:49,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:58:49,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352034615] [2023-02-18 03:58:49,774 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:58:49,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140971508] [2023-02-18 03:58:49,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140971508] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 03:58:49,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 03:58:49,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-02-18 03:58:49,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393031672] [2023-02-18 03:58:49,775 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 03:58:49,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 03:58:49,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:58:49,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 03:58:49,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=149, Unknown=2, NotChecked=50, Total=240 [2023-02-18 03:58:49,776 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 03:58:51,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 03:58:51,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:58:51,935 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2023-02-18 03:58:51,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 03:58:51,935 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2023-02-18 03:58:51,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:58:51,936 INFO L225 Difference]: With dead ends: 34 [2023-02-18 03:58:51,936 INFO L226 Difference]: Without dead ends: 29 [2023-02-18 03:58:51,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=58, Invalid=220, Unknown=2, NotChecked=62, Total=342 [2023-02-18 03:58:51,937 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-02-18 03:58:51,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 76 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 1 Unknown, 28 Unchecked, 2.1s Time] [2023-02-18 03:58:51,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-18 03:58:51,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-18 03:58:51,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 03:58:51,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2023-02-18 03:58:51,949 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2023-02-18 03:58:51,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:58:51,949 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2023-02-18 03:58:51,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 03:58:51,949 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2023-02-18 03:58:51,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-18 03:58:51,951 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:58:51,951 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:58:51,957 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-18 03:58:52,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:58:52,156 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:58:52,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:58:52,157 INFO L85 PathProgramCache]: Analyzing trace with hash 817917912, now seen corresponding path program 3 times [2023-02-18 03:58:52,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:58:52,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564231299] [2023-02-18 03:58:52,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:58:52,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:58:52,170 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:58:52,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [36455185] [2023-02-18 03:58:52,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 03:58:52,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:58:52,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:58:52,173 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 03:58:52,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-18 03:58:52,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-18 03:58:52,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 03:58:52,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-18 03:58:52,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:58:54,282 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 1))) (and (= (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| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0) (<= |c_ULTIMATE.start_main_~c~0#1| .cse0) (= |c_ULTIMATE.start_main_~y~0#1| .cse0) (< 2 |c_ULTIMATE.start_main_~k~0#1|))) is different from true [2023-02-18 03:58:54,340 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 3 not checked. [2023-02-18 03:58:54,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 03:59:16,649 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_9| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19|))) (or (= (+ (- .cse0) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_9|)) 0) (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| 2) .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19|)) 4) 0))))) is different from true [2023-02-18 03:59:22,668 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_9| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19|))) (or (= (+ (- .cse0) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_9|)) 0) (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| 2) .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19|)) 4) 0)))) (= c___VERIFIER_assert_~cond 0)) is different from true [2023-02-18 03:59:24,676 WARN L837 $PredicateComparison]: unable to prove that (or (not (= (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| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1| 1))) (+ (* |ULTIMATE.start_main_~k~0#1| .cse0) (- (* .cse0 .cse0)))) 0) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|)))) is different from false [2023-02-18 03:59:24,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 03:59:24,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564231299] [2023-02-18 03:59:24,681 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 03:59:24,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36455185] [2023-02-18 03:59:24,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36455185] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 03:59:24,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 03:59:24,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2023-02-18 03:59:24,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577815048] [2023-02-18 03:59:24,682 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 03:59:24,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 03:59:24,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 03:59:24,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 03:59:24,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=171, Unknown=7, NotChecked=116, Total=342 [2023-02-18 03:59:24,683 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 03:59:26,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 03:59:28,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 03:59:30,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 03:59:32,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 03:59:32,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 03:59:32,368 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2023-02-18 03:59:32,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 03:59:32,369 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2023-02-18 03:59:32,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 03:59:32,369 INFO L225 Difference]: With dead ends: 37 [2023-02-18 03:59:32,370 INFO L226 Difference]: Without dead ends: 32 [2023-02-18 03:59:32,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 26.4s TimeCoverageRelationStatistics Valid=61, Invalid=220, Unknown=7, NotChecked=132, Total=420 [2023-02-18 03:59:32,370 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2023-02-18 03:59:32,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 94 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 3 Unknown, 28 Unchecked, 7.6s Time] [2023-02-18 03:59:32,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-18 03:59:32,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-18 03:59:32,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-18 03:59:32,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2023-02-18 03:59:32,376 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 36 [2023-02-18 03:59:32,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 03:59:32,376 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2023-02-18 03:59:32,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 03:59:32,376 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2023-02-18 03:59:32,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-18 03:59:32,377 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 03:59:32,377 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 03:59:32,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-18 03:59:32,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:59:32,585 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 03:59:32,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 03:59:32,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1384689793, now seen corresponding path program 4 times [2023-02-18 03:59:32,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 03:59:32,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240764769] [2023-02-18 03:59:32,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 03:59:32,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 03:59:32,591 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 03:59:32,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [781748321] [2023-02-18 03:59:32,591 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 03:59:32,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 03:59:32,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 03:59:32,596 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 03:59:32,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-18 03:59:32,627 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 03:59:32,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 03:59:32,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-18 03:59:32,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 03:59:34,671 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1 1))) (let ((.cse0 (+ .cse1 1))) (and (= (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| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0) (< .cse0 |c_ULTIMATE.start_main_~k~0#1|) (<= |c_ULTIMATE.start_main_~c~0#1| (+ .cse0 1)) (= .cse1 (+ (- 1) (+ (- 1) |c_ULTIMATE.start_main_~y~0#1|)))))) is different from true [2023-02-18 03:59:36,627 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 21 proven. 27 refuted. 0 times theorem prover too weak. 28 trivial. 4 not checked. [2023-02-18 03:59:36,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:00:02,831 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26|))) (or (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_12|) (- .cse0)) 0) (= (mod (+ .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| 2)) 4) 0))))) is different from true [2023-02-18 04:00:08,853 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_12| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26|))) (or (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_12|) (- .cse0)) 0) (= (mod (+ .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_26| 2)) 4) 0))))) is different from true [2023-02-18 04:00:10,886 WARN L837 $PredicateComparison]: unable to prove that (or (not (= (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| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1| 1))) (+ (* |ULTIMATE.start_main_~k~0#1| .cse0) (- (* .cse0 .cse0)))) 0) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|)))) is different from false [2023-02-18 04:00:10,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:00:10,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240764769] [2023-02-18 04:00:10,895 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 04:00:10,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781748321] [2023-02-18 04:00:10,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781748321] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:00:10,895 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 04:00:10,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2023-02-18 04:00:10,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147145728] [2023-02-18 04:00:10,895 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 04:00:10,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-18 04:00:10,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:00:10,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 04:00:10,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=196, Unknown=10, NotChecked=124, Total=380 [2023-02-18 04:00:10,896 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-18 04:00:12,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 04:00:14,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 04:00:16,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 04:00:19,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 04:00:21,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 04:00:22,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 04:00:22,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:00:22,451 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2023-02-18 04:00:22,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 04:00:22,452 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 43 [2023-02-18 04:00:22,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:00:22,453 INFO L225 Difference]: With dead ends: 40 [2023-02-18 04:00:22,453 INFO L226 Difference]: Without dead ends: 35 [2023-02-18 04:00:22,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 32.2s TimeCoverageRelationStatistics Valid=63, Invalid=249, Unknown=10, NotChecked=140, Total=462 [2023-02-18 04:00:22,454 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2023-02-18 04:00:22,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 119 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 5 Unknown, 33 Unchecked, 11.5s Time] [2023-02-18 04:00:22,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-18 04:00:22,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-02-18 04:00:22,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-18 04:00:22,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-02-18 04:00:22,460 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 43 [2023-02-18 04:00:22,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:00:22,461 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-02-18 04:00:22,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-18 04:00:22,461 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-02-18 04:00:22,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-18 04:00:22,462 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:00:22,462 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:00:22,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-18 04:00:22,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:00:22,667 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:00:22,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:00:22,667 INFO L85 PathProgramCache]: Analyzing trace with hash -23130184, now seen corresponding path program 5 times [2023-02-18 04:00:22,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:00:22,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559025366] [2023-02-18 04:00:22,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:00:22,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:00:22,676 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 04:00:22,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1592353096] [2023-02-18 04:00:22,676 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-18 04:00:22,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:00:22,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:00:22,678 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:00:22,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-18 04:00:22,720 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-02-18 04:00:22,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:00:22,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-18 04:00:22,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:00:24,741 WARN L859 $PredicateComparison]: unable to prove that (and (< 0 |c_ULTIMATE.start_main_~k~0#1|) (= (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| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0) (= (+ (- 1) |c_ULTIMATE.start_main_~y~0#1|) 0) (= |c_ULTIMATE.start_main_~c~0#1| (+ 0 1))) is different from true [2023-02-18 04:00:26,747 WARN L859 $PredicateComparison]: unable to prove that (and (= (+ (- 1) (+ (- 1) |c_ULTIMATE.start_main_~y~0#1|)) 0) (< 0 |c_ULTIMATE.start_main_~k~0#1|) (= (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| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0) (= |c_ULTIMATE.start_main_~c~0#1| (+ (+ 0 1) 1))) is different from true [2023-02-18 04:00:26,827 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 14 proven. 39 refuted. 0 times theorem prover too weak. 45 trivial. 19 not checked. [2023-02-18 04:00:26,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:00:44,413 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| Int)) (or (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| 2) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38|)) 4) 0) (= (let ((.cse0 (+ (+ (+ (+ |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| 1) 1) 1) 1))) (+ (- (* .cse0 .cse0)) (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_23| .cse0))) 0)))) is different from true [2023-02-18 04:00:50,450 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| Int)) (or (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| 2) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38|)) 4) 0) (= (let ((.cse0 (+ (+ (+ (+ |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| 1) 1) 1) 1))) (+ (- (* .cse0 .cse0)) (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_23| .cse0))) 0))) (= c___VERIFIER_assert_~cond 0)) is different from true [2023-02-18 04:00:52,464 WARN L837 $PredicateComparison]: unable to prove that (or (not (= (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| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 4) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (let ((.cse1 (+ 1 (+ (+ 1 (+ |c_ULTIMATE.start_main_~c~0#1| 1)) 1)))) (or (= (let ((.cse0 (+ (+ (+ (+ 1 (+ |c_ULTIMATE.start_main_~y~0#1| 1)) 1) 1) 1))) (+ (- (* .cse0 .cse0)) (* |ULTIMATE.start_main_~k~0#1| .cse0))) 0) (< (+ .cse1 1) |ULTIMATE.start_main_~k~0#1|) (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (not (< .cse1 |ULTIMATE.start_main_~k~0#1|)))))) is different from false [2023-02-18 04:00:52,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:00:52,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559025366] [2023-02-18 04:00:52,469 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 04:00:52,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592353096] [2023-02-18 04:00:52,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592353096] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:00:52,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 04:00:52,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2023-02-18 04:00:52,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421002661] [2023-02-18 04:00:52,470 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 04:00:52,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 04:00:52,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:00:52,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 04:00:52,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=315, Unknown=8, NotChecked=200, Total=600 [2023-02-18 04:00:52,472 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-18 04:00:54,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 04:00:56,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 04:00:56,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:00:56,637 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2023-02-18 04:00:56,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 04:00:56,638 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2023-02-18 04:00:56,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:00:56,638 INFO L225 Difference]: With dead ends: 43 [2023-02-18 04:00:56,638 INFO L226 Difference]: Without dead ends: 38 [2023-02-18 04:00:56,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=96, Invalid=422, Unknown=8, NotChecked=230, Total=756 [2023-02-18 04:00:56,639 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:00:56,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 106 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 2 Unknown, 95 Unchecked, 4.1s Time] [2023-02-18 04:00:56,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-18 04:00:56,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-02-18 04:00:56,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:00:56,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2023-02-18 04:00:56,645 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 50 [2023-02-18 04:00:56,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:00:56,646 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2023-02-18 04:00:56,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-18 04:00:56,646 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2023-02-18 04:00:56,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-18 04:00:56,646 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:00:56,646 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:00:56,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-18 04:00:56,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-02-18 04:00:56,857 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:00:56,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:00:56,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1898941279, now seen corresponding path program 6 times [2023-02-18 04:00:56,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:00:56,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764844643] [2023-02-18 04:00:56,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:00:56,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:00:56,867 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 04:00:56,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1855581544] [2023-02-18 04:00:56,880 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-18 04:00:56,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:00:56,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:00:56,882 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:00:56,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-18 04:00:56,933 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-02-18 04:00:56,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:00:56,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-18 04:00:56,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:00:56,984 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-02-18 04:00:56,984 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 04:00:56,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:00:56,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764844643] [2023-02-18 04:00:56,985 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 04:00:56,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855581544] [2023-02-18 04:00:56,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855581544] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:00:56,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:00:56,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-18 04:00:56,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405532282] [2023-02-18 04:00:56,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:00:56,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 04:00:56,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:00:56,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 04:00:56,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-02-18 04:00:56,986 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 7 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:00:57,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:00:57,065 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2023-02-18 04:00:57,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 04:00:57,066 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 7 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 57 [2023-02-18 04:00:57,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:00:57,066 INFO L225 Difference]: With dead ends: 42 [2023-02-18 04:00:57,066 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 04:00:57,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2023-02-18 04:00:57,067 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 04:00:57,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 66 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 04:00:57,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 04:00:57,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 04:00:57,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 04:00:57,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 04:00:57,069 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2023-02-18 04:00:57,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:00:57,069 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 04:00:57,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 7 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:00:57,069 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 04:00:57,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 04:00:57,071 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 04:00:57,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-02-18 04:00:57,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:00:57,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 04:00:57,284 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 04:00:57,285 INFO L895 garLoopResultBuilder]: At program point L27-2(lines 27 36) the Hoare annotation is: (let ((.cse18 (+ 0 1))) (let ((.cse6 (+ .cse18 1))) (let ((.cse1 (+ 1 1)) (.cse17 (= |ULTIMATE.start_main_~y~0#1| .cse18)) (.cse16 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)) (.cse0 (>= |ULTIMATE.start_main_~k~0#1| 0)) (.cse4 (<= |ULTIMATE.start_main_~k~0#1| 5)) (.cse11 (+ .cse6 1)) (.cse13 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (.cse19 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse3 (= (mod (+ (* |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|) .cse19) 4) 0)) (.cse5 (+ (- 1) .cse13)) (.cse14 (+ .cse11 1)) (.cse15 (+ 3 1)) (.cse2 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)) (.cse7 (or (and (or (not .cse4) (not .cse0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse0 .cse4))) (.cse8 (or (= (+ (+ (- (* (* (* 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| .cse19) |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))) (- .cse19)) 0) (and .cse17 (= 0 .cse16)))) (.cse9 (< 0 |ULTIMATE.start_main_~k~0#1|)) (.cse10 (+ .cse1 1))) (or (and .cse0 (= .cse1 |ULTIMATE.start_main_~y~0#1|) (<= 1 .cse2) (= .cse1 |ULTIMATE.start_main_~c~0#1|) .cse3 (< 1 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) .cse2) 0) (<= |ULTIMATE.start_main_~c~0#1| .cse1) .cse4 (= .cse5 0) (= .cse6 |ULTIMATE.start_main_~c~0#1|) .cse7 .cse8 .cse9) (let ((.cse12 (+ 2 1))) (and .cse0 (= |ULTIMATE.start_main_~c~0#1| .cse10) .cse3 (= .cse11 |ULTIMATE.start_main_~c~0#1|) (= .cse12 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| .cse12) .cse4 .cse7 (= .cse1 .cse13) .cse8 .cse9 (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) .cse5) 0) (<= 2 .cse2))) (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 (= |ULTIMATE.start_main_~y~0#1| 0) .cse4 (>= |ULTIMATE.start_main_~c~0#1| 0) .cse7 (<= |ULTIMATE.start_main_~x~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0)) (and .cse0 (<= 4 .cse2) (<= |ULTIMATE.start_main_~c~0#1| (+ .cse14 1)) .cse4 (< .cse14 |ULTIMATE.start_main_~k~0#1|) .cse7 .cse8 .cse9 (= (+ .cse15 1) |ULTIMATE.start_main_~y~0#1|)) (and .cse0 (<= 0 .cse2) (= .cse2 0) (= .cse13 0) .cse4 (<= .cse16 0) .cse17 .cse7 (<= |ULTIMATE.start_main_~c~0#1| .cse18) .cse8 .cse9 (= |ULTIMATE.start_main_~c~0#1| .cse18)) (and .cse0 (= .cse5 .cse1) (= .cse14 |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~y~0#1| .cse15) (<= 3 .cse2) .cse4 .cse7 (< .cse10 |ULTIMATE.start_main_~k~0#1|) .cse8 .cse9 (<= |ULTIMATE.start_main_~c~0#1| (+ .cse10 1)))))))) [2023-02-18 04:00:57,285 INFO L895 garLoopResultBuilder]: At program point L27-3(lines 27 36) the Hoare annotation is: (let ((.cse6 (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse4 (+ 0 1))) (let ((.cse3 (= |ULTIMATE.start_main_~y~0#1| .cse4)) (.cse2 (+ .cse6 |ULTIMATE.start_main_~x~0#1|)) (.cse7 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse8 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse5 (< 0 |ULTIMATE.start_main_~k~0#1|)) (.cse10 (+ (- 1) (+ (- 1) |ULTIMATE.start_main_~y~0#1|))) (.cse0 (= (mod (+ .cse7 (* 2 |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) .cse8) 4) 0)) (.cse9 (+ 1 1)) (.cse1 (or (= (+ (+ (- (* (* (* 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| .cse8) |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))) (- .cse8)) 0) (and .cse3 (= 0 .cse2))))) (or (and .cse0 (= (+ 2 1) |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 3) .cse1 (< 2 |ULTIMATE.start_main_~k~0#1|)) (and (<= |ULTIMATE.start_main_~k~0#1| 1) .cse0 (<= .cse2 0) .cse3 (<= |ULTIMATE.start_main_~c~0#1| .cse4) .cse1 .cse5 (<= (+ .cse6 (div (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) .cse7 .cse8) 4)) 0)) (and (<= |ULTIMATE.start_main_~k~0#1| 2) .cse0 (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| .cse9) (= .cse10 0) .cse1) (let ((.cse11 (+ (+ (+ .cse4 1) 1) 1))) (and (<= |ULTIMATE.start_main_~c~0#1| (+ .cse11 1)) (<= |ULTIMATE.start_main_~k~0#1| 5) (< .cse11 |ULTIMATE.start_main_~k~0#1|) .cse1 .cse5 (= (+ (+ 3 1) 1) |ULTIMATE.start_main_~y~0#1|))) (and (= .cse10 .cse9) .cse0 (<= |ULTIMATE.start_main_~k~0#1| 4) (< (+ .cse9 1) |ULTIMATE.start_main_~k~0#1|) .cse1) (and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0)))))) [2023-02-18 04:00:57,285 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 04:00:57,285 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 17 40) the Hoare annotation is: true [2023-02-18 04:00:57,285 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2023-02-18 04:00:57,285 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2023-02-18 04:00:57,285 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 04:00:57,286 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 04:00:57,286 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (let ((.cse18 (+ 0 1))) (let ((.cse6 (+ .cse18 1))) (let ((.cse1 (+ 1 1)) (.cse17 (= |ULTIMATE.start_main_~y~0#1| .cse18)) (.cse16 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)) (.cse0 (>= |ULTIMATE.start_main_~k~0#1| 0)) (.cse4 (<= |ULTIMATE.start_main_~k~0#1| 5)) (.cse11 (+ .cse6 1)) (.cse13 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (.cse19 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse3 (= (mod (+ (* |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|) .cse19) 4) 0)) (.cse5 (+ (- 1) .cse13)) (.cse14 (+ .cse11 1)) (.cse15 (+ 3 1)) (.cse2 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)) (.cse7 (or (and (or (not .cse4) (not .cse0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse0 .cse4))) (.cse8 (or (= (+ (+ (- (* (* (* 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| .cse19) |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))) (- .cse19)) 0) (and .cse17 (= 0 .cse16)))) (.cse9 (< 0 |ULTIMATE.start_main_~k~0#1|)) (.cse10 (+ .cse1 1))) (or (and .cse0 (= .cse1 |ULTIMATE.start_main_~y~0#1|) (<= 1 .cse2) (= .cse1 |ULTIMATE.start_main_~c~0#1|) .cse3 (< 1 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) .cse2) 0) (<= |ULTIMATE.start_main_~c~0#1| .cse1) .cse4 (= .cse5 0) (= .cse6 |ULTIMATE.start_main_~c~0#1|) .cse7 .cse8 .cse9) (let ((.cse12 (+ 2 1))) (and .cse0 (= |ULTIMATE.start_main_~c~0#1| .cse10) .cse3 (= .cse11 |ULTIMATE.start_main_~c~0#1|) (= .cse12 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| .cse12) .cse4 .cse7 (= .cse1 .cse13) .cse8 .cse9 (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) .cse5) 0) (<= 2 .cse2))) (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 (= |ULTIMATE.start_main_~y~0#1| 0) .cse4 (>= |ULTIMATE.start_main_~c~0#1| 0) .cse7 (<= |ULTIMATE.start_main_~x~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0)) (and .cse0 (<= 4 .cse2) (<= |ULTIMATE.start_main_~c~0#1| (+ .cse14 1)) .cse4 (< .cse14 |ULTIMATE.start_main_~k~0#1|) .cse7 .cse8 .cse9 (= (+ .cse15 1) |ULTIMATE.start_main_~y~0#1|)) (and .cse0 (<= 0 .cse2) (= .cse2 0) (= .cse13 0) .cse4 (<= .cse16 0) .cse17 .cse7 (<= |ULTIMATE.start_main_~c~0#1| .cse18) .cse8 .cse9 (= |ULTIMATE.start_main_~c~0#1| .cse18)) (and .cse0 (= .cse5 .cse1) (= .cse14 |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~y~0#1| .cse15) (<= 3 .cse2) .cse4 .cse7 (< .cse10 |ULTIMATE.start_main_~k~0#1|) .cse8 .cse9 (<= |ULTIMATE.start_main_~c~0#1| (+ .cse10 1)))))))) [2023-02-18 04:00:57,286 INFO L899 garLoopResultBuilder]: For program point L28-1(lines 27 36) no Hoare annotation was computed. [2023-02-18 04:00:57,286 INFO L899 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2023-02-18 04:00:57,286 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (or (= (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (+ (- (* (* (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|)) (+ (- (* (* |ULTIMATE.start_main_~y~0#1| .cse0) |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))) (- .cse0))) 0) (and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0)) (and (= |ULTIMATE.start_main_~y~0#1| (+ 0 1)) (= 0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))) [2023-02-18 04:00:57,286 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2023-02-18 04:00:57,287 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2023-02-18 04:00:57,287 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2023-02-18 04:00:57,287 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 9 15) the Hoare annotation is: true [2023-02-18 04:00:57,287 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2023-02-18 04:00:57,287 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2023-02-18 04:00:57,289 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2023-02-18 04:00:57,290 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 04:00:57,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 04:00:57 BoogieIcfgContainer [2023-02-18 04:00:57,321 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 04:00:57,321 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 04:00:57,321 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 04:00:57,321 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 04:00:57,321 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 03:58:06" (3/4) ... [2023-02-18 04:00:57,323 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 04:00:57,337 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-18 04:00:57,340 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2023-02-18 04:00:57,340 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 04:00:57,340 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 04:00:57,340 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 04:00:57,364 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 04:00:57,364 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 04:00:57,365 INFO L158 Benchmark]: Toolchain (without parser) took 171145.65ms. Allocated memory was 142.6MB in the beginning and 232.8MB in the end (delta: 90.2MB). Free memory was 104.0MB in the beginning and 130.9MB in the end (delta: -26.9MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. [2023-02-18 04:00:57,365 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 98.6MB. Free memory was 47.7MB in the beginning and 47.6MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 04:00:57,365 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.09ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 93.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 04:00:57,366 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.83ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 92.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 04:00:57,366 INFO L158 Benchmark]: Boogie Preprocessor took 28.58ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 91.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 04:00:57,366 INFO L158 Benchmark]: RCFGBuilder took 237.40ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 81.8MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 04:00:57,367 INFO L158 Benchmark]: TraceAbstraction took 170642.19ms. Allocated memory was 142.6MB in the beginning and 232.8MB in the end (delta: 90.2MB). Free memory was 81.0MB in the beginning and 134.0MB in the end (delta: -53.1MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2023-02-18 04:00:57,367 INFO L158 Benchmark]: Witness Printer took 43.58ms. Allocated memory is still 232.8MB. Free memory was 134.0MB in the beginning and 130.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 04:00:57,368 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 98.6MB. Free memory was 47.7MB in the beginning and 47.6MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 169.09ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 93.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.83ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 92.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.58ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 91.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 237.40ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 81.8MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 170642.19ms. Allocated memory was 142.6MB in the beginning and 232.8MB in the end (delta: 90.2MB). Free memory was 81.0MB in the beginning and 134.0MB in the end (delta: -53.1MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. * Witness Printer took 43.58ms. Allocated memory is still 232.8MB. Free memory was 134.0MB in the beginning and 130.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 170.6s, OverallIterations: 9, TraceHistogramMax: 8, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 33.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 14 mSolverCounterUnknown, 71 SdHoareTripleChecker+Valid, 32.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 61 mSDsluCounter, 612 SdHoareTripleChecker+Invalid, 32.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 206 IncrementalHoareTripleChecker+Unchecked, 459 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 846 IncrementalHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 153 mSDtfsCounter, 846 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 397 GetRequests, 266 SyntacticMatches, 2 SemanticMatches, 129 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 116.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=8, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 25 PreInvPairs, 47 NumberOfFragments, 1869 HoareAnnotationTreeSize, 25 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 134.7s InterpolantComputationTime, 280 NumberOfCodeBlocks, 278 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 277 ConstructedInterpolants, 0 QuantifiedInterpolants, 2115 SizeOfPredicates, 33 NumberOfNonLiveVariables, 837 ConjunctsInSsa, 185 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 325/454 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (((((((((((((((((k >= 0 && 1 + 1 == y) && 1 <= -1 + c) && 1 + 1 == c) && (y * y * y * y + 2 * y * y * y + y * y) % 4 == 0) && 1 < k) && -1 + (-1 + c) == 0) && c <= 1 + 1) && k <= 5) && -1 + (-1 + y) == 0) && 0 + 1 + 1 == c) && (((!(k <= 5) || !(k >= 0)) && cond == 0) || ((cond == 1 && k >= 0) && k <= 5))) && (-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 || (y == 0 + 1 && 0 == -1 * y * y * y + x))) && 0 < k) || (((((((((((((k >= 0 && c == 1 + 1 + 1) && (y * y * y * y + 2 * y * y * y + y * y) % 4 == 0) && 0 + 1 + 1 + 1 == c) && 2 + 1 == y) && c <= 2 + 1) && k <= 5) && (((!(k <= 5) || !(k >= 0)) && cond == 0) || ((cond == 1 && k >= 0) && k <= 5))) && 1 + 1 == -1 + y) && (-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 || (y == 0 + 1 && 0 == -1 * y * y * y + x))) && 0 < k) && 2 < k) && -1 + (-1 + (-1 + y)) == 0) && 2 <= -1 + c)) || (((((((c == 0 && k >= 0) && y == 0) && k <= 5) && c >= 0) && (((!(k <= 5) || !(k >= 0)) && cond == 0) || ((cond == 1 && k >= 0) && k <= 5))) && x <= 0) && x == 0)) || ((((((((k >= 0 && 4 <= -1 + c) && c <= 0 + 1 + 1 + 1 + 1 + 1) && k <= 5) && 0 + 1 + 1 + 1 + 1 < k) && (((!(k <= 5) || !(k >= 0)) && cond == 0) || ((cond == 1 && k >= 0) && k <= 5))) && (-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 || (y == 0 + 1 && 0 == -1 * y * y * y + x))) && 0 < k) && 3 + 1 + 1 == y)) || (((((((((((k >= 0 && 0 <= -1 + c) && -1 + c == 0) && -1 + y == 0) && k <= 5) && -1 * y * y * y + x <= 0) && y == 0 + 1) && (((!(k <= 5) || !(k >= 0)) && cond == 0) || ((cond == 1 && k >= 0) && k <= 5))) && c <= 0 + 1) && (-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 || (y == 0 + 1 && 0 == -1 * y * y * y + x))) && 0 < k) && c == 0 + 1)) || ((((((((((k >= 0 && -1 + (-1 + y) == 1 + 1) && 0 + 1 + 1 + 1 + 1 == c) && y == 3 + 1) && 3 <= -1 + c) && k <= 5) && (((!(k <= 5) || !(k >= 0)) && cond == 0) || ((cond == 1 && k >= 0) && k <= 5))) && 1 + 1 + 1 < k) && (-(2 * y * y * y) + (-(y * (y * y) * y) + x * 4) + -(y * y) == 0 || (y == 0 + 1 && 0 == -1 * y * y * y + x))) && 0 < k) && c <= 1 + 1 + 1 + 1) RESULT: Ultimate proved your program to be correct! [2023-02-18 04:00:57,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE