./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/fermat2-ll_unwindbound20.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 c16561338eb70030ddc560fe6b7af6d1b48b7a566766a02092344cb5475a4c1a --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 04:47:40,412 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 04:47:40,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 04:47:40,437 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 04:47:40,437 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 04:47:40,438 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 04:47:40,439 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 04:47:40,441 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 04:47:40,444 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 04:47:40,445 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 04:47:40,446 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 04:47:40,449 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 04:47:40,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 04:47:40,454 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 04:47:40,456 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 04:47:40,458 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 04:47:40,459 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 04:47:40,461 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 04:47:40,465 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 04:47:40,469 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 04:47:40,473 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 04:47:40,488 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 04:47:40,488 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 04:47:40,489 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 04:47:40,489 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 04:47:40,491 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 04:47:40,491 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 04:47:40,492 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 04:47:40,492 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 04:47:40,492 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 04:47:40,493 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 04:47:40,493 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 04:47:40,494 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 04:47:40,494 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 04:47:40,495 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 04:47:40,495 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 04:47:40,495 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 04:47:40,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 04:47:40,496 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 04:47:40,496 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 04:47:40,496 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 04:47:40,497 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 04:47:40,498 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 04:47:40,522 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 04:47:40,533 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 04:47:40,533 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 04:47:40,533 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 04:47:40,534 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 04:47:40,534 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 04:47:40,535 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 04:47:40,535 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 04:47:40,536 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 04:47:40,537 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 04:47:40,537 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 04:47:40,537 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 04:47:40,537 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 04:47:40,537 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 04:47:40,537 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 04:47:40,538 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 04:47:40,538 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 04:47:40,538 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 04:47:40,538 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 04:47:40,538 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 04:47:40,539 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 04:47:40,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 04:47:40,539 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 04:47:40,540 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 04:47:40,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 04:47:40,540 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 04:47:40,540 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 04:47:40,540 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 04:47:40,541 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 04:47:40,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 04:47:40,541 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 04:47:40,541 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 04:47:40,541 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 04:47:40,542 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> c16561338eb70030ddc560fe6b7af6d1b48b7a566766a02092344cb5475a4c1a [2022-07-12 04:47:40,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 04:47:40,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 04:47:40,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 04:47:40,825 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 04:47:40,826 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 04:47:40,827 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c [2022-07-12 04:47:40,897 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f21ddd2e9/a084dc036a654323b3f362aadfd4d02c/FLAGc7846ee9d [2022-07-12 04:47:41,254 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 04:47:41,255 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c [2022-07-12 04:47:41,260 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f21ddd2e9/a084dc036a654323b3f362aadfd4d02c/FLAGc7846ee9d [2022-07-12 04:47:41,696 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f21ddd2e9/a084dc036a654323b3f362aadfd4d02c [2022-07-12 04:47:41,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 04:47:41,699 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 04:47:41,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 04:47:41,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 04:47:41,707 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 04:47:41,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:47:41" (1/1) ... [2022-07-12 04:47:41,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a119b91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:47:41, skipping insertion in model container [2022-07-12 04:47:41,709 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:47:41" (1/1) ... [2022-07-12 04:47:41,713 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 04:47:41,725 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 04:47:41,846 WARN L230 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/fermat2-ll_unwindbound20.c[524,537] [2022-07-12 04:47:41,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 04:47:41,863 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 04:47:41,870 WARN L230 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/fermat2-ll_unwindbound20.c[524,537] [2022-07-12 04:47:41,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 04:47:41,883 INFO L208 MainTranslator]: Completed translation [2022-07-12 04:47:41,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:47:41 WrapperNode [2022-07-12 04:47:41,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 04:47:41,884 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 04:47:41,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 04:47:41,885 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 04:47:41,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:47:41" (1/1) ... [2022-07-12 04:47:41,894 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:47:41" (1/1) ... [2022-07-12 04:47:41,904 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2022-07-12 04:47:41,905 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 04:47:41,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 04:47:41,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 04:47:41,907 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 04:47:41,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:47:41" (1/1) ... [2022-07-12 04:47:41,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:47:41" (1/1) ... [2022-07-12 04:47:41,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:47:41" (1/1) ... [2022-07-12 04:47:41,913 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:47:41" (1/1) ... [2022-07-12 04:47:41,915 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:47:41" (1/1) ... [2022-07-12 04:47:41,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:47:41" (1/1) ... [2022-07-12 04:47:41,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:47:41" (1/1) ... [2022-07-12 04:47:41,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 04:47:41,920 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 04:47:41,920 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 04:47:41,920 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 04:47:41,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:47:41" (1/1) ... [2022-07-12 04:47:41,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 04:47:41,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:47:41,946 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) [2022-07-12 04:47:41,947 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 [2022-07-12 04:47:41,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 04:47:41,987 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 04:47:41,987 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 04:47:41,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 04:47:41,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 04:47:41,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 04:47:41,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 04:47:41,988 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 04:47:42,024 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 04:47:42,026 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 04:47:42,122 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 04:47:42,126 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 04:47:42,127 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 04:47:42,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:47:42 BoogieIcfgContainer [2022-07-12 04:47:42,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 04:47:42,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 04:47:42,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 04:47:42,143 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 04:47:42,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 04:47:41" (1/3) ... [2022-07-12 04:47:42,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b706c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:47:42, skipping insertion in model container [2022-07-12 04:47:42,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:47:41" (2/3) ... [2022-07-12 04:47:42,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b706c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:47:42, skipping insertion in model container [2022-07-12 04:47:42,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:47:42" (3/3) ... [2022-07-12 04:47:42,145 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound20.c [2022-07-12 04:47:42,154 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 04:47:42,154 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 04:47:42,196 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 04:47:42,201 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7814b51e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@536f9606 [2022-07-12 04:47:42,201 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 04:47:42,204 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 04:47:42,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 04:47:42,209 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:47:42,209 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:47:42,209 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:47:42,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:47:42,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1086166160, now seen corresponding path program 1 times [2022-07-12 04:47:42,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:47:42,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516660046] [2022-07-12 04:47:42,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:47:42,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:47:42,305 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 04:47:42,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2078868310] [2022-07-12 04:47:42,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:47:42,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:47:42,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:47:42,309 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) [2022-07-12 04:47:42,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 04:47:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:47:42,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 04:47:42,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:47:42,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 04:47:42,415 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 04:47:42,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:47:42,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516660046] [2022-07-12 04:47:42,416 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 04:47:42,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078868310] [2022-07-12 04:47:42,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078868310] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 04:47:42,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 04:47:42,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 04:47:42,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929910935] [2022-07-12 04:47:42,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 04:47:42,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 04:47:42,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:47:42,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 04:47:42,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 04:47:42,439 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 04:47:42,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:47:42,463 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-07-12 04:47:42,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 04:47:42,481 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-07-12 04:47:42,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:47:42,485 INFO L225 Difference]: With dead ends: 47 [2022-07-12 04:47:42,485 INFO L226 Difference]: Without dead ends: 21 [2022-07-12 04:47:42,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 04:47:42,490 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 04:47:42,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 04:47:42,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-12 04:47:42,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-12 04:47:42,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 04:47:42,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-07-12 04:47:42,518 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2022-07-12 04:47:42,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:47:42,518 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-07-12 04:47:42,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 04:47:42,519 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-07-12 04:47:42,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 04:47:42,520 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:47:42,520 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:47:42,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 04:47:42,722 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 [2022-07-12 04:47:42,723 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:47:42,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:47:42,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1345709874, now seen corresponding path program 1 times [2022-07-12 04:47:42,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:47:42,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894336301] [2022-07-12 04:47:42,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:47:42,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:47:42,735 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 04:47:42,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1118099860] [2022-07-12 04:47:42,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:47:42,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:47:42,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:47:42,741 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) [2022-07-12 04:47:42,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 04:47:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:47:42,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 04:47:42,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:47:42,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 04:47:42,846 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 04:47:42,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:47:42,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894336301] [2022-07-12 04:47:42,847 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 04:47:42,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118099860] [2022-07-12 04:47:42,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118099860] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 04:47:42,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 04:47:42,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 04:47:42,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716281222] [2022-07-12 04:47:42,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 04:47:42,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 04:47:42,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:47:42,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 04:47:42,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 04:47:42,856 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 04:47:42,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:47:42,869 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-07-12 04:47:42,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 04:47:42,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-07-12 04:47:42,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:47:42,871 INFO L225 Difference]: With dead ends: 30 [2022-07-12 04:47:42,871 INFO L226 Difference]: Without dead ends: 23 [2022-07-12 04:47:42,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 04:47:42,872 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 04:47:42,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 04:47:42,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-12 04:47:42,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-12 04:47:42,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 04:47:42,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-12 04:47:42,879 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 19 [2022-07-12 04:47:42,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:47:42,881 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-12 04:47:42,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 04:47:42,882 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-12 04:47:42,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 04:47:42,883 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:47:42,883 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:47:42,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-12 04:47:43,087 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 [2022-07-12 04:47:43,088 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:47:43,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:47:43,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1347497334, now seen corresponding path program 1 times [2022-07-12 04:47:43,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:47:43,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677259846] [2022-07-12 04:47:43,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:47:43,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:47:43,100 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 04:47:43,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [847494050] [2022-07-12 04:47:43,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:47:43,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:47:43,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:47:43,106 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) [2022-07-12 04:47:43,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 04:47:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:47:43,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 04:47:43,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:47:43,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 04:47:43,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 04:47:43,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:47:43,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677259846] [2022-07-12 04:47:43,393 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 04:47:43,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847494050] [2022-07-12 04:47:43,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847494050] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 04:47:43,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 04:47:43,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 04:47:43,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401282743] [2022-07-12 04:47:43,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 04:47:43,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 04:47:43,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:47:43,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 04:47:43,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 04:47:43,395 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 04:47:46,016 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-12 04:47:48,143 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-12 04:47:48,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:47:48,152 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-07-12 04:47:48,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 04:47:48,153 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-07-12 04:47:48,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:47:48,154 INFO L225 Difference]: With dead ends: 33 [2022-07-12 04:47:48,154 INFO L226 Difference]: Without dead ends: 31 [2022-07-12 04:47:48,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 04:47:48,156 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-12 04:47:48,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 66 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 2 Unknown, 0 Unchecked, 4.7s Time] [2022-07-12 04:47:48,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-12 04:47:48,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-07-12 04:47:48,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 04:47:48,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-12 04:47:48,161 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2022-07-12 04:47:48,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:47:48,161 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-12 04:47:48,161 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 04:47:48,161 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-12 04:47:48,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 04:47:48,162 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:47:48,162 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:47:48,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 04:47:48,375 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 [2022-07-12 04:47:48,375 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:47:48,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:47:48,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1636478750, now seen corresponding path program 1 times [2022-07-12 04:47:48,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:47:48,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591005338] [2022-07-12 04:47:48,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:47:48,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:47:48,385 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 04:47:48,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1143663293] [2022-07-12 04:47:48,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:47:48,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:47:48,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:47:48,387 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) [2022-07-12 04:47:48,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 04:47:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:47:48,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 04:47:48,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:47:48,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 04:47:48,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:47:48,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 04:47:48,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:47:48,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591005338] [2022-07-12 04:47:48,642 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 04:47:48,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143663293] [2022-07-12 04:47:48,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143663293] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:47:48,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 04:47:48,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-07-12 04:47:48,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17943791] [2022-07-12 04:47:48,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 04:47:48,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 04:47:48,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:47:48,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 04:47:48,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-12 04:47:48,647 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 04:47:48,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:47:48,765 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-07-12 04:47:48,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 04:47:48,767 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 25 [2022-07-12 04:47:48,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:47:48,768 INFO L225 Difference]: With dead ends: 35 [2022-07-12 04:47:48,768 INFO L226 Difference]: Without dead ends: 30 [2022-07-12 04:47:48,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-07-12 04:47:48,769 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 04:47:48,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 66 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 04:47:48,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-12 04:47:48,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2022-07-12 04:47:48,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 04:47:48,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-07-12 04:47:48,778 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 25 [2022-07-12 04:47:48,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:47:48,778 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-07-12 04:47:48,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 04:47:48,779 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-07-12 04:47:48,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 04:47:48,780 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:47:48,780 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:47:48,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 04:47:48,989 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 [2022-07-12 04:47:48,989 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:47:48,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:47:48,990 INFO L85 PathProgramCache]: Analyzing trace with hash -126969667, now seen corresponding path program 1 times [2022-07-12 04:47:48,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:47:48,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630571129] [2022-07-12 04:47:48,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:47:48,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:47:48,996 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 04:47:48,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1123873344] [2022-07-12 04:47:48,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:47:48,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:47:48,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:47:49,000 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) [2022-07-12 04:47:49,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 04:47:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:47:49,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 04:47:49,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:47:49,072 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 04:47:49,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:47:49,121 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 04:47:49,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:47:49,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630571129] [2022-07-12 04:47:49,122 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 04:47:49,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123873344] [2022-07-12 04:47:49,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123873344] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:47:49,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 04:47:49,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-07-12 04:47:49,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234738812] [2022-07-12 04:47:49,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 04:47:49,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 04:47:49,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:47:49,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 04:47:49,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-12 04:47:49,124 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 04:47:49,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:47:49,180 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-07-12 04:47:49,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 04:47:49,181 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2022-07-12 04:47:49,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:47:49,184 INFO L225 Difference]: With dead ends: 57 [2022-07-12 04:47:49,184 INFO L226 Difference]: Without dead ends: 52 [2022-07-12 04:47:49,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-12 04:47:49,188 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 41 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 04:47:49,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 101 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 04:47:49,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-12 04:47:49,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-07-12 04:47:49,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 04:47:49,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-07-12 04:47:49,206 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 28 [2022-07-12 04:47:49,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:47:49,206 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-07-12 04:47:49,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 04:47:49,206 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-07-12 04:47:49,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 04:47:49,209 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:47:49,209 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:47:49,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 04:47:49,423 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 [2022-07-12 04:47:49,423 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:47:49,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:47:49,424 INFO L85 PathProgramCache]: Analyzing trace with hash 972990450, now seen corresponding path program 2 times [2022-07-12 04:47:49,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:47:49,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760449902] [2022-07-12 04:47:49,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:47:49,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:47:49,431 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 04:47:49,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [303804481] [2022-07-12 04:47:49,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 04:47:49,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:47:49,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:47:49,433 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) [2022-07-12 04:47:49,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 04:47:49,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 04:47:49,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 04:47:49,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 04:47:49,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:47:49,587 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 04:47:49,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:47:49,680 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-12 04:47:49,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:47:49,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760449902] [2022-07-12 04:47:49,681 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 04:47:49,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303804481] [2022-07-12 04:47:49,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303804481] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:47:49,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 04:47:49,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-07-12 04:47:49,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705184474] [2022-07-12 04:47:49,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 04:47:49,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 04:47:49,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:47:49,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 04:47:49,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-07-12 04:47:49,684 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-07-12 04:47:49,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:47:49,820 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2022-07-12 04:47:49,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 04:47:49,821 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 55 [2022-07-12 04:47:49,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:47:49,822 INFO L225 Difference]: With dead ends: 111 [2022-07-12 04:47:49,822 INFO L226 Difference]: Without dead ends: 106 [2022-07-12 04:47:49,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-07-12 04:47:49,823 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 98 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 04:47:49,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 131 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 04:47:49,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-12 04:47:49,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-07-12 04:47:49,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.1358024691358024) internal successors, (92), 81 states have internal predecessors, (92), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-12 04:47:49,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2022-07-12 04:47:49,834 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 55 [2022-07-12 04:47:49,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:47:49,835 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2022-07-12 04:47:49,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-07-12 04:47:49,835 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2022-07-12 04:47:49,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-12 04:47:49,836 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:47:49,836 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:47:49,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 04:47:50,045 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 [2022-07-12 04:47:50,045 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:47:50,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:47:50,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1909967598, now seen corresponding path program 3 times [2022-07-12 04:47:50,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:47:50,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942547128] [2022-07-12 04:47:50,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:47:50,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:47:50,054 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 04:47:50,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1894572167] [2022-07-12 04:47:50,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 04:47:50,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:47:50,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:47:50,056 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) [2022-07-12 04:47:50,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 04:47:53,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-12 04:47:53,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 04:47:53,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 04:47:53,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:47:53,585 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 04:47:53,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:47:53,802 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-07-12 04:47:53,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:47:53,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942547128] [2022-07-12 04:47:53,803 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 04:47:53,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894572167] [2022-07-12 04:47:53,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894572167] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:47:53,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 04:47:53,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2022-07-12 04:47:53,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845649612] [2022-07-12 04:47:53,803 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 04:47:53,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 04:47:53,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:47:53,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 04:47:53,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-07-12 04:47:53,806 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand has 24 states, 24 states have (on average 5.333333333333333) internal successors, (128), 24 states have internal predecessors, (128), 21 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2022-07-12 04:47:54,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:47:54,141 INFO L93 Difference]: Finished difference Result 201 states and 231 transitions. [2022-07-12 04:47:54,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-12 04:47:54,142 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.333333333333333) internal successors, (128), 24 states have internal predecessors, (128), 21 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) Word has length 109 [2022-07-12 04:47:54,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:47:54,144 INFO L225 Difference]: With dead ends: 201 [2022-07-12 04:47:54,144 INFO L226 Difference]: Without dead ends: 196 [2022-07-12 04:47:54,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2022-07-12 04:47:54,146 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 187 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 04:47:54,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 216 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 04:47:54,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-12 04:47:54,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-07-12 04:47:54,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 151 states have (on average 1.1390728476821192) internal successors, (172), 151 states have internal predecessors, (172), 23 states have call successors, (23), 22 states have call predecessors, (23), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-07-12 04:47:54,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 217 transitions. [2022-07-12 04:47:54,165 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 217 transitions. Word has length 109 [2022-07-12 04:47:54,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:47:54,165 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 217 transitions. [2022-07-12 04:47:54,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.333333333333333) internal successors, (128), 24 states have internal predecessors, (128), 21 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2022-07-12 04:47:54,166 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 217 transitions. [2022-07-12 04:47:54,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-07-12 04:47:54,167 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:47:54,167 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:47:54,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 04:47:54,374 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 [2022-07-12 04:47:54,376 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:47:54,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:47:54,377 INFO L85 PathProgramCache]: Analyzing trace with hash 32762610, now seen corresponding path program 4 times [2022-07-12 04:47:54,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:47:54,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046197994] [2022-07-12 04:47:54,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:47:54,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:47:54,387 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 04:47:54,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [424382466] [2022-07-12 04:47:54,387 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 04:47:54,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:47:54,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:47:54,389 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) [2022-07-12 04:47:54,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 04:47:54,483 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 04:47:54,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-12 04:47:54,483 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 04:47:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 04:47:54,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 04:47:54,963 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 04:47:54,964 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 04:47:54,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 04:47:55,170 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 [2022-07-12 04:47:55,174 INFO L356 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2022-07-12 04:47:55,178 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 04:47:55,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 04:47:55 BoogieIcfgContainer [2022-07-12 04:47:55,279 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 04:47:55,279 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 04:47:55,279 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 04:47:55,280 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 04:47:55,280 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:47:42" (3/4) ... [2022-07-12 04:47:55,281 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 04:47:55,363 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 04:47:55,363 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 04:47:55,363 INFO L158 Benchmark]: Toolchain (without parser) took 13664.83ms. Allocated memory was 96.5MB in the beginning and 125.8MB in the end (delta: 29.4MB). Free memory was 63.5MB in the beginning and 67.7MB in the end (delta: -4.3MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2022-07-12 04:47:55,364 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory is still 50.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 04:47:55,364 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.89ms. Allocated memory is still 96.5MB. Free memory was 63.3MB in the beginning and 71.9MB in the end (delta: -8.6MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2022-07-12 04:47:55,364 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.54ms. Allocated memory is still 96.5MB. Free memory was 71.8MB in the beginning and 70.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 04:47:55,364 INFO L158 Benchmark]: Boogie Preprocessor took 12.56ms. Allocated memory is still 96.5MB. Free memory was 70.2MB in the beginning and 69.3MB in the end (delta: 926.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 04:47:55,365 INFO L158 Benchmark]: RCFGBuilder took 208.78ms. Allocated memory is still 96.5MB. Free memory was 69.3MB in the beginning and 59.8MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 04:47:55,365 INFO L158 Benchmark]: TraceAbstraction took 13149.30ms. Allocated memory was 96.5MB in the beginning and 125.8MB in the end (delta: 29.4MB). Free memory was 59.2MB in the beginning and 75.1MB in the end (delta: -15.9MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2022-07-12 04:47:55,365 INFO L158 Benchmark]: Witness Printer took 83.90ms. Allocated memory is still 125.8MB. Free memory was 75.1MB in the beginning and 67.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 04:47:55,366 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.19ms. Allocated memory is still 96.5MB. Free memory is still 50.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.89ms. Allocated memory is still 96.5MB. Free memory was 63.3MB in the beginning and 71.9MB in the end (delta: -8.6MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.54ms. Allocated memory is still 96.5MB. Free memory was 71.8MB in the beginning and 70.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 12.56ms. Allocated memory is still 96.5MB. Free memory was 70.2MB in the beginning and 69.3MB in the end (delta: 926.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 208.78ms. Allocated memory is still 96.5MB. Free memory was 69.3MB in the beginning and 59.8MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13149.30ms. Allocated memory was 96.5MB in the beginning and 125.8MB in the end (delta: 29.4MB). Free memory was 59.2MB in the beginning and 75.1MB in the end (delta: -15.9MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * Witness Printer took 83.90ms. Allocated memory is still 125.8MB. Free memory was 75.1MB in the beginning and 67.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [counter=0] [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L26] CALL assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L26] RET assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [A=40805, counter=0, R=203] [L28] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L28] RET assume_abort_if_not(A % 2 == 1) VAL [A=40805, counter=0, R=203] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [A=40805, counter=0, R=203, r=404, u=407, v=1] [L34] EXPR counter++ VAL [A=40805, counter=1, counter++=0, r=404, R=203, u=407, v=1] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=1, r=404, R=203, u=407, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=1, R=203, r=404, u=407, v=1] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=1, r=403, R=203, u=407, v=3] [L34] EXPR counter++ VAL [A=40805, counter=2, counter++=1, R=203, r=403, u=407, v=3] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=2, r=403, R=203, u=407, v=3] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=2, r=403, R=203, u=407, v=3] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=2, R=203, r=400, u=407, v=5] [L34] EXPR counter++ VAL [A=40805, counter=3, counter++=2, R=203, r=400, u=407, v=5] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=3, R=203, r=400, u=407, v=5] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=3, r=400, R=203, u=407, v=5] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=3, r=395, R=203, u=407, v=7] [L34] EXPR counter++ VAL [A=40805, counter=4, counter++=3, R=203, r=395, u=407, v=7] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=4, R=203, r=395, u=407, v=7] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=4, r=395, R=203, u=407, v=7] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=4, R=203, r=388, u=407, v=9] [L34] EXPR counter++ VAL [A=40805, counter=5, counter++=4, R=203, r=388, u=407, v=9] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=5, R=203, r=388, u=407, v=9] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=5, r=388, R=203, u=407, v=9] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=5, r=379, R=203, u=407, v=11] [L34] EXPR counter++ VAL [A=40805, counter=6, counter++=5, r=379, R=203, u=407, v=11] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=6, R=203, r=379, u=407, v=11] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=6, R=203, r=379, u=407, v=11] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=6, R=203, r=368, u=407, v=13] [L34] EXPR counter++ VAL [A=40805, counter=7, counter++=6, r=368, R=203, u=407, v=13] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=7, R=203, r=368, u=407, v=13] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=7, r=368, R=203, u=407, v=13] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=7, R=203, r=355, u=407, v=15] [L34] EXPR counter++ VAL [A=40805, counter=8, counter++=7, r=355, R=203, u=407, v=15] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=8, R=203, r=355, u=407, v=15] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=8, r=355, R=203, u=407, v=15] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=8, R=203, r=340, u=407, v=17] [L34] EXPR counter++ VAL [A=40805, counter=9, counter++=8, r=340, R=203, u=407, v=17] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=9, R=203, r=340, u=407, v=17] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=9, R=203, r=340, u=407, v=17] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=9, r=323, R=203, u=407, v=19] [L34] EXPR counter++ VAL [A=40805, counter=10, counter++=9, r=323, R=203, u=407, v=19] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=10, r=323, R=203, u=407, v=19] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=10, R=203, r=323, u=407, v=19] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=10, R=203, r=304, u=407, v=21] [L34] EXPR counter++ VAL [A=40805, counter=11, counter++=10, r=304, R=203, u=407, v=21] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=11] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=11, r=304, R=203, u=407, v=21] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=11, R=203, r=304, u=407, v=21] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=11, r=283, R=203, u=407, v=23] [L34] EXPR counter++ VAL [A=40805, counter=12, counter++=11, R=203, r=283, u=407, v=23] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=12] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=12, R=203, r=283, u=407, v=23] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=12, r=283, R=203, u=407, v=23] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=12, r=260, R=203, u=407, v=25] [L34] EXPR counter++ VAL [A=40805, counter=13, counter++=12, R=203, r=260, u=407, v=25] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=13] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=13, R=203, r=260, u=407, v=25] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=13, R=203, r=260, u=407, v=25] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=13, r=235, R=203, u=407, v=27] [L34] EXPR counter++ VAL [A=40805, counter=14, counter++=13, r=235, R=203, u=407, v=27] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=14] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=14, R=203, r=235, u=407, v=27] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=14, R=203, r=235, u=407, v=27] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=14, r=208, R=203, u=407, v=29] [L34] EXPR counter++ VAL [A=40805, counter=15, counter++=14, r=208, R=203, u=407, v=29] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=15] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=15, r=208, R=203, u=407, v=29] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=15, R=203, r=208, u=407, v=29] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=15, R=203, r=179, u=407, v=31] [L34] EXPR counter++ VAL [A=40805, counter=16, counter++=15, R=203, r=179, u=407, v=31] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=16] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=16, R=203, r=179, u=407, v=31] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=16, R=203, r=179, u=407, v=31] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=16, R=203, r=148, u=407, v=33] [L34] EXPR counter++ VAL [A=40805, counter=17, counter++=16, r=148, R=203, u=407, v=33] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=17] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=17, R=203, r=148, u=407, v=33] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=17, R=203, r=148, u=407, v=33] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=17, R=203, r=115, u=407, v=35] [L34] EXPR counter++ VAL [A=40805, counter=18, counter++=17, R=203, r=115, u=407, v=35] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=18] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=18, r=115, R=203, u=407, v=35] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=18, r=115, R=203, u=407, v=35] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=18, r=80, R=203, u=407, v=37] [L34] EXPR counter++ VAL [A=40805, counter=19, counter++=18, R=203, r=80, u=407, v=37] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=19] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=19, r=80, R=203, u=407, v=37] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=19, R=203, r=80, u=407, v=37] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=19, R=203, r=43, u=407, v=39] [L34] EXPR counter++ VAL [A=40805, counter=20, counter++=19, R=203, r=43, u=407, v=39] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=20] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40805, counter=20, r=43, R=203, u=407, v=39] [L36] COND FALSE !(!(r != 0)) VAL [A=40805, counter=20, R=203, r=43, u=407, v=39] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40805, counter=20, r=4, R=203, u=407, v=41] [L34] EXPR counter++ VAL [A=40805, counter=21, counter++=20, r=4, R=203, u=407, v=41] [L34] COND FALSE !(counter++<20) [L48] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, counter=21] [L12] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=21] [L14] reach_error() VAL [\old(cond)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.0s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 362 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 361 mSDsluCounter, 666 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 481 mSDsCounter, 119 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 281 IncrementalHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 119 mSolverCounterUnsat, 185 mSDtfsCounter, 281 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 514 GetRequests, 424 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=7, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 479 ConstructedInterpolants, 0 QuantifiedInterpolants, 1237 SizeOfPredicates, 24 NumberOfNonLiveVariables, 790 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 310/1086 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 RESULT: Ultimate proved your program to be incorrect! [2022-07-12 04:47:55,397 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE