./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3f9b33d2a8120d9ea8a3a6c5d650c2a90b549ffb583b3e9890b411aeb4530efd --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 01:55:56,392 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 01:55:56,394 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 01:55:56,418 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 01:55:56,418 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 01:55:56,421 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 01:55:56,422 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 01:55:56,424 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 01:55:56,426 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 01:55:56,429 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 01:55:56,429 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 01:55:56,431 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 01:55:56,431 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 01:55:56,432 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 01:55:56,434 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 01:55:56,435 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 01:55:56,436 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 01:55:56,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 01:55:56,438 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 01:55:56,439 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 01:55:56,441 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 01:55:56,442 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 01:55:56,442 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 01:55:56,443 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 01:55:56,448 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 01:55:56,450 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 01:55:56,450 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 01:55:56,450 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 01:55:56,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 01:55:56,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 01:55:56,452 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 01:55:56,452 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 01:55:56,453 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 01:55:56,454 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 01:55:56,455 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 01:55:56,455 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 01:55:56,455 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 01:55:56,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 01:55:56,455 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 01:55:56,456 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 01:55:56,457 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 01:55:56,458 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 01:55:56,480 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 01:55:56,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 01:55:56,481 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 01:55:56,481 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 01:55:56,489 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 01:55:56,489 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 01:55:56,489 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 01:55:56,490 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 01:55:56,490 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 01:55:56,490 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 01:55:56,491 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 01:55:56,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 01:55:56,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 01:55:56,491 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 01:55:56,491 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 01:55:56,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 01:55:56,491 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 01:55:56,492 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 01:55:56,492 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 01:55:56,492 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 01:55:56,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 01:55:56,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 01:55:56,492 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 01:55:56,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 01:55:56,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 01:55:56,493 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 01:55:56,493 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 01:55:56,493 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 01:55:56,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 01:55:56,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 01:55:56,494 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 01:55:56,494 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 01:55:56,494 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 01:55:56,494 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 01:55:56,495 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 01:55:56,495 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 -> 3f9b33d2a8120d9ea8a3a6c5d650c2a90b549ffb583b3e9890b411aeb4530efd [2023-02-18 01:55:56,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 01:55:56,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 01:55:56,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 01:55:56,715 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 01:55:56,715 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 01:55:56,716 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound5.c [2023-02-18 01:55:57,641 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 01:55:57,806 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 01:55:57,806 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound5.c [2023-02-18 01:55:57,810 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2610ff37e/b8e92204927d404db53548812af1579c/FLAG612520320 [2023-02-18 01:55:57,818 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2610ff37e/b8e92204927d404db53548812af1579c [2023-02-18 01:55:57,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 01:55:57,821 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 01:55:57,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 01:55:57,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 01:55:57,824 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 01:55:57,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:55:57" (1/1) ... [2023-02-18 01:55:57,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44b0dc3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:55:57, skipping insertion in model container [2023-02-18 01:55:57,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:55:57" (1/1) ... [2023-02-18 01:55:57,829 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 01:55:57,837 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 01:55:57,914 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/egcd-ll_valuebound5.c[489,502] [2023-02-18 01:55:57,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 01:55:57,929 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 01:55:57,944 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/egcd-ll_valuebound5.c[489,502] [2023-02-18 01:55:57,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 01:55:57,962 INFO L208 MainTranslator]: Completed translation [2023-02-18 01:55:57,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:55:57 WrapperNode [2023-02-18 01:55:57,962 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 01:55:57,963 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 01:55:57,963 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 01:55:57,963 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 01:55:57,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:55:57" (1/1) ... [2023-02-18 01:55:57,972 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:55:57" (1/1) ... [2023-02-18 01:55:57,981 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2023-02-18 01:55:57,981 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 01:55:57,982 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 01:55:57,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 01:55:57,982 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 01:55:57,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:55:57" (1/1) ... [2023-02-18 01:55:57,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:55:57" (1/1) ... [2023-02-18 01:55:57,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:55:57" (1/1) ... [2023-02-18 01:55:57,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:55:57" (1/1) ... [2023-02-18 01:55:57,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:55:57" (1/1) ... [2023-02-18 01:55:57,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:55:57" (1/1) ... [2023-02-18 01:55:57,992 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:55:57" (1/1) ... [2023-02-18 01:55:57,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:55:57" (1/1) ... [2023-02-18 01:55:57,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 01:55:57,994 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 01:55:57,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 01:55:57,995 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 01:55:57,995 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:55:57" (1/1) ... [2023-02-18 01:55:58,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 01:55:58,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:55:58,026 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-18 01:55:58,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-18 01:55:58,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 01:55:58,052 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-18 01:55:58,052 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-18 01:55:58,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 01:55:58,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 01:55:58,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 01:55:58,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 01:55:58,053 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 01:55:58,097 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 01:55:58,098 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 01:55:58,193 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 01:55:58,196 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 01:55:58,197 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-18 01:55:58,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:55:58 BoogieIcfgContainer [2023-02-18 01:55:58,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 01:55:58,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 01:55:58,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 01:55:58,202 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 01:55:58,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 01:55:57" (1/3) ... [2023-02-18 01:55:58,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a8b043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:55:58, skipping insertion in model container [2023-02-18 01:55:58,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:55:57" (2/3) ... [2023-02-18 01:55:58,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a8b043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:55:58, skipping insertion in model container [2023-02-18 01:55:58,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:55:58" (3/3) ... [2023-02-18 01:55:58,204 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd-ll_valuebound5.c [2023-02-18 01:55:58,215 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 01:55:58,215 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 01:55:58,244 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 01:55:58,248 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;@4e0a2c72, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 01:55:58,248 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 01:55:58,251 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-18 01:55:58,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-18 01:55:58,256 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:55:58,256 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:55:58,256 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:55:58,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:55:58,260 INFO L85 PathProgramCache]: Analyzing trace with hash 501437177, now seen corresponding path program 1 times [2023-02-18 01:55:58,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:55:58,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151402864] [2023-02-18 01:55:58,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:55:58,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:55:58,329 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:55:58,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1704260562] [2023-02-18 01:55:58,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:55:58,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:55:58,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:55:58,332 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:55:58,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-18 01:55:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:55:58,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 01:55:58,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:55:58,461 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-18 01:55:58,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:55:58,521 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-18 01:55:58,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:55:58,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151402864] [2023-02-18 01:55:58,522 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:55:58,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704260562] [2023-02-18 01:55:58,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704260562] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-18 01:55:58,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 01:55:58,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2023-02-18 01:55:58,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234528980] [2023-02-18 01:55:58,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 01:55:58,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 01:55:58,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:55:58,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 01:55:58,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-02-18 01:55:58,562 INFO L87 Difference]: Start difference. First operand has 32 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 01:55:58,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:55:58,678 INFO L93 Difference]: Finished difference Result 79 states and 134 transitions. [2023-02-18 01:55:58,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 01:55:58,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2023-02-18 01:55:58,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:55:58,685 INFO L225 Difference]: With dead ends: 79 [2023-02-18 01:55:58,685 INFO L226 Difference]: Without dead ends: 42 [2023-02-18 01:55:58,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-02-18 01:55:58,695 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 11 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:55:58,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 145 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 01:55:58,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-02-18 01:55:58,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2023-02-18 01:55:58,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-02-18 01:55:58,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2023-02-18 01:55:58,723 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 29 [2023-02-18 01:55:58,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:55:58,733 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2023-02-18 01:55:58,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 01:55:58,733 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2023-02-18 01:55:58,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-18 01:55:58,735 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:55:58,735 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:55:58,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-18 01:55:58,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-18 01:55:58,938 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:55:58,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:55:58,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1017640517, now seen corresponding path program 1 times [2023-02-18 01:55:58,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:55:58,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143474611] [2023-02-18 01:55:58,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:55:58,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:55:58,966 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:55:58,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1112235427] [2023-02-18 01:55:58,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:55:58,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:55:58,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:55:58,985 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:55:58,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-18 01:55:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:55:59,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-18 01:55:59,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:55:59,148 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 01:55:59,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:55:59,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:55:59,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143474611] [2023-02-18 01:55:59,215 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:55:59,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112235427] [2023-02-18 01:55:59,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112235427] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 01:55:59,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 01:55:59,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-02-18 01:55:59,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878804972] [2023-02-18 01:55:59,216 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 01:55:59,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 01:55:59,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:55:59,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 01:55:59,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:55:59,218 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-18 01:55:59,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:55:59,417 INFO L93 Difference]: Finished difference Result 66 states and 98 transitions. [2023-02-18 01:55:59,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 01:55:59,418 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 34 [2023-02-18 01:55:59,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:55:59,420 INFO L225 Difference]: With dead ends: 66 [2023-02-18 01:55:59,420 INFO L226 Difference]: Without dead ends: 64 [2023-02-18 01:55:59,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-02-18 01:55:59,421 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 01:55:59,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 94 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 01:55:59,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-18 01:55:59,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2023-02-18 01:55:59,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 31 states have internal predecessors, (38), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-18 01:55:59,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 83 transitions. [2023-02-18 01:55:59,435 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 83 transitions. Word has length 34 [2023-02-18 01:55:59,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:55:59,435 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 83 transitions. [2023-02-18 01:55:59,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-18 01:55:59,436 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 83 transitions. [2023-02-18 01:55:59,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-18 01:55:59,436 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:55:59,437 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:55:59,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 01:55:59,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-02-18 01:55:59,645 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:55:59,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:55:59,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1133401081, now seen corresponding path program 1 times [2023-02-18 01:55:59,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:55:59,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670747952] [2023-02-18 01:55:59,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:55:59,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:55:59,663 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:55:59,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [869138823] [2023-02-18 01:55:59,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:55:59,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:55:59,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:55:59,672 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:55:59,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-18 01:55:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:55:59,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 01:55:59,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:55:59,750 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-18 01:55:59,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:55:59,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:55:59,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670747952] [2023-02-18 01:55:59,780 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:55:59,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869138823] [2023-02-18 01:55:59,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869138823] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 01:55:59,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 01:55:59,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2023-02-18 01:55:59,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52717995] [2023-02-18 01:55:59,781 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 01:55:59,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 01:55:59,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:55:59,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 01:55:59,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-02-18 01:55:59,782 INFO L87 Difference]: Start difference. First operand 57 states and 83 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-18 01:55:59,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:55:59,869 INFO L93 Difference]: Finished difference Result 64 states and 89 transitions. [2023-02-18 01:55:59,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 01:55:59,870 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2023-02-18 01:55:59,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:55:59,870 INFO L225 Difference]: With dead ends: 64 [2023-02-18 01:55:59,871 INFO L226 Difference]: Without dead ends: 60 [2023-02-18 01:55:59,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-02-18 01:55:59,872 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:55:59,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 145 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 01:55:59,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-18 01:55:59,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-02-18 01:55:59,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 32 states have (on average 1.28125) internal successors, (41), 34 states have internal predecessors, (41), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-18 01:55:59,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 83 transitions. [2023-02-18 01:55:59,899 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 83 transitions. Word has length 39 [2023-02-18 01:55:59,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:55:59,901 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 83 transitions. [2023-02-18 01:55:59,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-18 01:55:59,901 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2023-02-18 01:55:59,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-18 01:55:59,904 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:55:59,904 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 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-18 01:55:59,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-18 01:56:00,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:56:00,111 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:56:00,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:56:00,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1954831506, now seen corresponding path program 1 times [2023-02-18 01:56:00,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:56:00,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005054582] [2023-02-18 01:56:00,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:56:00,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:56:00,121 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:56:00,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1922569231] [2023-02-18 01:56:00,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:56:00,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:56:00,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:56:00,122 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:56:00,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-18 01:56:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:56:00,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 01:56:00,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:56:00,163 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-18 01:56:00,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 01:56:00,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:56:00,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005054582] [2023-02-18 01:56:00,164 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:56:00,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922569231] [2023-02-18 01:56:00,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922569231] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 01:56:00,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 01:56:00,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 01:56:00,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851215405] [2023-02-18 01:56:00,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 01:56:00,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 01:56:00,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:56:00,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 01:56:00,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 01:56:00,165 INFO L87 Difference]: Start difference. First operand 60 states and 83 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-02-18 01:56:00,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:56:00,209 INFO L93 Difference]: Finished difference Result 66 states and 88 transitions. [2023-02-18 01:56:00,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 01:56:00,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 45 [2023-02-18 01:56:00,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:56:00,210 INFO L225 Difference]: With dead ends: 66 [2023-02-18 01:56:00,210 INFO L226 Difference]: Without dead ends: 64 [2023-02-18 01:56:00,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 01:56:00,211 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 5 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 01:56:00,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 123 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 01:56:00,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-18 01:56:00,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-02-18 01:56:00,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 37 states have internal predecessors, (44), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-18 01:56:00,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2023-02-18 01:56:00,234 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 86 transitions. Word has length 45 [2023-02-18 01:56:00,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:56:00,234 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 86 transitions. [2023-02-18 01:56:00,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-02-18 01:56:00,234 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 86 transitions. [2023-02-18 01:56:00,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-18 01:56:00,235 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:56:00,235 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:56:00,257 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-18 01:56:00,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:56:00,443 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:56:00,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:56:00,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1265228631, now seen corresponding path program 1 times [2023-02-18 01:56:00,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:56:00,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119829760] [2023-02-18 01:56:00,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:56:00,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:56:00,452 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:56:00,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [835057351] [2023-02-18 01:56:00,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:56:00,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:56:00,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:56:00,454 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:56:00,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-18 01:56:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:56:00,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 01:56:00,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:56:00,525 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-18 01:56:00,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:56:00,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:56:00,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119829760] [2023-02-18 01:56:00,587 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:56:00,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835057351] [2023-02-18 01:56:00,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835057351] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 01:56:00,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 01:56:00,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2023-02-18 01:56:00,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175547274] [2023-02-18 01:56:00,588 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 01:56:00,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 01:56:00,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:56:00,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 01:56:00,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-02-18 01:56:00,589 INFO L87 Difference]: Start difference. First operand 64 states and 86 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-18 01:56:00,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:56:00,655 INFO L93 Difference]: Finished difference Result 80 states and 104 transitions. [2023-02-18 01:56:00,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 01:56:00,656 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2023-02-18 01:56:00,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:56:00,657 INFO L225 Difference]: With dead ends: 80 [2023-02-18 01:56:00,657 INFO L226 Difference]: Without dead ends: 78 [2023-02-18 01:56:00,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-02-18 01:56:00,657 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 01:56:00,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 149 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 01:56:00,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-18 01:56:00,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2023-02-18 01:56:00,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 8 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2023-02-18 01:56:00,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2023-02-18 01:56:00,666 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 47 [2023-02-18 01:56:00,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:56:00,666 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2023-02-18 01:56:00,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-18 01:56:00,667 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2023-02-18 01:56:00,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-18 01:56:00,667 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:56:00,667 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 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-18 01:56:00,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-18 01:56:00,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:56:00,872 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:56:00,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:56:00,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1617953190, now seen corresponding path program 1 times [2023-02-18 01:56:00,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:56:00,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736408346] [2023-02-18 01:56:00,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:56:00,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:56:00,896 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:56:00,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [497684228] [2023-02-18 01:56:00,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:56:00,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:56:00,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:56:00,898 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:56:00,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-18 01:56:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:56:00,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-18 01:56:00,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:56:00,987 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-18 01:56:00,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:56:01,080 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-18 01:56:01,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:56:01,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736408346] [2023-02-18 01:56:01,081 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:56:01,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497684228] [2023-02-18 01:56:01,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497684228] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:56:01,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:56:01,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2023-02-18 01:56:01,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889017878] [2023-02-18 01:56:01,082 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:56:01,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 01:56:01,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:56:01,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 01:56:01,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-02-18 01:56:01,085 INFO L87 Difference]: Start difference. First operand 75 states and 98 transitions. Second operand has 12 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-18 01:56:01,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:56:01,192 INFO L93 Difference]: Finished difference Result 84 states and 108 transitions. [2023-02-18 01:56:01,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 01:56:01,192 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 50 [2023-02-18 01:56:01,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:56:01,194 INFO L225 Difference]: With dead ends: 84 [2023-02-18 01:56:01,194 INFO L226 Difference]: Without dead ends: 80 [2023-02-18 01:56:01,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:56:01,196 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 16 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:56:01,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 136 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 01:56:01,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-18 01:56:01,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-02-18 01:56:01,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2023-02-18 01:56:01,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 101 transitions. [2023-02-18 01:56:01,215 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 101 transitions. Word has length 50 [2023-02-18 01:56:01,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:56:01,216 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 101 transitions. [2023-02-18 01:56:01,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-18 01:56:01,217 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 101 transitions. [2023-02-18 01:56:01,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-18 01:56:01,219 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:56:01,219 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:56:01,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-18 01:56:01,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:56:01,424 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:56:01,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:56:01,424 INFO L85 PathProgramCache]: Analyzing trace with hash 860577929, now seen corresponding path program 1 times [2023-02-18 01:56:01,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:56:01,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389961775] [2023-02-18 01:56:01,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:56:01,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:56:01,432 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:56:01,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [742401433] [2023-02-18 01:56:01,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:56:01,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:56:01,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:56:01,434 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:56:01,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-18 01:56:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:56:01,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-18 01:56:01,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:56:01,527 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-02-18 01:56:01,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:56:01,643 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-02-18 01:56:01,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:56:01,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389961775] [2023-02-18 01:56:01,643 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:56:01,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742401433] [2023-02-18 01:56:01,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742401433] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:56:01,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:56:01,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-02-18 01:56:01,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678430885] [2023-02-18 01:56:01,643 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:56:01,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 01:56:01,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:56:01,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 01:56:01,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:56:01,644 INFO L87 Difference]: Start difference. First operand 80 states and 101 transitions. Second operand has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 7 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2023-02-18 01:56:03,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:56:06,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:56:06,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:56:06,965 INFO L93 Difference]: Finished difference Result 126 states and 164 transitions. [2023-02-18 01:56:06,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 01:56:06,966 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 7 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 52 [2023-02-18 01:56:06,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:56:06,967 INFO L225 Difference]: With dead ends: 126 [2023-02-18 01:56:06,967 INFO L226 Difference]: Without dead ends: 124 [2023-02-18 01:56:06,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2023-02-18 01:56:06,968 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 27 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 44 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2023-02-18 01:56:06,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 154 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 388 Invalid, 2 Unknown, 0 Unchecked, 5.2s Time] [2023-02-18 01:56:06,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-18 01:56:06,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 100. [2023-02-18 01:56:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 62 states have internal predecessors, (65), 28 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2023-02-18 01:56:06,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 120 transitions. [2023-02-18 01:56:06,990 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 120 transitions. Word has length 52 [2023-02-18 01:56:06,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:56:06,990 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 120 transitions. [2023-02-18 01:56:06,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 7 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2023-02-18 01:56:06,990 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 120 transitions. [2023-02-18 01:56:06,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-18 01:56:06,994 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:56:06,994 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:56:07,001 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-18 01:56:07,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:56:07,201 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:56:07,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:56:07,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1226126935, now seen corresponding path program 2 times [2023-02-18 01:56:07,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:56:07,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156932478] [2023-02-18 01:56:07,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:56:07,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:56:07,219 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:56:07,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [797670591] [2023-02-18 01:56:07,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 01:56:07,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:56:07,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:56:07,220 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:56:07,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-18 01:56:07,260 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 01:56:07,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:56:07,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-18 01:56:07,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:56:07,320 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-02-18 01:56:07,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:56:07,393 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-02-18 01:56:07,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:56:07,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156932478] [2023-02-18 01:56:07,394 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:56:07,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797670591] [2023-02-18 01:56:07,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797670591] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:56:07,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:56:07,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2023-02-18 01:56:07,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499846567] [2023-02-18 01:56:07,395 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:56:07,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 01:56:07,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:56:07,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 01:56:07,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-02-18 01:56:07,397 INFO L87 Difference]: Start difference. First operand 100 states and 120 transitions. Second operand has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 12 states have internal predecessors, (31), 7 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2023-02-18 01:56:07,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:56:07,875 INFO L93 Difference]: Finished difference Result 137 states and 172 transitions. [2023-02-18 01:56:07,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 01:56:07,875 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 12 states have internal predecessors, (31), 7 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) Word has length 57 [2023-02-18 01:56:07,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:56:07,876 INFO L225 Difference]: With dead ends: 137 [2023-02-18 01:56:07,876 INFO L226 Difference]: Without dead ends: 126 [2023-02-18 01:56:07,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2023-02-18 01:56:07,877 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 41 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 01:56:07,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 115 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 01:56:07,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-18 01:56:07,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 111. [2023-02-18 01:56:07,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 68 states have (on average 1.088235294117647) internal successors, (74), 72 states have internal predecessors, (74), 26 states have call successors, (26), 16 states have call predecessors, (26), 16 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2023-02-18 01:56:07,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2023-02-18 01:56:07,900 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 57 [2023-02-18 01:56:07,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:56:07,901 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2023-02-18 01:56:07,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 12 states have internal predecessors, (31), 7 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2023-02-18 01:56:07,901 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2023-02-18 01:56:07,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-18 01:56:07,902 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:56:07,902 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:56:07,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-18 01:56:08,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-02-18 01:56:08,107 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:56:08,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:56:08,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1236716699, now seen corresponding path program 1 times [2023-02-18 01:56:08,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:56:08,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139521028] [2023-02-18 01:56:08,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:56:08,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:56:08,114 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:56:08,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [74148082] [2023-02-18 01:56:08,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:56:08,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:56:08,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:56:08,116 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:56:08,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-18 01:56:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:56:08,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-18 01:56:08,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:56:08,193 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-02-18 01:56:08,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:56:08,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:56:08,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139521028] [2023-02-18 01:56:08,229 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:56:08,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74148082] [2023-02-18 01:56:08,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74148082] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 01:56:08,230 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 01:56:08,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2023-02-18 01:56:08,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427105549] [2023-02-18 01:56:08,230 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 01:56:08,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 01:56:08,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:56:08,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 01:56:08,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:56:08,231 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-02-18 01:56:08,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:56:08,358 INFO L93 Difference]: Finished difference Result 129 states and 151 transitions. [2023-02-18 01:56:08,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 01:56:08,359 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 65 [2023-02-18 01:56:08,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:56:08,360 INFO L225 Difference]: With dead ends: 129 [2023-02-18 01:56:08,360 INFO L226 Difference]: Without dead ends: 124 [2023-02-18 01:56:08,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-02-18 01:56:08,361 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 24 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:56:08,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 184 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 01:56:08,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-18 01:56:08,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2023-02-18 01:56:08,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 73 states have (on average 1.082191780821918) internal successors, (79), 77 states have internal predecessors, (79), 29 states have call successors, (29), 17 states have call predecessors, (29), 17 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2023-02-18 01:56:08,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2023-02-18 01:56:08,382 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 65 [2023-02-18 01:56:08,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:56:08,382 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2023-02-18 01:56:08,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-02-18 01:56:08,382 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2023-02-18 01:56:08,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-18 01:56:08,383 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:56:08,383 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:56:08,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-18 01:56:08,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:56:08,587 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:56:08,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:56:08,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1045444891, now seen corresponding path program 2 times [2023-02-18 01:56:08,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:56:08,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993882536] [2023-02-18 01:56:08,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:56:08,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:56:08,603 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:56:08,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [994128820] [2023-02-18 01:56:08,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 01:56:08,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:56:08,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:56:08,604 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-18 01:56:08,635 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-18 01:56:08,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 01:56:08,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:56:08,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-18 01:56:08,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:56:08,706 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 18 proven. 13 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-02-18 01:56:08,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:56:08,818 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-02-18 01:56:08,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:56:08,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993882536] [2023-02-18 01:56:08,819 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:56:08,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994128820] [2023-02-18 01:56:08,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994128820] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:56:08,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:56:08,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2023-02-18 01:56:08,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067996814] [2023-02-18 01:56:08,820 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:56:08,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-18 01:56:08,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:56:08,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-18 01:56:08,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2023-02-18 01:56:08,821 INFO L87 Difference]: Start difference. First operand 120 states and 136 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 14 states have internal predecessors, (33), 8 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2023-02-18 01:56:09,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:56:09,202 INFO L93 Difference]: Finished difference Result 132 states and 157 transitions. [2023-02-18 01:56:09,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 01:56:09,202 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 14 states have internal predecessors, (33), 8 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 65 [2023-02-18 01:56:09,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:56:09,202 INFO L225 Difference]: With dead ends: 132 [2023-02-18 01:56:09,202 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 01:56:09,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2023-02-18 01:56:09,203 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 31 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 01:56:09,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 213 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 01:56:09,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 01:56:09,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 01:56:09,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 01:56:09,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 01:56:09,204 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2023-02-18 01:56:09,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:56:09,204 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 01:56:09,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 14 states have internal predecessors, (33), 8 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2023-02-18 01:56:09,204 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 01:56:09,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 01:56:09,208 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 01:56:09,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-18 01:56:09,413 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-18 01:56:09,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 01:56:09,438 INFO L895 garLoopResultBuilder]: At program point L35-2(lines 35 52) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse7 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse21 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse4 (<= |ULTIMATE.start_main_~y~0#1| 5)) (.cse19 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse6 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse13 (- |ULTIMATE.start_main_~s~0#1|))) (let ((.cse5 (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (.cse1 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse15 (= (+ |ULTIMATE.start_main_~s~0#1| 0) 1)) (.cse8 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse9 (let ((.cse29 (+ |ULTIMATE.start_main_~r~0#1| .cse13)) (.cse28 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse28) (* |ULTIMATE.start_main_~y~0#1| .cse29))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse29)) (* |ULTIMATE.start_main_~s~0#1| .cse28)) 1))))) (.cse10 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)) (.cse11 (or (and .cse3 .cse4 .cse19 .cse6 .cse7 .cse21) (and .cse4 .cse19 .cse6)))) (let ((.cse0 (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|)) (.cse2 (let ((.cse24 (or (and .cse4 .cse6 .cse8 .cse9 .cse10 .cse11) (let ((.cse26 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) 1)) (.cse27 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (and .cse4 .cse6 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|)) (= .cse26 0) .cse8 (= (+ (* .cse27 |ULTIMATE.start_main_~p~0#1|) (- (* |ULTIMATE.start_main_~r~0#1| .cse26))) 1) (= .cse27 1) .cse9 .cse10 .cse11))))) (or (and .cse5 .cse24 .cse1) (let ((.cse25 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~y~0#1|))) (and (= |ULTIMATE.start_main_~q~0#1| (+ (- 1) 0)) .cse24 (= (+ (* |ULTIMATE.start_main_~x~0#1| 1) (* |ULTIMATE.start_main_~y~0#1| 0)) .cse25) .cse1 .cse15 (= |ULTIMATE.start_main_~x~0#1| .cse25)))))) (.cse22 (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|)) (.cse23 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1)) (.cse12 (= |ULTIMATE.start_main_~s~0#1| 1))) (or (and (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse0) 1) .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse1 .cse9 .cse10 .cse11 .cse12) (let ((.cse14 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|))) (and (= (+ .cse13 0) |ULTIMATE.start_main_~r~0#1|) (= (+ |ULTIMATE.start_main_~q~0#1| .cse14) 0) (= .cse14 1) .cse1 .cse15 .cse2)) (and .cse8 (let ((.cse16 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse17 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse18 (let ((.cse20 (forall ((|ULTIMATE.start_main_~r~0#1| Int)) (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse0) 1)))) (or (and .cse4 .cse19 .cse6 .cse20) (and .cse3 .cse4 .cse19 .cse6 .cse7 .cse20 .cse21))))) (or (and .cse3 .cse4 .cse16 .cse6 .cse7 .cse17 .cse8 .cse18 .cse12) (and .cse4 .cse16 .cse6 .cse17 .cse8 .cse18 .cse12))) .cse10) (and .cse22 .cse1 .cse2 (= (+ |ULTIMATE.start_main_~p~0#1| 0) 1) .cse23) (and .cse3 (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) .cse4 .cse22 .cse6 .cse7 .cse8 .cse1 .cse9 .cse21 .cse10 .cse11 .cse23 .cse12))))) [2023-02-18 01:56:09,438 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 01:56:09,438 INFO L895 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~y~0#1| 5) (>= |ULTIMATE.start_main_~y~0#1| 0) (>= |ULTIMATE.start_main_~x~0#1| 1)) [2023-02-18 01:56:09,439 INFO L895 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (let ((.cse7 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse8 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse9 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~y~0#1| 5)) (.cse4 (>= |ULTIMATE.start_main_~y~0#1| 0))) (let ((.cse6 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse5 (let ((.cse18 (>= |ULTIMATE.start_main_~y~0#1| 1))) (or (and .cse7 .cse3 .cse18 .cse4 .cse8 .cse9) (and .cse3 .cse18 .cse4))))) (let ((.cse1 (let ((.cse11 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))) (let ((.cse10 (or (and .cse7 .cse3 .cse4 .cse8 .cse11 .cse5 .cse6) (and .cse3 .cse4 .cse11 .cse5))) (.cse12 (let ((.cse17 (+ |ULTIMATE.start_main_~r~0#1| (- |ULTIMATE.start_main_~s~0#1|))) (.cse16 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse16) (* |ULTIMATE.start_main_~y~0#1| .cse17))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse17)) (* |ULTIMATE.start_main_~s~0#1| .cse16)) 1))))) (.cse13 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|))) (or (and .cse10 .cse11 .cse12 .cse13) (let ((.cse14 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) 1)) (.cse15 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (and .cse10 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|)) (= .cse14 0) .cse11 (= (+ (* .cse15 |ULTIMATE.start_main_~p~0#1|) (- (* |ULTIMATE.start_main_~r~0#1| .cse14))) 1) (= .cse15 1) .cse12 .cse13)))))) (.cse2 (>= |ULTIMATE.start_main_~x~0#1| 1))) (or (let ((.cse0 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~y~0#1|))) (and (= |ULTIMATE.start_main_~q~0#1| (+ (- 1) 0)) (= (+ (* |ULTIMATE.start_main_~x~0#1| 1) (* |ULTIMATE.start_main_~y~0#1| 0)) .cse0) .cse1 .cse2 (= (+ |ULTIMATE.start_main_~s~0#1| 0) 1) (= |ULTIMATE.start_main_~x~0#1| .cse0))) (and (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|) .cse1 .cse2) (and .cse3 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) .cse4 (= |ULTIMATE.start_main_~q~0#1| 0) .cse5 .cse6) (and .cse7 (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|) .cse8 .cse1 .cse2 .cse9 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1)))))) [2023-02-18 01:56:09,439 INFO L895 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse7 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse21 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse4 (<= |ULTIMATE.start_main_~y~0#1| 5)) (.cse19 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse6 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse13 (- |ULTIMATE.start_main_~s~0#1|))) (let ((.cse5 (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (.cse1 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse15 (= (+ |ULTIMATE.start_main_~s~0#1| 0) 1)) (.cse8 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse9 (let ((.cse29 (+ |ULTIMATE.start_main_~r~0#1| .cse13)) (.cse28 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse28) (* |ULTIMATE.start_main_~y~0#1| .cse29))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse29)) (* |ULTIMATE.start_main_~s~0#1| .cse28)) 1))))) (.cse10 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)) (.cse11 (or (and .cse3 .cse4 .cse19 .cse6 .cse7 .cse21) (and .cse4 .cse19 .cse6)))) (let ((.cse0 (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|)) (.cse2 (let ((.cse24 (or (and .cse4 .cse6 .cse8 .cse9 .cse10 .cse11) (let ((.cse26 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) 1)) (.cse27 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (and .cse4 .cse6 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|)) (= .cse26 0) .cse8 (= (+ (* .cse27 |ULTIMATE.start_main_~p~0#1|) (- (* |ULTIMATE.start_main_~r~0#1| .cse26))) 1) (= .cse27 1) .cse9 .cse10 .cse11))))) (or (and .cse5 .cse24 .cse1) (let ((.cse25 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~y~0#1|))) (and (= |ULTIMATE.start_main_~q~0#1| (+ (- 1) 0)) .cse24 (= (+ (* |ULTIMATE.start_main_~x~0#1| 1) (* |ULTIMATE.start_main_~y~0#1| 0)) .cse25) .cse1 .cse15 (= |ULTIMATE.start_main_~x~0#1| .cse25)))))) (.cse22 (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|)) (.cse23 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1)) (.cse12 (= |ULTIMATE.start_main_~s~0#1| 1))) (or (and (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse0) 1) .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse1 .cse9 .cse10 .cse11 .cse12) (let ((.cse14 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|))) (and (= (+ .cse13 0) |ULTIMATE.start_main_~r~0#1|) (= (+ |ULTIMATE.start_main_~q~0#1| .cse14) 0) (= .cse14 1) .cse1 .cse15 .cse2)) (and .cse8 (let ((.cse16 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse17 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse18 (let ((.cse20 (forall ((|ULTIMATE.start_main_~r~0#1| Int)) (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse0) 1)))) (or (and .cse4 .cse19 .cse6 .cse20) (and .cse3 .cse4 .cse19 .cse6 .cse7 .cse20 .cse21))))) (or (and .cse3 .cse4 .cse16 .cse6 .cse7 .cse17 .cse8 .cse18 .cse12) (and .cse4 .cse16 .cse6 .cse17 .cse8 .cse18 .cse12))) .cse10) (and .cse22 .cse1 .cse2 (= (+ |ULTIMATE.start_main_~p~0#1| 0) 1) .cse23) (and .cse3 (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) .cse4 .cse22 .cse6 .cse7 .cse8 .cse1 .cse9 .cse21 .cse10 .cse11 .cse23 .cse12))))) [2023-02-18 01:56:09,439 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 01:56:09,439 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 18 59) the Hoare annotation is: true [2023-02-18 01:56:09,440 INFO L899 garLoopResultBuilder]: For program point L38(lines 35 52) no Hoare annotation was computed. [2023-02-18 01:56:09,440 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse30 (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|))) (let ((.cse31 (- |ULTIMATE.start_main_~s~0#1|)) (.cse12 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)) (.cse14 (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse30) 1))) (let ((.cse17 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse28 (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse0 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse6 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse11 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse13 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse29 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse25 (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (.cse10 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse18 (= (+ |ULTIMATE.start_main_~s~0#1| 0) 1)) (.cse1 (<= |ULTIMATE.start_main_~y~0#1| 5)) (.cse27 (or .cse12 (not .cse14))) (.cse3 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse5 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse26 (let ((.cse37 (+ |ULTIMATE.start_main_~r~0#1| .cse31)) (.cse36 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse36) (* |ULTIMATE.start_main_~y~0#1| .cse37))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse37)) (* |ULTIMATE.start_main_~s~0#1| .cse36)) 1)))))) (let ((.cse15 (let ((.cse34 (or (and .cse1 .cse27 .cse3 .cse5) (and .cse1 .cse27 .cse3 .cse5 .cse26)))) (or (and .cse25 .cse34 .cse10) (let ((.cse35 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~y~0#1|))) (and (= |ULTIMATE.start_main_~q~0#1| (+ (- 1) 0)) (= (+ (* |ULTIMATE.start_main_~x~0#1| 1) (* |ULTIMATE.start_main_~y~0#1| 0)) .cse35) .cse34 .cse10 .cse18 (= |ULTIMATE.start_main_~x~0#1| .cse35)))))) (.cse19 (or (and .cse1 .cse3 .cse5 .cse12) (let ((.cse32 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) 1)) (.cse33 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (and .cse1 .cse3 .cse5 .cse29 (= .cse32 0) (= (+ (* .cse33 |ULTIMATE.start_main_~p~0#1|) (- (* |ULTIMATE.start_main_~r~0#1| .cse32))) 1) (= .cse33 1) .cse26 .cse12)))) (.cse20 (or (not .cse12) .cse25)) (.cse24 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse26 .cse11 .cse12 .cse13))) (.cse21 (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|)) (.cse22 (= (+ |ULTIMATE.start_main_~p~0#1| 0) 1)) (.cse23 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1)) (.cse16 (= (+ .cse31 0) |ULTIMATE.start_main_~r~0#1|)) (.cse2 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse4 (<= (+ |ULTIMATE.start_main_~b~0#1| 1) .cse28)) (.cse7 (= .cse17 1)) (.cse8 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse9 (forall ((|ULTIMATE.start_main_~r~0#1| Int)) (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse30) 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse15 .cse10) (and .cse16 (= (+ |ULTIMATE.start_main_~q~0#1| .cse17) 0) .cse15 .cse7 .cse10 .cse18) (and .cse19 .cse14 .cse20 .cse10) (and .cse19 .cse21 .cse14 .cse20 .cse10 .cse22 .cse23) (and .cse14 .cse10 (or (and .cse24 .cse25 .cse10) (and .cse24 .cse20 .cse10))) (and .cse14 .cse25 .cse4 .cse7 .cse8 .cse10 .cse13 (or (and .cse1 .cse2 .cse3 .cse5 .cse8 .cse9 .cse26 .cse12 .cse13) (and .cse1 .cse27 .cse2 .cse3 .cse5 .cse8 .cse9 .cse13))) (and .cse24 (<= (+ |ULTIMATE.start_main_~a~0#1| 1) .cse28) (<= |ULTIMATE.start_main_~a~0#1| .cse28) .cse0 (= |ULTIMATE.start_main_~y~0#1| .cse28) .cse21 .cse6 (= .cse17 0) .cse10 .cse11 .cse22 .cse23) (and .cse16 .cse1 .cse2 .cse14 .cse25 .cse3 .cse4 .cse5 .cse29 .cse7 .cse8 .cse9 .cse10 .cse26 .cse13)))))) [2023-02-18 01:56:09,440 INFO L895 garLoopResultBuilder]: At program point L36-1(line 36) the Hoare annotation is: (let ((.cse30 (- |ULTIMATE.start_main_~s~0#1|)) (.cse1 (<= |ULTIMATE.start_main_~y~0#1| 5)) (.cse3 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse5 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse12 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|))) (let ((.cse24 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse26 (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse29 (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|)) (.cse0 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse6 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse11 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse13 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse10 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse25 (= (+ |ULTIMATE.start_main_~s~0#1| 0) 1)) (.cse22 (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (.cse33 (and .cse1 .cse3 .cse5 .cse12)) (.cse27 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse28 (let ((.cse37 (+ |ULTIMATE.start_main_~r~0#1| .cse30)) (.cse36 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse36) (* |ULTIMATE.start_main_~y~0#1| .cse37))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse37)) (* |ULTIMATE.start_main_~s~0#1| .cse36)) 1)))))) (let ((.cse16 (or .cse33 (let ((.cse34 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) 1)) (.cse35 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (and .cse1 .cse3 .cse5 .cse27 (= .cse34 0) (= (+ (* .cse35 |ULTIMATE.start_main_~p~0#1|) (- (* |ULTIMATE.start_main_~r~0#1| .cse34))) 1) (= .cse35 1) .cse28 .cse12)))) (.cse17 (or (not .cse12) .cse22)) (.cse15 (let ((.cse31 (or .cse33 (and .cse1 .cse3 .cse5 .cse28 .cse12)))) (or (and .cse22 .cse10 .cse31) (let ((.cse32 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~y~0#1|))) (and (= |ULTIMATE.start_main_~q~0#1| (+ (- 1) 0)) (= (+ (* |ULTIMATE.start_main_~x~0#1| 1) (* |ULTIMATE.start_main_~y~0#1| 0)) .cse32) .cse10 .cse25 (= |ULTIMATE.start_main_~x~0#1| .cse32) .cse31))))) (.cse21 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse28 .cse11 .cse12 .cse13))) (.cse18 (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|)) (.cse19 (= (+ |ULTIMATE.start_main_~p~0#1| 0) 1)) (.cse20 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1)) (.cse23 (= (+ .cse30 0) |ULTIMATE.start_main_~r~0#1|)) (.cse14 (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse29) 1)) (.cse4 (<= (+ |ULTIMATE.start_main_~b~0#1| 1) .cse26)) (.cse7 (= .cse24 1)) (.cse2 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse8 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse9 (forall ((|ULTIMATE.start_main_~r~0#1| Int)) (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse29) 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse15 .cse10) (and .cse16 .cse14 .cse17 .cse10) (and .cse16 .cse18 .cse14 .cse17 .cse10 .cse19 .cse20) (and .cse14 .cse10 (or (and .cse21 .cse22 .cse10) (and .cse21 .cse17 .cse10))) (and .cse23 (= (+ |ULTIMATE.start_main_~q~0#1| .cse24) 0) .cse15 .cse7 .cse10 .cse25) (and .cse21 (<= (+ |ULTIMATE.start_main_~a~0#1| 1) .cse26) (<= |ULTIMATE.start_main_~a~0#1| .cse26) .cse0 (= |ULTIMATE.start_main_~y~0#1| .cse26) .cse18 .cse6 (= .cse24 0) .cse10 .cse11 .cse19 .cse20) (and .cse23 .cse1 .cse2 .cse14 .cse22 .cse3 .cse4 .cse5 .cse27 .cse7 .cse8 .cse9 .cse10 .cse28 .cse13) (and .cse14 .cse22 .cse4 .cse7 .cse8 .cse10 .cse13 (or (and .cse1 .cse2 .cse3 .cse5 .cse8 .cse9 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse5 .cse8 .cse9 .cse28 .cse12 .cse13))))))) [2023-02-18 01:56:09,440 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 01:56:09,441 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 01:56:09,441 INFO L899 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2023-02-18 01:56:09,441 INFO L899 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2023-02-18 01:56:09,441 INFO L902 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: true [2023-02-18 01:56:09,441 INFO L895 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~y~0#1| 5) (>= |ULTIMATE.start_main_~y~0#1| 0)) [2023-02-18 01:56:09,441 INFO L895 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse7 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse18 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse4 (<= |ULTIMATE.start_main_~y~0#1| 5)) (.cse19 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse6 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse13 (- |ULTIMATE.start_main_~s~0#1|))) (let ((.cse5 (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (.cse1 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse15 (= (+ |ULTIMATE.start_main_~s~0#1| 0) 1)) (.cse8 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse9 (let ((.cse26 (+ |ULTIMATE.start_main_~r~0#1| .cse13)) (.cse25 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse25) (* |ULTIMATE.start_main_~y~0#1| .cse26))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse26)) (* |ULTIMATE.start_main_~s~0#1| .cse25)) 1))))) (.cse10 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)) (.cse11 (or (and .cse3 .cse4 .cse19 .cse6 .cse7 .cse18) (and .cse4 .cse19 .cse6)))) (let ((.cse2 (let ((.cse21 (or (and .cse4 .cse6 .cse8 .cse9 .cse10 .cse11) (let ((.cse23 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) 1)) (.cse24 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (and .cse4 .cse6 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|)) (= .cse23 0) .cse8 (= (+ (* .cse24 |ULTIMATE.start_main_~p~0#1|) (- (* |ULTIMATE.start_main_~r~0#1| .cse23))) 1) (= .cse24 1) .cse9 .cse10 .cse11))))) (or (and .cse5 .cse21 .cse1) (let ((.cse22 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~y~0#1|))) (and (= |ULTIMATE.start_main_~q~0#1| (+ (- 1) 0)) .cse21 (= (+ (* |ULTIMATE.start_main_~x~0#1| 1) (* |ULTIMATE.start_main_~y~0#1| 0)) .cse22) .cse1 .cse15 (= |ULTIMATE.start_main_~x~0#1| .cse22)))))) (.cse16 (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|)) (.cse17 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1)) (.cse0 (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|)) (.cse12 (= |ULTIMATE.start_main_~s~0#1| 1))) (or (and (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse0) 1) .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse1 .cse9 .cse10 .cse11 .cse12) (let ((.cse14 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|))) (and (= (+ .cse13 0) |ULTIMATE.start_main_~r~0#1|) (= (+ |ULTIMATE.start_main_~q~0#1| .cse14) 0) (= .cse14 1) .cse1 .cse15 .cse2)) (and .cse16 .cse1 .cse2 (= (+ |ULTIMATE.start_main_~p~0#1| 0) 1) .cse17) (and .cse3 (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) .cse4 .cse16 .cse6 .cse7 .cse8 .cse1 .cse9 .cse18 .cse10 .cse11 .cse17 .cse12) (and .cse4 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) .cse6 (= |ULTIMATE.start_main_~q~0#1| 0) (let ((.cse20 (forall ((|ULTIMATE.start_main_~r~0#1| Int)) (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse0) 1)))) (or (and .cse4 .cse19 .cse6 .cse20) (and .cse3 .cse4 .cse19 .cse6 .cse7 .cse20 .cse18))) .cse12))))) [2023-02-18 01:56:09,441 INFO L902 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: true [2023-02-18 01:56:09,441 INFO L899 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2023-02-18 01:56:09,442 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 51) no Hoare annotation was computed. [2023-02-18 01:56:09,442 INFO L895 garLoopResultBuilder]: At program point L43-2(lines 35 52) the Hoare annotation is: (let ((.cse30 (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|))) (let ((.cse31 (- |ULTIMATE.start_main_~s~0#1|)) (.cse12 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)) (.cse14 (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse30) 1))) (let ((.cse17 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse28 (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse0 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse6 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse11 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse13 (= |ULTIMATE.start_main_~s~0#1| 1)) (.cse29 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse25 (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (.cse10 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse18 (= (+ |ULTIMATE.start_main_~s~0#1| 0) 1)) (.cse1 (<= |ULTIMATE.start_main_~y~0#1| 5)) (.cse27 (or .cse12 (not .cse14))) (.cse3 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse5 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse26 (let ((.cse37 (+ |ULTIMATE.start_main_~r~0#1| .cse31)) (.cse36 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse36) (* |ULTIMATE.start_main_~y~0#1| .cse37))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse37)) (* |ULTIMATE.start_main_~s~0#1| .cse36)) 1)))))) (let ((.cse15 (let ((.cse34 (or (and .cse1 .cse27 .cse3 .cse5) (and .cse1 .cse27 .cse3 .cse5 .cse26)))) (or (and .cse25 .cse34 .cse10) (let ((.cse35 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~y~0#1|))) (and (= |ULTIMATE.start_main_~q~0#1| (+ (- 1) 0)) (= (+ (* |ULTIMATE.start_main_~x~0#1| 1) (* |ULTIMATE.start_main_~y~0#1| 0)) .cse35) .cse34 .cse10 .cse18 (= |ULTIMATE.start_main_~x~0#1| .cse35)))))) (.cse19 (or (and .cse1 .cse3 .cse5 .cse12) (let ((.cse32 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) 1)) (.cse33 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (and .cse1 .cse3 .cse5 .cse29 (= .cse32 0) (= (+ (* .cse33 |ULTIMATE.start_main_~p~0#1|) (- (* |ULTIMATE.start_main_~r~0#1| .cse32))) 1) (= .cse33 1) .cse26 .cse12)))) (.cse20 (or (not .cse12) .cse25)) (.cse24 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse26 .cse11 .cse12 .cse13))) (.cse21 (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|)) (.cse22 (= (+ |ULTIMATE.start_main_~p~0#1| 0) 1)) (.cse23 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1)) (.cse16 (= (+ .cse31 0) |ULTIMATE.start_main_~r~0#1|)) (.cse2 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse4 (<= (+ |ULTIMATE.start_main_~b~0#1| 1) .cse28)) (.cse7 (= .cse17 1)) (.cse8 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse9 (forall ((|ULTIMATE.start_main_~r~0#1| Int)) (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse30) 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse15 .cse10) (and .cse16 (= (+ |ULTIMATE.start_main_~q~0#1| .cse17) 0) .cse15 .cse7 .cse10 .cse18) (and .cse19 .cse14 .cse20 .cse10) (and .cse19 .cse21 .cse14 .cse20 .cse10 .cse22 .cse23) (and .cse14 .cse10 (or (and .cse24 .cse25 .cse10) (and .cse24 .cse20 .cse10))) (and .cse14 .cse25 .cse4 .cse7 .cse8 .cse10 .cse13 (or (and .cse1 .cse2 .cse3 .cse5 .cse8 .cse9 .cse26 .cse12 .cse13) (and .cse1 .cse27 .cse2 .cse3 .cse5 .cse8 .cse9 .cse13))) (and .cse24 (<= (+ |ULTIMATE.start_main_~a~0#1| 1) .cse28) (<= |ULTIMATE.start_main_~a~0#1| .cse28) .cse0 (= |ULTIMATE.start_main_~y~0#1| .cse28) .cse21 .cse6 (= .cse17 0) .cse10 .cse11 .cse22 .cse23) (and .cse16 .cse1 .cse2 .cse14 .cse25 .cse3 .cse4 .cse5 .cse29 .cse7 .cse8 .cse9 .cse10 .cse26 .cse13)))))) [2023-02-18 01:56:09,442 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse32 (- |ULTIMATE.start_main_~s~0#1|))) (let ((.cse24 (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (.cse27 (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~s~0#1|)) (.cse26 (= (+ |ULTIMATE.start_main_~s~0#1| 0) 1)) (.cse21 (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse17 (= (+ |ULTIMATE.start_main_~p~0#1| 0) 1)) (.cse20 (= (+ (* |ULTIMATE.start_main_~s~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~b~0#1|)) (.cse23 (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse14 (= (+ (- |ULTIMATE.start_main_~p~0#1|) 0) |ULTIMATE.start_main_~q~0#1|)) (.cse10 (>= |ULTIMATE.start_main_~x~0#1| 1)) (.cse18 (= (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~s~0#1|) 1)) (.cse0 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse1 (<= |ULTIMATE.start_main_~y~0#1| 5)) (.cse3 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse5 (>= |ULTIMATE.start_main_~y~0#1| 0)) (.cse6 (= |ULTIMATE.start_main_~r~0#1| 0)) (.cse22 (let ((.cse36 (+ |ULTIMATE.start_main_~r~0#1| .cse32)) (.cse35 (+ (- |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~p~0#1|))) (or (= (+ |ULTIMATE.start_main_~a~0#1| (- |ULTIMATE.start_main_~b~0#1|)) (+ (* |ULTIMATE.start_main_~x~0#1| .cse35) (* |ULTIMATE.start_main_~y~0#1| .cse36))) (not (= (+ (- (* |ULTIMATE.start_main_~q~0#1| .cse36)) (* |ULTIMATE.start_main_~s~0#1| .cse35)) 1))))) (.cse11 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse12 (= (+ (* |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~x~0#1|)) |ULTIMATE.start_main_~a~0#1|)) (.cse13 (= |ULTIMATE.start_main_~s~0#1| 1))) (let ((.cse25 (let ((.cse33 (let ((.cse34 (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse22 .cse11 .cse12 .cse13)))) (or (and .cse34 .cse20 .cse10) (and .cse34 .cse0 (= |ULTIMATE.start_main_~y~0#1| .cse23) .cse14 .cse6 .cse10 .cse11 .cse18))))) (or (and .cse33 .cse14 .cse10 .cse17 .cse18) (and .cse33 .cse10)))) (.cse19 (= (+ .cse32 0) |ULTIMATE.start_main_~r~0#1|)) (.cse16 (let ((.cse28 (or (and .cse1 .cse3 .cse5 .cse12) (and .cse1 .cse3 .cse5 .cse22 .cse12) (let ((.cse30 (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) 1)) (.cse31 (* (- 1) |ULTIMATE.start_main_~r~0#1|))) (and .cse1 .cse3 .cse5 .cse21 (= .cse30 0) (= (+ (* .cse31 |ULTIMATE.start_main_~p~0#1|) (- (* |ULTIMATE.start_main_~r~0#1| .cse30))) 1) (= .cse31 1) .cse22 .cse12))))) (or (and .cse20 .cse28 .cse10) (let ((.cse29 (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~y~0#1|))) (and (= |ULTIMATE.start_main_~q~0#1| (+ (- 1) 0)) (= (+ (* |ULTIMATE.start_main_~x~0#1| 1) (* |ULTIMATE.start_main_~y~0#1| 0)) .cse29) .cse28 .cse10 .cse26 (= |ULTIMATE.start_main_~x~0#1| .cse29)))))) (.cse15 (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse27) 1)) (.cse4 (<= (+ |ULTIMATE.start_main_~b~0#1| 1) .cse23)) (.cse7 (= .cse24 1)) (.cse2 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse8 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse9 (forall ((|ULTIMATE.start_main_~r~0#1| Int)) (= (+ (- (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) .cse27) 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse15 .cse16 .cse10 .cse17 .cse18) (and .cse19 .cse1 .cse2 .cse15 .cse20 .cse3 .cse4 .cse5 .cse21 .cse7 .cse8 .cse9 .cse10 .cse22 .cse12 .cse13) (and (<= (+ |ULTIMATE.start_main_~a~0#1| 1) .cse23) (<= |ULTIMATE.start_main_~a~0#1| .cse23) .cse0 .cse6 (= .cse24 0) .cse10 .cse25 .cse18) (and .cse15 .cse10 .cse25) (and .cse15 .cse16 .cse10) (and .cse19 (= (+ |ULTIMATE.start_main_~q~0#1| .cse24) 0) .cse7 .cse16 .cse10 .cse26) (and .cse15 .cse20 .cse4 .cse7 .cse8 .cse10 .cse13 (or (and .cse1 .cse2 .cse3 .cse5 .cse8 .cse9 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse5 .cse8 .cse9 .cse22 .cse12 .cse13))))))) [2023-02-18 01:56:09,442 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 7 9) the Hoare annotation is: true [2023-02-18 01:56:09,443 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2023-02-18 01:56:09,444 INFO L899 garLoopResultBuilder]: For program point L8-2(lines 7 9) no Hoare annotation was computed. [2023-02-18 01:56:09,444 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 7 9) no Hoare annotation was computed. [2023-02-18 01:56:09,444 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 13) no Hoare annotation was computed. [2023-02-18 01:56:09,444 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 14) no Hoare annotation was computed. [2023-02-18 01:56:09,444 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 10 16) no Hoare annotation was computed. [2023-02-18 01:56:09,444 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 10 16) the Hoare annotation is: true [2023-02-18 01:56:09,444 INFO L899 garLoopResultBuilder]: For program point L11-2(lines 10 16) no Hoare annotation was computed. [2023-02-18 01:56:09,444 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2023-02-18 01:56:09,448 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2023-02-18 01:56:09,449 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 01:56:09,460 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-18 01:56:09,464 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-18 01:56:09,464 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-18 01:56:09,464 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-18 01:56:09,480 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-18 01:56:09,483 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-18 01:56:09,483 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-18 01:56:09,484 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-18 01:56:09,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 01:56:09 BoogieIcfgContainer [2023-02-18 01:56:09,486 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 01:56:09,486 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 01:56:09,487 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 01:56:09,487 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 01:56:09,487 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:55:58" (3/4) ... [2023-02-18 01:56:09,489 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 01:56:09,493 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-02-18 01:56:09,493 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-18 01:56:09,496 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-02-18 01:56:09,496 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 01:56:09,496 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 01:56:09,496 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 01:56:09,523 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 01:56:09,523 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 01:56:09,523 INFO L158 Benchmark]: Toolchain (without parser) took 11702.48ms. Allocated memory was 155.2MB in the beginning and 197.1MB in the end (delta: 41.9MB). Free memory was 121.8MB in the beginning and 157.7MB in the end (delta: -35.9MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2023-02-18 01:56:09,524 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 155.2MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 01:56:09,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 141.07ms. Allocated memory is still 155.2MB. Free memory was 121.5MB in the beginning and 111.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 01:56:09,524 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.51ms. Allocated memory is still 155.2MB. Free memory was 111.0MB in the beginning and 109.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 01:56:09,524 INFO L158 Benchmark]: Boogie Preprocessor took 12.11ms. Allocated memory is still 155.2MB. Free memory was 109.2MB in the beginning and 108.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 01:56:09,524 INFO L158 Benchmark]: RCFGBuilder took 203.59ms. Allocated memory is still 155.2MB. Free memory was 108.1MB in the beginning and 97.3MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 01:56:09,525 INFO L158 Benchmark]: TraceAbstraction took 11286.82ms. Allocated memory was 155.2MB in the beginning and 197.1MB in the end (delta: 41.9MB). Free memory was 96.7MB in the beginning and 160.8MB in the end (delta: -64.2MB). Peak memory consumption was 88.8MB. Max. memory is 16.1GB. [2023-02-18 01:56:09,525 INFO L158 Benchmark]: Witness Printer took 36.49ms. Allocated memory is still 197.1MB. Free memory was 160.8MB in the beginning and 157.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 01:56:09,526 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 155.2MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 141.07ms. Allocated memory is still 155.2MB. Free memory was 121.5MB in the beginning and 111.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.51ms. Allocated memory is still 155.2MB. Free memory was 111.0MB in the beginning and 109.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 12.11ms. Allocated memory is still 155.2MB. Free memory was 109.2MB in the beginning and 108.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 203.59ms. Allocated memory is still 155.2MB. Free memory was 108.1MB in the beginning and 97.3MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11286.82ms. Allocated memory was 155.2MB in the beginning and 197.1MB in the end (delta: 41.9MB). Free memory was 96.7MB in the beginning and 160.8MB in the end (delta: -64.2MB). Peak memory consumption was 88.8MB. Max. memory is 16.1GB. * Witness Printer took 36.49ms. Allocated memory is still 197.1MB. Free memory was 160.8MB in the beginning and 157.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] * 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: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.2s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 256 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 200 mSDsluCounter, 1458 SdHoareTripleChecker+Invalid, 6.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1130 mSDsCounter, 155 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2136 IncrementalHoareTripleChecker+Invalid, 2293 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 155 mSolverCounterUnsat, 328 mSDtfsCounter, 2136 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 780 GetRequests, 639 SyntacticMatches, 5 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=9, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 54 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 75 PreInvPairs, 137 NumberOfFragments, 13642 HoareAnnotationTreeSize, 75 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 483 NumberOfCodeBlocks, 483 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 721 ConstructedInterpolants, 2 QuantifiedInterpolants, 3035 SizeOfPredicates, 56 NumberOfNonLiveVariables, 1263 ConjunctsInSsa, 230 ConjunctsInUnsatCore, 15 InterpolantComputations, 2 PerfectInterpolantSequences, 824/896 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: 18]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 35]: Loop Invariant [2023-02-18 01:56:09,539 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-18 01:56:09,539 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-18 01:56:09,539 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-18 01:56:09,539 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-18 01:56:09,541 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-18 01:56:09,541 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-18 01:56:09,542 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] [2023-02-18 01:56:09,542 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~r~0#1,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((p == 1 && y <= 5) && b == y) && y >= 1) && b + 1 <= a + b) && y >= 0) && r == 0) && p + q == 1) && q == 0) && (forall ULTIMATE.start_main_~r~0#1 : int :: -(q * ULTIMATE.start_main_~r~0#1) + p * s == 1)) && x >= 1) && a == x) && r * y + p * x == a) && s == 1) || ((-(q * r) + p * s == 1 && (((s * y + q * x == b && ((((y <= 5 && (r * y + p * x == a || !(-(q * r) + p * s == 1))) && y >= 1) && y >= 0) || ((((y <= 5 && (r * y + p * x == a || !(-(q * r) + p * s == 1))) && y >= 1) && y >= 0) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))))) && x >= 1) || (((((q == -1 + 0 && x * 1 + y * 0 == -1 * b + y) && ((((y <= 5 && (r * y + p * x == a || !(-(q * r) + p * s == 1))) && y >= 1) && y >= 0) || ((((y <= 5 && (r * y + p * x == a || !(-(q * r) + p * s == 1))) && y >= 1) && y >= 0) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))))) && x >= 1) && s + 0 == 1) && x == -1 * b + y))) && x >= 1)) || (((((-s + 0 == r && q + (p + q) == 0) && (((s * y + q * x == b && ((((y <= 5 && (r * y + p * x == a || !(-(q * r) + p * s == 1))) && y >= 1) && y >= 0) || ((((y <= 5 && (r * y + p * x == a || !(-(q * r) + p * s == 1))) && y >= 1) && y >= 0) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))))) && x >= 1) || (((((q == -1 + 0 && x * 1 + y * 0 == -1 * b + y) && ((((y <= 5 && (r * y + p * x == a || !(-(q * r) + p * s == 1))) && y >= 1) && y >= 0) || ((((y <= 5 && (r * y + p * x == a || !(-(q * r) + p * s == 1))) && y >= 1) && y >= 0) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))))) && x >= 1) && s + 0 == 1) && x == -1 * b + y))) && p + q == 1) && x >= 1) && s + 0 == 1)) || (((((((y <= 5 && y >= 1) && y >= 0) && r * y + p * x == a) || ((((((((y <= 5 && y >= 1) && y >= 0) && x == a + y) && -1 * p + 1 == 0) && -1 * r * p + -(r * (-1 * p + 1)) == 1) && -1 * r == 1) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && r * y + p * x == a)) && -(q * r) + p * s == 1) && (!(r * y + p * x == a) || s * y + q * x == b)) && x >= 1)) || ((((((((((y <= 5 && y >= 1) && y >= 0) && r * y + p * x == a) || ((((((((y <= 5 && y >= 1) && y >= 0) && x == a + y) && -1 * p + 1 == 0) && -1 * r * p + -(r * (-1 * p + 1)) == 1) && -1 * r == 1) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && r * y + p * x == a)) && -p + 0 == q) && -(q * r) + p * s == 1) && (!(r * y + p * x == a) || s * y + q * x == b)) && x >= 1) && p + 0 == 1) && r + s == 1)) || ((-(q * r) + p * s == 1 && x >= 1) && (((((((((((p == 1 && y <= 5) && y >= 1) && y >= 0) && r == 0) && a == x) && r * y + p * x == a) && s == 1) || ((((((((p == 1 && y <= 5) && y >= 1) && y >= 0) && r == 0) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && a == x) && r * y + p * x == a) && s == 1)) && s * y + q * x == b) && x >= 1) || ((((((((((p == 1 && y <= 5) && y >= 1) && y >= 0) && r == 0) && a == x) && r * y + p * x == a) && s == 1) || ((((((((p == 1 && y <= 5) && y >= 1) && y >= 0) && r == 0) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && a == x) && r * y + p * x == a) && s == 1)) && (!(r * y + p * x == a) || s * y + q * x == b)) && x >= 1)))) || (((((((-(q * r) + p * s == 1 && s * y + q * x == b) && b + 1 <= a + b) && p + q == 1) && q == 0) && x >= 1) && s == 1) && (((((((((y <= 5 && b == y) && y >= 1) && y >= 0) && q == 0) && (forall ULTIMATE.start_main_~r~0#1 : int :: -(q * ULTIMATE.start_main_~r~0#1) + p * s == 1)) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && r * y + p * x == a) && s == 1) || (((((((y <= 5 && (r * y + p * x == a || !(-(q * r) + p * s == 1))) && b == y) && y >= 1) && y >= 0) && q == 0) && (forall ULTIMATE.start_main_~r~0#1 : int :: -(q * ULTIMATE.start_main_~r~0#1) + p * s == 1)) && s == 1)))) || (((((((((((((((((((p == 1 && y <= 5) && y >= 1) && y >= 0) && r == 0) && a == x) && r * y + p * x == a) && s == 1) || ((((((((p == 1 && y <= 5) && y >= 1) && y >= 0) && r == 0) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && a == x) && r * y + p * x == a) && s == 1)) && a + 1 <= a + b) && a <= a + b) && p == 1) && y == a + b) && -p + 0 == q) && r == 0) && p + q == 0) && x >= 1) && a == x) && p + 0 == 1) && r + s == 1)) || ((((((((((((((-s + 0 == r && y <= 5) && b == y) && -(q * r) + p * s == 1) && s * y + q * x == b) && y >= 1) && b + 1 <= a + b) && y >= 0) && x == a + y) && p + q == 1) && q == 0) && (forall ULTIMATE.start_main_~r~0#1 : int :: -(q * ULTIMATE.start_main_~r~0#1) + p * s == 1)) && x >= 1) && (a + -b == x * (-q + p) + y * (r + -s) || !(-(q * (r + -s)) + s * (-q + p) == 1))) && s == 1) RESULT: Ultimate proved your program to be correct! [2023-02-18 01:56:09,553 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