./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound50.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/cohendiv-ll_unwindbound50.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 9cf0abd1bd1b4ed3cb492af2ceaa5e063719310ace8aba62ab225fe204180938 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 01:29:57,173 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 01:29:57,175 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 01:29:57,202 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 01:29:57,202 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 01:29:57,203 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 01:29:57,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 01:29:57,205 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 01:29:57,206 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 01:29:57,206 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 01:29:57,207 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 01:29:57,208 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 01:29:57,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 01:29:57,208 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 01:29:57,209 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 01:29:57,210 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 01:29:57,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 01:29:57,211 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 01:29:57,212 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 01:29:57,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 01:29:57,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 01:29:57,222 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 01:29:57,222 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 01:29:57,223 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 01:29:57,225 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 01:29:57,225 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 01:29:57,226 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 01:29:57,226 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 01:29:57,226 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 01:29:57,227 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 01:29:57,227 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 01:29:57,228 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 01:29:57,228 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 01:29:57,229 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 01:29:57,229 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 01:29:57,229 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 01:29:57,230 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 01:29:57,230 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 01:29:57,230 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 01:29:57,231 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 01:29:57,231 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 01:29:57,238 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 01:29:57,264 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 01:29:57,264 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 01:29:57,264 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 01:29:57,264 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 01:29:57,265 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 01:29:57,265 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 01:29:57,265 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 01:29:57,265 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 01:29:57,265 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 01:29:57,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 01:29:57,265 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 01:29:57,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 01:29:57,266 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 01:29:57,266 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 01:29:57,266 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 01:29:57,266 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 01:29:57,266 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 01:29:57,266 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 01:29:57,266 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 01:29:57,266 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 01:29:57,266 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 01:29:57,266 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 01:29:57,266 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 01:29:57,266 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 01:29:57,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 01:29:57,267 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 01:29:57,267 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 01:29:57,267 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 01:29:57,267 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 01:29:57,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 01:29:57,267 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 01:29:57,267 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 01:29:57,267 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 01:29:57,267 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 01:29:57,267 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 01:29:57,267 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 -> 9cf0abd1bd1b4ed3cb492af2ceaa5e063719310ace8aba62ab225fe204180938 [2023-02-17 01:29:57,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 01:29:57,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 01:29:57,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 01:29:57,490 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 01:29:57,491 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 01:29:57,492 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound50.c [2023-02-17 01:29:58,525 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 01:29:58,696 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 01:29:58,697 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound50.c [2023-02-17 01:29:58,701 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20c27f8bf/4ff70624d3a14e6398d66127382666f2/FLAGa4ca8a67b [2023-02-17 01:29:58,714 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20c27f8bf/4ff70624d3a14e6398d66127382666f2 [2023-02-17 01:29:58,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 01:29:58,718 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 01:29:58,720 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 01:29:58,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 01:29:58,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 01:29:58,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 01:29:58" (1/1) ... [2023-02-17 01:29:58,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f484023 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:29:58, skipping insertion in model container [2023-02-17 01:29:58,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 01:29:58" (1/1) ... [2023-02-17 01:29:58,729 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 01:29:58,741 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 01:29:58,854 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/cohendiv-ll_unwindbound50.c[576,589] [2023-02-17 01:29:58,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 01:29:58,881 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 01:29:58,889 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/cohendiv-ll_unwindbound50.c[576,589] [2023-02-17 01:29:58,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 01:29:58,907 INFO L208 MainTranslator]: Completed translation [2023-02-17 01:29:58,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:29:58 WrapperNode [2023-02-17 01:29:58,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 01:29:58,909 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 01:29:58,909 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 01:29:58,909 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 01:29:58,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:29:58" (1/1) ... [2023-02-17 01:29:58,920 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:29:58" (1/1) ... [2023-02-17 01:29:58,932 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2023-02-17 01:29:58,933 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 01:29:58,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 01:29:58,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 01:29:58,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 01:29:58,939 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:29:58" (1/1) ... [2023-02-17 01:29:58,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:29:58" (1/1) ... [2023-02-17 01:29:58,941 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:29:58" (1/1) ... [2023-02-17 01:29:58,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:29:58" (1/1) ... [2023-02-17 01:29:58,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:29:58" (1/1) ... [2023-02-17 01:29:58,945 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:29:58" (1/1) ... [2023-02-17 01:29:58,946 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:29:58" (1/1) ... [2023-02-17 01:29:58,947 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:29:58" (1/1) ... [2023-02-17 01:29:58,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 01:29:58,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 01:29:58,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 01:29:58,949 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 01:29:58,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:29:58" (1/1) ... [2023-02-17 01:29:58,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 01:29:58,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:29:58,975 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-17 01:29:58,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-17 01:29:59,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 01:29:59,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 01:29:59,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 01:29:59,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 01:29:59,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-17 01:29:59,015 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-17 01:29:59,067 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 01:29:59,068 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 01:29:59,165 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 01:29:59,169 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 01:29:59,170 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-17 01:29:59,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 01:29:59 BoogieIcfgContainer [2023-02-17 01:29:59,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 01:29:59,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 01:29:59,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 01:29:59,175 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 01:29:59,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 01:29:58" (1/3) ... [2023-02-17 01:29:59,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e45bb08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 01:29:59, skipping insertion in model container [2023-02-17 01:29:59,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:29:58" (2/3) ... [2023-02-17 01:29:59,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e45bb08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 01:29:59, skipping insertion in model container [2023-02-17 01:29:59,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 01:29:59" (3/3) ... [2023-02-17 01:29:59,177 INFO L112 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_unwindbound50.c [2023-02-17 01:29:59,187 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 01:29:59,188 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 01:29:59,217 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 01:29:59,222 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;@5960f0d4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 01:29:59,222 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 01:29:59,224 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 01:29:59,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 01:29:59,229 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:29:59,229 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:29:59,230 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:29:59,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:29:59,233 INFO L85 PathProgramCache]: Analyzing trace with hash -555122024, now seen corresponding path program 1 times [2023-02-17 01:29:59,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:29:59,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536526039] [2023-02-17 01:29:59,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:29:59,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:29:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:29:59,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:29:59,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536526039] [2023-02-17 01:29:59,323 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-17 01:29:59,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312491188] [2023-02-17 01:29:59,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:29:59,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:29:59,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:29:59,341 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:29:59,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 01:29:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:29:59,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-17 01:29:59,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:29:59,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 01:29:59,408 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 01:29:59,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312491188] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 01:29:59,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 01:29:59,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 01:29:59,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252505754] [2023-02-17 01:29:59,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:29:59,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 01:29:59,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:29:59,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 01:29:59,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 01:29:59,460 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 01:29:59,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:29:59,478 INFO L93 Difference]: Finished difference Result 55 states and 87 transitions. [2023-02-17 01:29:59,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 01:29:59,488 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-17 01:29:59,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:29:59,494 INFO L225 Difference]: With dead ends: 55 [2023-02-17 01:29:59,495 INFO L226 Difference]: Without dead ends: 25 [2023-02-17 01:29:59,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 01:29:59,499 INFO L413 NwaCegarLoop]: 38 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, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 01:29:59,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 01:29:59,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-17 01:29:59,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-02-17 01:29:59,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 01:29:59,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2023-02-17 01:29:59,538 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 9 [2023-02-17 01:29:59,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:29:59,539 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2023-02-17 01:29:59,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 01:29:59,540 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2023-02-17 01:29:59,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-17 01:29:59,544 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:29:59,544 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:29:59,552 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-17 01:29:59,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-17 01:29:59,750 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:29:59,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:29:59,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1985514477, now seen corresponding path program 1 times [2023-02-17 01:29:59,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:29:59,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614490628] [2023-02-17 01:29:59,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:29:59,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:29:59,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:29:59,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:29:59,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614490628] [2023-02-17 01:29:59,787 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-17 01:29:59,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677669604] [2023-02-17 01:29:59,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:29:59,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:29:59,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:29:59,799 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:29:59,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 01:29:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:29:59,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 01:29:59,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:29:59,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 01:29:59,900 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 01:29:59,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677669604] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 01:29:59,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 01:29:59,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 01:29:59,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762769893] [2023-02-17 01:29:59,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:29:59,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 01:29:59,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:29:59,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 01:29:59,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 01:29:59,907 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 01:29:59,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:29:59,928 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2023-02-17 01:29:59,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 01:29:59,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2023-02-17 01:29:59,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:29:59,934 INFO L225 Difference]: With dead ends: 34 [2023-02-17 01:29:59,934 INFO L226 Difference]: Without dead ends: 27 [2023-02-17 01:29:59,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 01:29:59,937 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 01:29:59,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 01:29:59,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-17 01:29:59,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-02-17 01:29:59,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 01:29:59,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-02-17 01:29:59,950 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 10 [2023-02-17 01:29:59,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:29:59,950 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-02-17 01:29:59,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 01:29:59,951 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2023-02-17 01:29:59,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-17 01:29:59,952 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:29:59,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:29:59,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-17 01:30:00,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-02-17 01:30:00,157 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:30:00,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:30:00,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1984024927, now seen corresponding path program 1 times [2023-02-17 01:30:00,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:30:00,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19329884] [2023-02-17 01:30:00,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:30:00,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:30:00,168 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:30:00,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1869327099] [2023-02-17 01:30:00,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:30:00,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:30:00,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:30:00,170 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:30:00,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 01:30:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:30:00,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 01:30:00,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:30:00,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 01:30:00,221 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 01:30:00,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:30:00,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19329884] [2023-02-17 01:30:00,221 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:30:00,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869327099] [2023-02-17 01:30:00,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869327099] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 01:30:00,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 01:30:00,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 01:30:00,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774887163] [2023-02-17 01:30:00,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:30:00,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 01:30:00,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:30:00,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 01:30:00,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 01:30:00,223 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 01:30:00,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:30:00,256 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2023-02-17 01:30:00,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 01:30:00,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2023-02-17 01:30:00,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:30:00,257 INFO L225 Difference]: With dead ends: 37 [2023-02-17 01:30:00,257 INFO L226 Difference]: Without dead ends: 35 [2023-02-17 01:30:00,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 01:30:00,258 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 01:30:00,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 113 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 01:30:00,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-17 01:30:00,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2023-02-17 01:30:00,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 01:30:00,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2023-02-17 01:30:00,264 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 10 [2023-02-17 01:30:00,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:30:00,265 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2023-02-17 01:30:00,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 01:30:00,265 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2023-02-17 01:30:00,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-17 01:30:00,265 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:30:00,265 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:30:00,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-17 01:30:00,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:30:00,473 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:30:00,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:30:00,474 INFO L85 PathProgramCache]: Analyzing trace with hash -2084809189, now seen corresponding path program 1 times [2023-02-17 01:30:00,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:30:00,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442260952] [2023-02-17 01:30:00,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:30:00,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:30:00,489 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:30:00,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2059431047] [2023-02-17 01:30:00,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:30:00,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:30:00,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:30:00,494 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:30:00,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-17 01:30:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:30:00,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-17 01:30:00,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:30:00,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 01:30:00,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:30:00,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 01:30:00,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:30:00,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442260952] [2023-02-17 01:30:00,656 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:30:00,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059431047] [2023-02-17 01:30:00,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059431047] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-17 01:30:00,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 01:30:00,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2023-02-17 01:30:00,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609544513] [2023-02-17 01:30:00,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:30:00,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 01:30:00,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:30:00,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 01:30:00,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-02-17 01:30:00,658 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 01:30:00,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:30:00,725 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2023-02-17 01:30:00,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 01:30:00,725 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-02-17 01:30:00,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:30:00,726 INFO L225 Difference]: With dead ends: 50 [2023-02-17 01:30:00,726 INFO L226 Difference]: Without dead ends: 47 [2023-02-17 01:30:00,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-02-17 01:30:00,727 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:30:00,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 127 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:30:00,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-17 01:30:00,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2023-02-17 01:30:00,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-02-17 01:30:00,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2023-02-17 01:30:00,735 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 15 [2023-02-17 01:30:00,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:30:00,735 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2023-02-17 01:30:00,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 01:30:00,735 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2023-02-17 01:30:00,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-17 01:30:00,736 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:30:00,736 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:30:00,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-17 01:30:00,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:30:00,941 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:30:00,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:30:00,941 INFO L85 PathProgramCache]: Analyzing trace with hash -2002825724, now seen corresponding path program 1 times [2023-02-17 01:30:00,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:30:00,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768609090] [2023-02-17 01:30:00,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:30:00,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:30:00,950 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:30:00,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1440055642] [2023-02-17 01:30:00,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:30:00,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:30:00,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:30:00,952 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:30:00,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-17 01:30:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:30:01,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-17 01:30:01,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:30:01,041 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 01:30:01,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:30:01,054 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 01:30:01,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:30:01,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768609090] [2023-02-17 01:30:01,054 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:30:01,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440055642] [2023-02-17 01:30:01,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440055642] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-17 01:30:01,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 01:30:01,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2023-02-17 01:30:01,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14635277] [2023-02-17 01:30:01,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:30:01,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 01:30:01,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:30:01,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 01:30:01,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-02-17 01:30:01,056 INFO L87 Difference]: Start difference. First operand 46 states and 61 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 01:30:01,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:30:01,096 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2023-02-17 01:30:01,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 01:30:01,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2023-02-17 01:30:01,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:30:01,097 INFO L225 Difference]: With dead ends: 52 [2023-02-17 01:30:01,098 INFO L226 Difference]: Without dead ends: 50 [2023-02-17 01:30:01,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-02-17 01:30:01,098 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 01:30:01,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 64 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 01:30:01,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-17 01:30:01,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-02-17 01:30:01,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-02-17 01:30:01,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2023-02-17 01:30:01,106 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 23 [2023-02-17 01:30:01,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:30:01,106 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2023-02-17 01:30:01,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 01:30:01,106 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2023-02-17 01:30:01,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 01:30:01,107 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:30:01,107 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:30:01,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-17 01:30:01,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:30:01,312 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:30:01,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:30:01,313 INFO L85 PathProgramCache]: Analyzing trace with hash -840648207, now seen corresponding path program 1 times [2023-02-17 01:30:01,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:30:01,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348459407] [2023-02-17 01:30:01,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:30:01,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:30:01,325 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:30:01,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [375904574] [2023-02-17 01:30:01,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:30:01,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:30:01,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:30:01,335 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:30:01,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-17 01:30:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:30:01,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 01:30:01,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:30:01,376 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 01:30:01,376 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 01:30:01,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:30:01,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348459407] [2023-02-17 01:30:01,377 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:30:01,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375904574] [2023-02-17 01:30:01,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375904574] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 01:30:01,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 01:30:01,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 01:30:01,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380115098] [2023-02-17 01:30:01,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:30:01,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 01:30:01,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:30:01,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 01:30:01,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-17 01:30:01,378 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 01:30:01,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:30:01,397 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2023-02-17 01:30:01,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 01:30:01,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2023-02-17 01:30:01,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:30:01,398 INFO L225 Difference]: With dead ends: 81 [2023-02-17 01:30:01,398 INFO L226 Difference]: Without dead ends: 56 [2023-02-17 01:30:01,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-17 01:30:01,399 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 01:30:01,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 01:30:01,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-02-17 01:30:01,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-02-17 01:30:01,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 38 states have internal predecessors, (44), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-02-17 01:30:01,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2023-02-17 01:30:01,405 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 26 [2023-02-17 01:30:01,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:30:01,405 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2023-02-17 01:30:01,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 01:30:01,406 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2023-02-17 01:30:01,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-17 01:30:01,406 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:30:01,406 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:30:01,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-17 01:30:01,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:30:01,611 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:30:01,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:30:01,612 INFO L85 PathProgramCache]: Analyzing trace with hash 2012484164, now seen corresponding path program 1 times [2023-02-17 01:30:01,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:30:01,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309777452] [2023-02-17 01:30:01,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:30:01,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:30:01,623 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:30:01,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1761695268] [2023-02-17 01:30:01,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:30:01,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:30:01,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:30:01,649 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:30:01,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-17 01:30:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:30:01,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 01:30:01,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:30:01,733 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-17 01:30:01,735 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 01:30:01,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:30:01,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309777452] [2023-02-17 01:30:01,735 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:30:01,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761695268] [2023-02-17 01:30:01,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761695268] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 01:30:01,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 01:30:01,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 01:30:01,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677336061] [2023-02-17 01:30:01,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:30:01,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 01:30:01,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:30:01,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 01:30:01,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-17 01:30:01,738 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 01:30:01,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:30:01,800 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2023-02-17 01:30:01,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 01:30:01,800 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2023-02-17 01:30:01,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:30:01,801 INFO L225 Difference]: With dead ends: 62 [2023-02-17 01:30:01,801 INFO L226 Difference]: Without dead ends: 60 [2023-02-17 01:30:01,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-02-17 01:30:01,802 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 33 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 01:30:01,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 90 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 01:30:01,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-17 01:30:01,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-02-17 01:30:01,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 40 states have (on average 1.175) internal successors, (47), 41 states have internal predecessors, (47), 13 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-02-17 01:30:01,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2023-02-17 01:30:01,810 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 33 [2023-02-17 01:30:01,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:30:01,810 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2023-02-17 01:30:01,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 01:30:01,810 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2023-02-17 01:30:01,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-17 01:30:01,811 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:30:01,811 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:30:01,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-17 01:30:02,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:30:02,017 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:30:02,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:30:02,018 INFO L85 PathProgramCache]: Analyzing trace with hash -2020901362, now seen corresponding path program 1 times [2023-02-17 01:30:02,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:30:02,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099048387] [2023-02-17 01:30:02,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:30:02,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:30:02,024 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:30:02,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [100198618] [2023-02-17 01:30:02,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:30:02,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:30:02,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:30:02,026 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:30:02,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-17 01:30:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:30:02,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 01:30:02,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:30:02,100 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-17 01:30:02,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:30:02,187 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-17 01:30:02,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:30:02,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099048387] [2023-02-17 01:30:02,187 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:30:02,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100198618] [2023-02-17 01:30:02,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100198618] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:30:02,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:30:02,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-02-17 01:30:02,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193879199] [2023-02-17 01:30:02,188 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:30:02,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 01:30:02,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:30:02,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 01:30:02,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-02-17 01:30:02,190 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand has 14 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2023-02-17 01:30:02,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:30:02,361 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2023-02-17 01:30:02,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 01:30:02,362 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 39 [2023-02-17 01:30:02,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:30:02,363 INFO L225 Difference]: With dead ends: 79 [2023-02-17 01:30:02,364 INFO L226 Difference]: Without dead ends: 77 [2023-02-17 01:30:02,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2023-02-17 01:30:02,365 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 33 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:30:02,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 110 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:30:02,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-17 01:30:02,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 64. [2023-02-17 01:30:02,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 44 states have internal predecessors, (50), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-02-17 01:30:02,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2023-02-17 01:30:02,379 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 39 [2023-02-17 01:30:02,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:30:02,380 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2023-02-17 01:30:02,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2023-02-17 01:30:02,380 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2023-02-17 01:30:02,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-17 01:30:02,381 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:30:02,381 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:30:02,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-17 01:30:02,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-02-17 01:30:02,587 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:30:02,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:30:02,588 INFO L85 PathProgramCache]: Analyzing trace with hash 803844641, now seen corresponding path program 1 times [2023-02-17 01:30:02,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:30:02,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114763267] [2023-02-17 01:30:02,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:30:02,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:30:02,596 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:30:02,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1283072104] [2023-02-17 01:30:02,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:30:02,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:30:02,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:30:02,611 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:30:02,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-17 01:30:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:30:02,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 01:30:02,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:30:02,684 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-17 01:30:02,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:30:02,705 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-02-17 01:30:02,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:30:02,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114763267] [2023-02-17 01:30:02,706 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:30:02,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283072104] [2023-02-17 01:30:02,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283072104] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:30:02,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:30:02,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2023-02-17 01:30:02,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90965401] [2023-02-17 01:30:02,707 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:30:02,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 01:30:02,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:30:02,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 01:30:02,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-02-17 01:30:02,708 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-02-17 01:30:02,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:30:02,903 INFO L93 Difference]: Finished difference Result 225 states and 264 transitions. [2023-02-17 01:30:02,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 01:30:02,912 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 42 [2023-02-17 01:30:02,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:30:02,916 INFO L225 Difference]: With dead ends: 225 [2023-02-17 01:30:02,916 INFO L226 Difference]: Without dead ends: 218 [2023-02-17 01:30:02,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2023-02-17 01:30:02,918 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 86 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:30:02,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 202 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:30:02,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-02-17 01:30:02,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 202. [2023-02-17 01:30:02,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 132 states have (on average 1.1818181818181819) internal successors, (156), 136 states have internal predecessors, (156), 44 states have call successors, (44), 25 states have call predecessors, (44), 25 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-02-17 01:30:02,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 240 transitions. [2023-02-17 01:30:02,961 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 240 transitions. Word has length 42 [2023-02-17 01:30:02,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:30:02,961 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 240 transitions. [2023-02-17 01:30:02,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-02-17 01:30:02,961 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 240 transitions. [2023-02-17 01:30:02,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-17 01:30:02,963 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:30:02,963 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:30:02,971 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-17 01:30:03,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:30:03,169 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:30:03,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:30:03,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1528082637, now seen corresponding path program 1 times [2023-02-17 01:30:03,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:30:03,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129085010] [2023-02-17 01:30:03,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:30:03,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:30:03,190 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:30:03,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1132253267] [2023-02-17 01:30:03,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:30:03,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:30:03,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:30:03,194 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:30:03,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-17 01:30:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:30:03,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-17 01:30:03,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:30:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-02-17 01:30:03,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:30:03,432 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-02-17 01:30:03,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:30:03,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129085010] [2023-02-17 01:30:03,433 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:30:03,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132253267] [2023-02-17 01:30:03,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132253267] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-17 01:30:03,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 01:30:03,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2023-02-17 01:30:03,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419228590] [2023-02-17 01:30:03,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:30:03,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 01:30:03,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:30:03,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 01:30:03,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-02-17 01:30:03,435 INFO L87 Difference]: Start difference. First operand 202 states and 240 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-17 01:30:03,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:30:03,612 INFO L93 Difference]: Finished difference Result 202 states and 240 transitions. [2023-02-17 01:30:03,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 01:30:03,613 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2023-02-17 01:30:03,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:30:03,613 INFO L225 Difference]: With dead ends: 202 [2023-02-17 01:30:03,613 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 01:30:03,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2023-02-17 01:30:03,617 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 23 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:30:03,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 58 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:30:03,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 01:30:03,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 01:30:03,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 01:30:03,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 01:30:03,618 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2023-02-17 01:30:03,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:30:03,619 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 01:30:03,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-17 01:30:03,619 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 01:30:03,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 01:30:03,621 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 01:30:03,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-02-17 01:30:03,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-17 01:30:03,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 01:30:03,842 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse8 (>= |ULTIMATE.start_main_~y~0#1| 1))) (let ((.cse6 (>= |ULTIMATE.start_main_~r~0#1| 0)) (.cse7 (= (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~b~0#1|)) (.cse9 (<= 1 |ULTIMATE.start_main_~r~0#1|)) (.cse10 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse8) (and (not .cse8) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))))) (let ((.cse4 (< ~counter~0 50)) (.cse2 (let ((.cse11 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse12 (= |ULTIMATE.start_main_~q~0#1| 0))) (or (and .cse6 .cse7 .cse8 .cse11 .cse12 .cse9 .cse10) (and .cse7 .cse8 .cse11 .cse12 .cse9 .cse10)))) (.cse0 (= |ULTIMATE.start_main_~x~0#1| (+ (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~b~0#1|))))) (.cse3 (< ~counter~0 49)) (.cse1 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))) (.cse5 (or (and .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse7 .cse8 .cse9 .cse10)))) (or (and (<= (+ ~counter~0 (- 1)) 1) .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse1 .cse2) (and .cse0 .cse1 .cse4 .cse5) (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse5) (and .cse0 .cse1 .cse4 .cse2) (and .cse0 .cse1 (< (+ ~counter~0 1) 49) .cse2) (and .cse0 .cse3 .cse1 .cse5))))) [2023-02-17 01:30:03,843 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 13) no Hoare annotation was computed. [2023-02-17 01:30:03,843 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 23 65) the Hoare annotation is: true [2023-02-17 01:30:03,843 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 01:30:03,843 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 01:30:03,843 INFO L899 garLoopResultBuilder]: For program point L49(lines 46 58) no Hoare annotation was computed. [2023-02-17 01:30:03,843 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-02-17 01:30:03,843 INFO L899 garLoopResultBuilder]: For program point L37-1(lines 37 61) no Hoare annotation was computed. [2023-02-17 01:30:03,843 INFO L895 garLoopResultBuilder]: At program point L37-3(lines 37 61) the Hoare annotation is: (let ((.cse3 (>= |ULTIMATE.start_main_~y~0#1| 1))) (let ((.cse0 (= |ULTIMATE.start_main_~x~0#1| (+ (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~b~0#1|))))) (.cse1 (= (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~b~0#1|)) (.cse2 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))) (.cse4 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse3) (and (not .cse3) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~b~0#1| 0) .cse3 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (<= ~counter~0 0) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| 0) .cse4) (and .cse0 (< ~counter~0 49) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse4 (< (+ ~counter~0 1) 49)) (and (<= (+ ~counter~0 (- 1)) 1) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse4 (< ~counter~0 50))))) [2023-02-17 01:30:03,844 INFO L895 garLoopResultBuilder]: At program point L37-4(lines 37 61) the Hoare annotation is: (let ((.cse3 (>= |ULTIMATE.start_main_~y~0#1| 1))) (let ((.cse0 (= |ULTIMATE.start_main_~x~0#1| (+ (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~b~0#1|))))) (.cse1 (= (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~b~0#1|)) (.cse2 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))) (.cse4 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse3) (and (not .cse3) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))))) (or (and .cse0 (< ~counter~0 49) .cse1 .cse2 .cse3 .cse4) (and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (< (+ ~counter~0 1) 49)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse4 (< ~counter~0 50))))) [2023-02-17 01:30:03,844 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 01:30:03,844 INFO L895 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (let ((.cse5 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse12 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse8 (< ~counter~0 50)) (.cse2 (>= |ULTIMATE.start_main_~r~0#1| 0)) (.cse0 (= |ULTIMATE.start_main_~x~0#1| (+ (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~b~0#1|))))) (.cse3 (>= |ULTIMATE.start_main_~r~0#1| (* .cse12 2))) (.cse11 (< ~counter~0 49)) (.cse4 (= .cse12 |ULTIMATE.start_main_~b~0#1|)) (.cse1 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))) (.cse9 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse10 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse6 (<= 1 |ULTIMATE.start_main_~r~0#1|)) (.cse7 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse5) (and (not .cse5) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))))) (or (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) (and (<= (+ ~counter~0 (- 1)) 1) .cse2 .cse0 .cse3 .cse4 .cse1 .cse5 .cse9 .cse10 .cse6 .cse7) (and .cse2 .cse0 .cse3 .cse11 .cse4 .cse1 .cse5 .cse6 .cse7) (and .cse2 .cse0 .cse3 .cse4 .cse1 .cse5 .cse9 .cse10 .cse6 .cse7 (< (+ ~counter~0 1) 49)) (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse9 .cse10 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse5 .cse9 .cse10 .cse6 .cse7 .cse8))) (and .cse2 .cse0 .cse3 .cse11 .cse4 .cse1 .cse5 .cse9 .cse10 .cse6 .cse7)))) [2023-02-17 01:30:03,844 INFO L899 garLoopResultBuilder]: For program point L54-1(line 54) no Hoare annotation was computed. [2023-02-17 01:30:03,844 INFO L899 garLoopResultBuilder]: For program point L46-1(lines 46 58) no Hoare annotation was computed. [2023-02-17 01:30:03,844 INFO L895 garLoopResultBuilder]: At program point L46-3(lines 46 58) the Hoare annotation is: (let ((.cse6 (>= |ULTIMATE.start_main_~y~0#1| 1))) (let ((.cse4 (>= |ULTIMATE.start_main_~r~0#1| 0)) (.cse5 (= (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~b~0#1|)) (.cse9 (<= 1 |ULTIMATE.start_main_~r~0#1|)) (.cse10 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse6) (and (not .cse6) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))))) (let ((.cse14 (and .cse4 .cse5 .cse6 .cse9 .cse10)) (.cse15 (and .cse5 .cse6 .cse9 .cse10))) (let ((.cse2 (< (+ ~counter~0 1) 49)) (.cse11 (+ ~counter~0 (- 1))) (.cse7 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse8 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse12 (< ~counter~0 50)) (.cse0 (= |ULTIMATE.start_main_~x~0#1| (+ (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~b~0#1|))))) (.cse13 (< ~counter~0 49)) (.cse1 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))) (.cse3 (or .cse14 .cse15))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse2) (and (<= .cse11 1) .cse4 .cse0 .cse5 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (or (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12))) (and .cse4 .cse0 .cse13 .cse5 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse5 .cse1 (<= .cse11 0) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (or (and .cse12 .cse3) .cse14 .cse15)) (and .cse0 .cse13 .cse1 .cse3)))))) [2023-02-17 01:30:03,844 INFO L899 garLoopResultBuilder]: For program point L46-4(lines 46 58) no Hoare annotation was computed. [2023-02-17 01:30:03,845 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 01:30:03,845 INFO L895 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (let ((.cse3 (>= |ULTIMATE.start_main_~y~0#1| 1))) (let ((.cse0 (= |ULTIMATE.start_main_~x~0#1| (+ (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~b~0#1|))))) (.cse1 (= (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~b~0#1|)) (.cse2 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))) (.cse4 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse3) (and (not .cse3) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))))) (or (and .cse0 (< ~counter~0 49) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse4 (< (+ ~counter~0 1) 49)) (and .cse0 .cse1 .cse2 (<= (+ ~counter~0 (- 1)) 0) (= |ULTIMATE.start_main_~b~0#1| 0) .cse3 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| 0) .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse4 (< ~counter~0 50))))) [2023-02-17 01:30:03,845 INFO L895 garLoopResultBuilder]: At program point L38-1(line 38) the Hoare annotation is: (let ((.cse3 (>= |ULTIMATE.start_main_~y~0#1| 1))) (let ((.cse0 (= |ULTIMATE.start_main_~x~0#1| (+ (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~b~0#1|))))) (.cse1 (= (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~b~0#1|)) (.cse2 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))) (.cse4 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse3) (and (not .cse3) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))))) (or (and .cse0 (< ~counter~0 49) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 (<= (+ ~counter~0 (- 1)) 0) .cse3 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse4 (< (+ ~counter~0 1) 49)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse4 (< ~counter~0 50))))) [2023-02-17 01:30:03,845 INFO L899 garLoopResultBuilder]: For program point L63(line 63) no Hoare annotation was computed. [2023-02-17 01:30:03,845 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (let ((.cse8 (>= |ULTIMATE.start_main_~y~0#1| 1))) (let ((.cse6 (>= |ULTIMATE.start_main_~r~0#1| 0)) (.cse7 (= (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~b~0#1|)) (.cse9 (<= 1 |ULTIMATE.start_main_~r~0#1|)) (.cse10 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse8) (and (not .cse8) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))))) (let ((.cse4 (< ~counter~0 50)) (.cse2 (let ((.cse11 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse12 (= |ULTIMATE.start_main_~q~0#1| 0))) (or (and .cse6 .cse7 .cse8 .cse11 .cse12 .cse9 .cse10) (and .cse7 .cse8 .cse11 .cse12 .cse9 .cse10)))) (.cse0 (= |ULTIMATE.start_main_~x~0#1| (+ (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~b~0#1|))))) (.cse3 (< ~counter~0 49)) (.cse1 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))) (.cse5 (or (and .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse7 .cse8 .cse9 .cse10)))) (or (and (<= (+ ~counter~0 (- 1)) 1) .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse1 .cse2) (and .cse0 .cse1 .cse4 .cse5) (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse5) (and .cse0 .cse1 .cse4 .cse2) (and .cse0 .cse1 (< (+ ~counter~0 1) 49) .cse2) (and .cse0 .cse3 .cse1 .cse5))))) [2023-02-17 01:30:03,845 INFO L895 garLoopResultBuilder]: At program point L47-1(line 47) the Hoare annotation is: (let ((.cse8 (>= |ULTIMATE.start_main_~y~0#1| 1))) (let ((.cse6 (>= |ULTIMATE.start_main_~r~0#1| 0)) (.cse7 (= (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~b~0#1|)) (.cse9 (<= 1 |ULTIMATE.start_main_~r~0#1|)) (.cse10 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse8) (and (not .cse8) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))))) (let ((.cse4 (< ~counter~0 50)) (.cse2 (let ((.cse11 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse12 (= |ULTIMATE.start_main_~q~0#1| 0))) (or (and .cse6 .cse7 .cse8 .cse11 .cse12 .cse9 .cse10) (and .cse7 .cse8 .cse11 .cse12 .cse9 .cse10)))) (.cse0 (= |ULTIMATE.start_main_~x~0#1| (+ (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~b~0#1|))))) (.cse3 (< ~counter~0 49)) (.cse1 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))) (.cse5 (or (and .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse7 .cse8 .cse9 .cse10)))) (or (and (<= (+ ~counter~0 (- 1)) 1) .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse1 .cse2) (and .cse0 .cse1 .cse4 .cse5) (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse5) (and .cse0 .cse1 .cse4 .cse2) (and .cse0 .cse1 (< (+ ~counter~0 1) 49) .cse2) (and .cse0 .cse3 .cse1 .cse5))))) [2023-02-17 01:30:03,846 INFO L899 garLoopResultBuilder]: For program point L39(lines 37 61) no Hoare annotation was computed. [2023-02-17 01:30:03,846 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2023-02-17 01:30:03,846 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2023-02-17 01:30:03,846 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2023-02-17 01:30:03,846 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2023-02-17 01:30:03,846 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 20) the Hoare annotation is: (let ((.cse15 (+ ~counter~0 (- 1)))) (let ((.cse13 (< (+ ~counter~0 1) 49)) (.cse3 (= |__VERIFIER_assert_#in~cond| 0)) (.cse1 (<= .cse15 1)) (.cse6 (= |__VERIFIER_assert_#in~cond| 1)) (.cse14 (< ~counter~0 50)) (.cse5 (< ~counter~0 49)) (.cse9 (<= .cse15 0))) (let ((.cse8 (not .cse9)) (.cse7 (not .cse5)) (.cse11 (and .cse6 .cse14)) (.cse0 (not .cse1)) (.cse4 (not .cse6)) (.cse10 (not .cse14)) (.cse2 (not .cse3)) (.cse12 (not .cse13))) (and (or .cse0 (and .cse1 .cse2) .cse3) (or .cse4 (and .cse5 .cse6) .cse7) (or .cse8 .cse3 (and .cse2 .cse9)) (or (and .cse4 (or .cse4 .cse10)) .cse11 .cse6) (or .cse4 .cse12 (and .cse6 .cse13)) (or (and .cse2 .cse5) .cse3 .cse7) (or .cse0 .cse4 .cse3 (and .cse1 .cse2 .cse6)) (or .cse8 .cse4 (and .cse2 .cse9 .cse6) .cse3) (or (and .cse2 .cse6 .cse14) .cse4 .cse3 .cse10) (or (and .cse2 .cse5 .cse6) .cse4 .cse3 .cse7) (or .cse4 (and .cse2 .cse6 .cse13) .cse3 .cse12) (or .cse4 .cse11 .cse10) (or .cse0 .cse4 (and .cse1 .cse6)) (or (and .cse2 .cse14) .cse3 .cse10) (or (and .cse2 .cse13) .cse3 .cse12))))) [2023-02-17 01:30:03,846 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2023-02-17 01:30:03,850 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:30:03,851 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 01:30:03,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 01:30:03 BoogieIcfgContainer [2023-02-17 01:30:03,886 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 01:30:03,887 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 01:30:03,887 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 01:30:03,887 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 01:30:03,888 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 01:29:59" (3/4) ... [2023-02-17 01:30:03,890 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 01:30:03,894 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-17 01:30:03,898 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2023-02-17 01:30:03,898 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-17 01:30:03,898 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-17 01:30:03,899 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 01:30:03,925 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 01:30:03,926 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 01:30:03,926 INFO L158 Benchmark]: Toolchain (without parser) took 5208.60ms. Allocated memory was 123.7MB in the beginning and 167.8MB in the end (delta: 44.0MB). Free memory was 78.2MB in the beginning and 126.2MB in the end (delta: -48.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 01:30:03,927 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 123.7MB. Free memory was 94.9MB in the beginning and 94.8MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 01:30:03,927 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.71ms. Allocated memory is still 123.7MB. Free memory was 78.2MB in the beginning and 67.6MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 01:30:03,927 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.99ms. Allocated memory is still 123.7MB. Free memory was 67.6MB in the beginning and 66.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 01:30:03,927 INFO L158 Benchmark]: Boogie Preprocessor took 14.40ms. Allocated memory is still 123.7MB. Free memory was 66.0MB in the beginning and 64.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 01:30:03,928 INFO L158 Benchmark]: RCFGBuilder took 223.00ms. Allocated memory was 123.7MB in the beginning and 167.8MB in the end (delta: 44.0MB). Free memory was 64.7MB in the beginning and 136.3MB in the end (delta: -71.6MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2023-02-17 01:30:03,928 INFO L158 Benchmark]: TraceAbstraction took 4713.90ms. Allocated memory is still 167.8MB. Free memory was 136.3MB in the beginning and 129.4MB in the end (delta: 6.9MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2023-02-17 01:30:03,928 INFO L158 Benchmark]: Witness Printer took 38.72ms. Allocated memory is still 167.8MB. Free memory was 129.4MB in the beginning and 126.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 01:30:03,930 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.12ms. Allocated memory is still 123.7MB. Free memory was 94.9MB in the beginning and 94.8MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.71ms. Allocated memory is still 123.7MB. Free memory was 78.2MB in the beginning and 67.6MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.99ms. Allocated memory is still 123.7MB. Free memory was 67.6MB in the beginning and 66.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.40ms. Allocated memory is still 123.7MB. Free memory was 66.0MB in the beginning and 64.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 223.00ms. Allocated memory was 123.7MB in the beginning and 167.8MB in the end (delta: 44.0MB). Free memory was 64.7MB in the beginning and 136.3MB in the end (delta: -71.6MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4713.90ms. Allocated memory is still 167.8MB. Free memory was 136.3MB in the beginning and 129.4MB in the end (delta: 6.9MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * Witness Printer took 38.72ms. Allocated memory is still 167.8MB. Free memory was 129.4MB in the beginning and 126.2MB 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: 17]: 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, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 225 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 207 mSDsluCounter, 1007 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 686 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 622 IncrementalHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 321 mSDtfsCounter, 622 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 420 GetRequests, 343 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202occurred in iteration=9, InterpolantAutomatonStates: 63, 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, 10 MinimizatonAttempts, 33 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 71 PreInvPairs, 131 NumberOfFragments, 4595 HoareAnnotationTreeSize, 71 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 405 ConstructedInterpolants, 0 QuantifiedInterpolants, 1517 SizeOfPredicates, 39 NumberOfNonLiveVariables, 891 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 15 InterpolantComputations, 8 PerfectInterpolantSequences, 374/418 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: 23]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((((((((x == (a + q) * y + (r + -b) && x == r + q * y) && counter + 1 < 49) && (((((r >= 0 && a * y == b) && y >= 1) && 1 <= r) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || (((a * y == b && y >= 1) && 1 <= r) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))))) || (((((((((r >= 0 && x == (a + q) * y + (r + -b)) && a * y == b) && x == r + q * y) && y >= 1) && r == x) && q == 0) && 1 <= r) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && counter + 1 < 49)) || (((((((((counter + -1 <= 1 && r >= 0) && x == (a + q) * y + (r + -b)) && a * y == b) && x == r + q * y) && y >= 1) && r == x) && q == 0) && 1 <= r) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((x == (a + q) * y + (r + -b) && x == r + q * y) && (((((((r >= 0 && a * y == b) && y >= 1) && r == x) && q == 0) && 1 <= r) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || (((((((r >= 0 && a * y == b) && y >= 1) && r == x) && q == 0) && 1 <= r) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && counter < 50)))) || (((((((((r >= 0 && x == (a + q) * y + (r + -b)) && counter < 49) && a * y == b) && x == r + q * y) && y >= 1) && r == x) && q == 0) && 1 <= r) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((((x == (a + q) * y + (r + -b) && a * y == b) && x == r + q * y) && counter + -1 <= 0) && y >= 1) && r == x) && q == 0) && 1 <= r) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((x == (a + q) * y + (r + -b) && x == r + q * y) && (((counter < 50 && (((((r >= 0 && a * y == b) && y >= 1) && 1 <= r) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || (((a * y == b && y >= 1) && 1 <= r) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))))) || ((((r >= 0 && a * y == b) && y >= 1) && 1 <= r) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || (((a * y == b && y >= 1) && 1 <= r) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))))) || (((x == (a + q) * y + (r + -b) && counter < 49) && x == r + q * y) && (((((r >= 0 && a * y == b) && y >= 1) && 1 <= r) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || (((a * y == b && y >= 1) && 1 <= r) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))))) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: (((((((((((((x == (a + q) * y + (r + -b) && a * y == b) && x == r + q * y) && b == 0) && y >= 1) && r == x) && counter <= 0) && q == 0) && a == 0) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || (((((x == (a + q) * y + (r + -b) && counter < 49) && a * y == b) && x == r + q * y) && y >= 1) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || (((((x == (a + q) * y + (r + -b) && a * y == b) && x == r + q * y) && y >= 1) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && counter + 1 < 49)) || (((((counter + -1 <= 1 && x == (a + q) * y + (r + -b)) && a * y == b) && x == r + q * y) && y >= 1) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((x == (a + q) * y + (r + -b) && a * y == b) && x == r + q * y) && y >= 1) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || (((((x == (a + q) * y + (r + -b) && a * y == b) && x == r + q * y) && y >= 1) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && counter < 50) RESULT: Ultimate proved your program to be correct! [2023-02-17 01:30:03,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE