./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e8d55036 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/cohencu-ll_unwindbound10.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 8d4ed8c57ce722a6c7368f844e0bd557207245c570ed48ded2021df85adb4676 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 20:25:35,182 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 20:25:35,184 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 20:25:35,205 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 20:25:35,207 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 20:25:35,209 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 20:25:35,210 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 20:25:35,212 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 20:25:35,214 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 20:25:35,217 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 20:25:35,218 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 20:25:35,220 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 20:25:35,220 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 20:25:35,222 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 20:25:35,223 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 20:25:35,224 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 20:25:35,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 20:25:35,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 20:25:35,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 20:25:35,231 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 20:25:35,231 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 20:25:35,232 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 20:25:35,233 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 20:25:35,233 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 20:25:35,239 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 20:25:35,240 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 20:25:35,240 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 20:25:35,241 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 20:25:35,241 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 20:25:35,242 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 20:25:35,243 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 20:25:35,243 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 20:25:35,244 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 20:25:35,246 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 20:25:35,246 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 20:25:35,246 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 20:25:35,247 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 20:25:35,247 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 20:25:35,247 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 20:25:35,248 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 20:25:35,248 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 20:25:35,249 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 20:25:35,273 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 20:25:35,273 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 20:25:35,273 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 20:25:35,273 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 20:25:35,274 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 20:25:35,274 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 20:25:35,274 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 20:25:35,275 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 20:25:35,275 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 20:25:35,275 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 20:25:35,276 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 20:25:35,276 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 20:25:35,276 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 20:25:35,276 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 20:25:35,276 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 20:25:35,276 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 20:25:35,277 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 20:25:35,277 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 20:25:35,277 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 20:25:35,277 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 20:25:35,277 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 20:25:35,277 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 20:25:35,277 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 20:25:35,278 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 20:25:35,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 20:25:35,278 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 20:25:35,278 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 20:25:35,278 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 20:25:35,278 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 20:25:35,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 20:25:35,279 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 20:25:35,279 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 20:25:35,279 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 20:25:35,279 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 20:25:35,279 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 20:25:35,280 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8d4ed8c57ce722a6c7368f844e0bd557207245c570ed48ded2021df85adb4676 [2023-02-15 20:25:35,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 20:25:35,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 20:25:35,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 20:25:35,491 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 20:25:35,491 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 20:25:35,492 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound10.c [2023-02-15 20:25:36,541 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 20:25:36,672 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 20:25:36,673 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound10.c [2023-02-15 20:25:36,677 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/088c0691b/8592095444104aeab3b6364c6a452680/FLAGe933097d1 [2023-02-15 20:25:36,686 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/088c0691b/8592095444104aeab3b6364c6a452680 [2023-02-15 20:25:36,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 20:25:36,689 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 20:25:36,690 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 20:25:36,690 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 20:25:36,692 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 20:25:36,692 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 08:25:36" (1/1) ... [2023-02-15 20:25:36,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@358d7091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:25:36, skipping insertion in model container [2023-02-15 20:25:36,693 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 08:25:36" (1/1) ... [2023-02-15 20:25:36,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 20:25:36,707 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 20:25:36,814 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound10.c[588,601] [2023-02-15 20:25:36,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 20:25:36,854 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 20:25:36,863 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound10.c[588,601] [2023-02-15 20:25:36,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 20:25:36,885 INFO L208 MainTranslator]: Completed translation [2023-02-15 20:25:36,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:25:36 WrapperNode [2023-02-15 20:25:36,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 20:25:36,887 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 20:25:36,887 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 20:25:36,887 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 20:25:36,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:25:36" (1/1) ... [2023-02-15 20:25:36,900 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:25:36" (1/1) ... [2023-02-15 20:25:36,912 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2023-02-15 20:25:36,912 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 20:25:36,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 20:25:36,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 20:25:36,913 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 20:25:36,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:25:36" (1/1) ... [2023-02-15 20:25:36,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:25:36" (1/1) ... [2023-02-15 20:25:36,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:25:36" (1/1) ... [2023-02-15 20:25:36,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:25:36" (1/1) ... [2023-02-15 20:25:36,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:25:36" (1/1) ... [2023-02-15 20:25:36,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:25:36" (1/1) ... [2023-02-15 20:25:36,933 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:25:36" (1/1) ... [2023-02-15 20:25:36,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:25:36" (1/1) ... [2023-02-15 20:25:36,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 20:25:36,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 20:25:36,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 20:25:36,935 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 20:25:36,936 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:25:36" (1/1) ... [2023-02-15 20:25:36,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 20:25:36,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:25:36,963 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 20:25:36,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 20:25:36,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 20:25:36,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 20:25:36,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 20:25:36,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 20:25:36,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-15 20:25:36,994 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-15 20:25:37,036 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 20:25:37,037 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 20:25:37,191 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 20:25:37,205 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 20:25:37,205 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 20:25:37,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 08:25:37 BoogieIcfgContainer [2023-02-15 20:25:37,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 20:25:37,209 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 20:25:37,209 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 20:25:37,211 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 20:25:37,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 08:25:36" (1/3) ... [2023-02-15 20:25:37,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a53403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 08:25:37, skipping insertion in model container [2023-02-15 20:25:37,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:25:36" (2/3) ... [2023-02-15 20:25:37,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a53403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 08:25:37, skipping insertion in model container [2023-02-15 20:25:37,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 08:25:37" (3/3) ... [2023-02-15 20:25:37,214 INFO L112 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound10.c [2023-02-15 20:25:37,226 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 20:25:37,226 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 20:25:37,261 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 20:25:37,266 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@411e7ff8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 20:25:37,266 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 20:25:37,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 20:25:37,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 20:25:37,272 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:25:37,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:25:37,274 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:25:37,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:25:37,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1823967074, now seen corresponding path program 1 times [2023-02-15 20:25:37,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:25:37,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237978624] [2023-02-15 20:25:37,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:37,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:25:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:25:37,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 20:25:37,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:25:37,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237978624] [2023-02-15 20:25:37,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237978624] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 20:25:37,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 20:25:37,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 20:25:37,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116157905] [2023-02-15 20:25:37,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 20:25:37,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 20:25:37,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:25:37,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 20:25:37,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 20:25:37,426 INFO L87 Difference]: Start difference. First operand has 26 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 20:25:37,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:25:37,447 INFO L93 Difference]: Finished difference Result 50 states and 87 transitions. [2023-02-15 20:25:37,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 20:25:37,449 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-15 20:25:37,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:25:37,453 INFO L225 Difference]: With dead ends: 50 [2023-02-15 20:25:37,453 INFO L226 Difference]: Without dead ends: 22 [2023-02-15 20:25:37,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 20:25:37,459 INFO L413 NwaCegarLoop]: 37 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, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 20:25:37,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 20:25:37,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-15 20:25:37,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-15 20:25:37,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-15 20:25:37,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2023-02-15 20:25:37,489 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 33 transitions. Word has length 7 [2023-02-15 20:25:37,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:25:37,490 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 33 transitions. [2023-02-15 20:25:37,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 20:25:37,490 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2023-02-15 20:25:37,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 20:25:37,492 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:25:37,492 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:25:37,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 20:25:37,493 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:25:37,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:25:37,494 INFO L85 PathProgramCache]: Analyzing trace with hash 178926099, now seen corresponding path program 1 times [2023-02-15 20:25:37,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:25:37,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124919631] [2023-02-15 20:25:37,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:37,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:25:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:25:37,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 20:25:37,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:25:37,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124919631] [2023-02-15 20:25:37,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124919631] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 20:25:37,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 20:25:37,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 20:25:37,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435970602] [2023-02-15 20:25:37,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 20:25:37,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 20:25:37,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:25:37,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 20:25:37,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 20:25:37,598 INFO L87 Difference]: Start difference. First operand 22 states and 33 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 20:25:37,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:25:37,632 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2023-02-15 20:25:37,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 20:25:37,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-15 20:25:37,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:25:37,641 INFO L225 Difference]: With dead ends: 36 [2023-02-15 20:25:37,641 INFO L226 Difference]: Without dead ends: 24 [2023-02-15 20:25:37,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 20:25:37,645 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 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 [2023-02-15 20:25:37,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 20:25:37,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-02-15 20:25:37,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-02-15 20:25:37,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-15 20:25:37,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2023-02-15 20:25:37,656 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 8 [2023-02-15 20:25:37,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:25:37,657 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2023-02-15 20:25:37,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 20:25:37,657 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2023-02-15 20:25:37,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 20:25:37,657 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:25:37,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:25:37,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 20:25:37,658 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:25:37,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:25:37,658 INFO L85 PathProgramCache]: Analyzing trace with hash 180475231, now seen corresponding path program 1 times [2023-02-15 20:25:37,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:25:37,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742224036] [2023-02-15 20:25:37,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:37,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:25:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:25:37,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 20:25:37,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:25:37,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742224036] [2023-02-15 20:25:37,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742224036] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 20:25:37,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 20:25:37,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 20:25:37,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340702753] [2023-02-15 20:25:37,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 20:25:37,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 20:25:37,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:25:37,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 20:25:37,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 20:25:37,802 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 20:25:37,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:25:37,878 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2023-02-15 20:25:37,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 20:25:37,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-15 20:25:37,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:25:37,880 INFO L225 Difference]: With dead ends: 30 [2023-02-15 20:25:37,880 INFO L226 Difference]: Without dead ends: 28 [2023-02-15 20:25:37,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 20:25:37,883 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 20:25:37,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 62 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 20:25:37,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-15 20:25:37,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-02-15 20:25:37,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-15 20:25:37,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2023-02-15 20:25:37,898 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 8 [2023-02-15 20:25:37,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:25:37,898 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2023-02-15 20:25:37,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 20:25:37,899 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2023-02-15 20:25:37,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 20:25:37,900 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:25:37,900 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:25:37,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 20:25:37,901 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:25:37,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:25:37,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1275442234, now seen corresponding path program 1 times [2023-02-15 20:25:37,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:25:37,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318871058] [2023-02-15 20:25:37,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:37,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:25:37,914 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:25:37,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1229172850] [2023-02-15 20:25:37,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:37,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:25:37,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:25:37,918 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 20:25:37,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 20:25:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:25:37,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 20:25:37,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:25:38,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 20:25:38,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 20:25:38,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 20:25:38,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:25:38,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318871058] [2023-02-15 20:25:38,210 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 20:25:38,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229172850] [2023-02-15 20:25:38,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229172850] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 20:25:38,212 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 20:25:38,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-15 20:25:38,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966965097] [2023-02-15 20:25:38,215 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 20:25:38,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 20:25:38,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:25:38,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 20:25:38,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-15 20:25:38,218 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 20:25:38,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:25:38,506 INFO L93 Difference]: Finished difference Result 54 states and 76 transitions. [2023-02-15 20:25:38,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 20:25:38,507 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2023-02-15 20:25:38,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:25:38,508 INFO L225 Difference]: With dead ends: 54 [2023-02-15 20:25:38,509 INFO L226 Difference]: Without dead ends: 52 [2023-02-15 20:25:38,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-15 20:25:38,510 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 20 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 20:25:38,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 71 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 20:25:38,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-15 20:25:38,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2023-02-15 20:25:38,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-15 20:25:38,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 66 transitions. [2023-02-15 20:25:38,521 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 66 transitions. Word has length 13 [2023-02-15 20:25:38,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:25:38,522 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 66 transitions. [2023-02-15 20:25:38,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 20:25:38,522 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions. [2023-02-15 20:25:38,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 20:25:38,523 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:25:38,523 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:25:38,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 20:25:38,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:25:38,734 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:25:38,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:25:38,735 INFO L85 PathProgramCache]: Analyzing trace with hash 427545983, now seen corresponding path program 1 times [2023-02-15 20:25:38,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:25:38,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981595896] [2023-02-15 20:25:38,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:38,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:25:38,743 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:25:38,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1398218266] [2023-02-15 20:25:38,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:38,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:25:38,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:25:38,744 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 20:25:38,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 20:25:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:25:38,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 20:25:38,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:25:38,823 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 20:25:38,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 20:25:38,893 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 20:25:38,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:25:38,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981595896] [2023-02-15 20:25:38,894 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 20:25:38,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398218266] [2023-02-15 20:25:38,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398218266] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 20:25:38,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 20:25:38,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-15 20:25:38,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804064529] [2023-02-15 20:25:38,895 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 20:25:38,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 20:25:38,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:25:38,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 20:25:38,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-15 20:25:38,896 INFO L87 Difference]: Start difference. First operand 47 states and 66 transitions. Second operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 20:25:39,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:25:39,089 INFO L93 Difference]: Finished difference Result 60 states and 83 transitions. [2023-02-15 20:25:39,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 20:25:39,090 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 18 [2023-02-15 20:25:39,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:25:39,091 INFO L225 Difference]: With dead ends: 60 [2023-02-15 20:25:39,091 INFO L226 Difference]: Without dead ends: 58 [2023-02-15 20:25:39,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-15 20:25:39,092 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 21 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 20:25:39,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 61 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 20:25:39,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-02-15 20:25:39,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2023-02-15 20:25:39,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 26 states have internal predecessors, (28), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-15 20:25:39,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2023-02-15 20:25:39,102 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 18 [2023-02-15 20:25:39,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:25:39,102 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2023-02-15 20:25:39,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 20:25:39,103 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2023-02-15 20:25:39,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 20:25:39,103 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:25:39,103 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:25:39,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 20:25:39,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:25:39,308 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:25:39,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:25:39,308 INFO L85 PathProgramCache]: Analyzing trace with hash 5607206, now seen corresponding path program 1 times [2023-02-15 20:25:39,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:25:39,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950898384] [2023-02-15 20:25:39,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:39,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:25:39,315 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:25:39,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1509472022] [2023-02-15 20:25:39,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:39,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:25:39,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:25:39,316 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 20:25:39,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 20:25:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:25:39,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 20:25:39,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:25:39,420 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-15 20:25:39,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 20:25:39,567 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-15 20:25:39,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:25:39,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950898384] [2023-02-15 20:25:39,567 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 20:25:39,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509472022] [2023-02-15 20:25:39,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509472022] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 20:25:39,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 20:25:39,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-15 20:25:39,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964255123] [2023-02-15 20:25:39,568 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 20:25:39,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 20:25:39,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:25:39,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 20:25:39,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-15 20:25:39,569 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 20:25:41,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:25:41,147 INFO L93 Difference]: Finished difference Result 74 states and 100 transitions. [2023-02-15 20:25:41,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 20:25:41,148 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) Word has length 23 [2023-02-15 20:25:41,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:25:41,149 INFO L225 Difference]: With dead ends: 74 [2023-02-15 20:25:41,149 INFO L226 Difference]: Without dead ends: 65 [2023-02-15 20:25:41,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-15 20:25:41,150 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 23 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-15 20:25:41,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 60 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-02-15 20:25:41,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-15 20:25:41,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-02-15 20:25:41,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2023-02-15 20:25:41,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2023-02-15 20:25:41,161 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 23 [2023-02-15 20:25:41,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:25:41,161 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2023-02-15 20:25:41,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 20:25:41,162 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2023-02-15 20:25:41,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 20:25:41,162 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:25:41,163 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:25:41,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 20:25:41,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:25:41,367 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:25:41,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:25:41,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1172224904, now seen corresponding path program 1 times [2023-02-15 20:25:41,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:25:41,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056822499] [2023-02-15 20:25:41,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:41,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:25:41,374 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:25:41,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [941344158] [2023-02-15 20:25:41,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:41,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:25:41,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:25:41,376 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 20:25:41,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 20:25:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:25:41,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 20:25:41,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:25:41,481 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-02-15 20:25:41,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 20:25:41,524 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-02-15 20:25:41,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:25:41,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056822499] [2023-02-15 20:25:41,525 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 20:25:41,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941344158] [2023-02-15 20:25:41,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941344158] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 20:25:41,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 20:25:41,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-02-15 20:25:41,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339516281] [2023-02-15 20:25:41,525 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 20:25:41,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 20:25:41,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:25:41,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 20:25:41,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-15 20:25:41,526 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-02-15 20:25:41,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:25:41,608 INFO L93 Difference]: Finished difference Result 140 states and 177 transitions. [2023-02-15 20:25:41,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 20:25:41,609 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 41 [2023-02-15 20:25:41,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:25:41,622 INFO L225 Difference]: With dead ends: 140 [2023-02-15 20:25:41,622 INFO L226 Difference]: Without dead ends: 119 [2023-02-15 20:25:41,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-02-15 20:25:41,623 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 53 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 20:25:41,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 165 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 20:25:41,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-15 20:25:41,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2023-02-15 20:25:41,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 59 states have (on average 1.11864406779661) internal successors, (66), 63 states have internal predecessors, (66), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2023-02-15 20:25:41,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 144 transitions. [2023-02-15 20:25:41,641 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 144 transitions. Word has length 41 [2023-02-15 20:25:41,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:25:41,642 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 144 transitions. [2023-02-15 20:25:41,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-02-15 20:25:41,642 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 144 transitions. [2023-02-15 20:25:41,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 20:25:41,643 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:25:41,643 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:25:41,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 20:25:41,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:25:41,847 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:25:41,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:25:41,848 INFO L85 PathProgramCache]: Analyzing trace with hash -399462631, now seen corresponding path program 1 times [2023-02-15 20:25:41,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:25:41,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523529886] [2023-02-15 20:25:41,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:41,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:25:41,855 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:25:41,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1458432681] [2023-02-15 20:25:41,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:41,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:25:41,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:25:41,856 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 20:25:41,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 20:25:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:25:41,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 20:25:41,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:25:41,991 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-15 20:25:41,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 20:25:42,096 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-15 20:25:42,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:25:42,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523529886] [2023-02-15 20:25:42,097 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 20:25:42,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458432681] [2023-02-15 20:25:42,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458432681] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 20:25:42,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 20:25:42,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-02-15 20:25:42,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940955404] [2023-02-15 20:25:42,097 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 20:25:42,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 20:25:42,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:25:42,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 20:25:42,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-15 20:25:42,100 INFO L87 Difference]: Start difference. First operand 115 states and 144 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-15 20:25:44,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-15 20:25:44,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:25:44,844 INFO L93 Difference]: Finished difference Result 129 states and 157 transitions. [2023-02-15 20:25:44,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 20:25:44,845 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) Word has length 46 [2023-02-15 20:25:44,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:25:44,846 INFO L225 Difference]: With dead ends: 129 [2023-02-15 20:25:44,846 INFO L226 Difference]: Without dead ends: 127 [2023-02-15 20:25:44,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-02-15 20:25:44,846 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 21 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 56 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-02-15 20:25:44,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 98 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 480 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2023-02-15 20:25:44,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-15 20:25:44,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2023-02-15 20:25:44,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 72 states have internal predecessors, (75), 41 states have call successors, (41), 17 states have call predecessors, (41), 17 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2023-02-15 20:25:44,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 153 transitions. [2023-02-15 20:25:44,866 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 153 transitions. Word has length 46 [2023-02-15 20:25:44,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:25:44,867 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 153 transitions. [2023-02-15 20:25:44,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-15 20:25:44,867 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 153 transitions. [2023-02-15 20:25:44,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 20:25:44,868 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:25:44,868 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-15 20:25:44,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 20:25:45,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:25:45,073 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:25:45,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:25:45,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1316290887, now seen corresponding path program 2 times [2023-02-15 20:25:45,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:25:45,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073203805] [2023-02-15 20:25:45,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:45,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:25:45,080 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:25:45,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1796172694] [2023-02-15 20:25:45,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 20:25:45,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:25:45,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:25:45,081 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 20:25:45,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 20:25:45,118 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 20:25:45,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 20:25:45,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 20:25:45,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:25:45,210 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 17 proven. 32 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-02-15 20:25:45,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 20:25:45,338 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 20 proven. 25 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-02-15 20:25:45,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:25:45,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073203805] [2023-02-15 20:25:45,338 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 20:25:45,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796172694] [2023-02-15 20:25:45,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796172694] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 20:25:45,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 20:25:45,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-15 20:25:45,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838721574] [2023-02-15 20:25:45,338 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 20:25:45,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 20:25:45,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:25:45,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 20:25:45,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-02-15 20:25:45,339 INFO L87 Difference]: Start difference. First operand 127 states and 153 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-02-15 20:25:45,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:25:45,914 INFO L93 Difference]: Finished difference Result 141 states and 166 transitions. [2023-02-15 20:25:45,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 20:25:45,915 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 56 [2023-02-15 20:25:45,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:25:45,916 INFO L225 Difference]: With dead ends: 141 [2023-02-15 20:25:45,916 INFO L226 Difference]: Without dead ends: 135 [2023-02-15 20:25:45,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-02-15 20:25:45,916 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 20:25:45,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 94 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 20:25:45,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-15 20:25:45,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2023-02-15 20:25:45,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 77 states have (on average 1.0909090909090908) internal successors, (84), 81 states have internal predecessors, (84), 37 states have call successors, (37), 20 states have call predecessors, (37), 20 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-02-15 20:25:45,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 154 transitions. [2023-02-15 20:25:45,935 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 154 transitions. Word has length 56 [2023-02-15 20:25:45,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:25:45,936 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 154 transitions. [2023-02-15 20:25:45,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-02-15 20:25:45,936 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 154 transitions. [2023-02-15 20:25:45,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-15 20:25:45,937 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:25:45,937 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:25:45,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-15 20:25:46,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:25:46,142 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:25:46,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:25:46,143 INFO L85 PathProgramCache]: Analyzing trace with hash 616227619, now seen corresponding path program 1 times [2023-02-15 20:25:46,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:25:46,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354961716] [2023-02-15 20:25:46,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:46,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:25:46,149 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:25:46,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1496562431] [2023-02-15 20:25:46,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:46,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:25:46,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:25:46,150 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 20:25:46,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 20:25:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:25:46,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-15 20:25:46,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:25:46,552 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 21 proven. 39 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-15 20:25:46,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 20:25:46,767 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-15 20:25:46,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:25:46,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354961716] [2023-02-15 20:25:46,767 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 20:25:46,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496562431] [2023-02-15 20:25:46,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496562431] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 20:25:46,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 20:25:46,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-02-15 20:25:46,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981987217] [2023-02-15 20:25:46,768 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 20:25:46,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 20:25:46,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:25:46,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 20:25:46,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-02-15 20:25:46,769 INFO L87 Difference]: Start difference. First operand 135 states and 154 transitions. Second operand has 14 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2023-02-15 20:25:47,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:25:47,254 INFO L93 Difference]: Finished difference Result 149 states and 167 transitions. [2023-02-15 20:25:47,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 20:25:47,254 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) Word has length 67 [2023-02-15 20:25:47,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:25:47,256 INFO L225 Difference]: With dead ends: 149 [2023-02-15 20:25:47,256 INFO L226 Difference]: Without dead ends: 145 [2023-02-15 20:25:47,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2023-02-15 20:25:47,257 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 20 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 20:25:47,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 84 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 20:25:47,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-15 20:25:47,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2023-02-15 20:25:47,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 85 states have (on average 1.0705882352941176) internal successors, (91), 88 states have internal predecessors, (91), 37 states have call successors, (37), 23 states have call predecessors, (37), 22 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-02-15 20:25:47,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 161 transitions. [2023-02-15 20:25:47,284 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 161 transitions. Word has length 67 [2023-02-15 20:25:47,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:25:47,284 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 161 transitions. [2023-02-15 20:25:47,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2023-02-15 20:25:47,285 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 161 transitions. [2023-02-15 20:25:47,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-15 20:25:47,285 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:25:47,286 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:25:47,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-15 20:25:47,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:25:47,493 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:25:47,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:25:47,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1808123650, now seen corresponding path program 1 times [2023-02-15 20:25:47,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:25:47,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319851942] [2023-02-15 20:25:47,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:47,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:25:47,500 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:25:47,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [606993691] [2023-02-15 20:25:47,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:47,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:25:47,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:25:47,502 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 20:25:47,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 20:25:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:25:47,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 20:25:47,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:25:47,889 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 23 proven. 42 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-02-15 20:25:47,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 20:25:48,087 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 23 proven. 42 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-02-15 20:25:48,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:25:48,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319851942] [2023-02-15 20:25:48,087 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 20:25:48,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606993691] [2023-02-15 20:25:48,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606993691] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 20:25:48,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 20:25:48,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-02-15 20:25:48,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533400989] [2023-02-15 20:25:48,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 20:25:48,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 20:25:48,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:25:48,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 20:25:48,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-02-15 20:25:48,089 INFO L87 Difference]: Start difference. First operand 145 states and 161 transitions. Second operand has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) [2023-02-15 20:25:49,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:25:49,124 INFO L93 Difference]: Finished difference Result 164 states and 188 transitions. [2023-02-15 20:25:49,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 20:25:49,125 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) Word has length 72 [2023-02-15 20:25:49,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:25:49,126 INFO L225 Difference]: With dead ends: 164 [2023-02-15 20:25:49,126 INFO L226 Difference]: Without dead ends: 153 [2023-02-15 20:25:49,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2023-02-15 20:25:49,126 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 20:25:49,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 101 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 20:25:49,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-02-15 20:25:49,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2023-02-15 20:25:49,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 87 states have (on average 1.0689655172413792) internal successors, (93), 91 states have internal predecessors, (93), 42 states have call successors, (42), 23 states have call predecessors, (42), 23 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2023-02-15 20:25:49,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 174 transitions. [2023-02-15 20:25:49,154 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 174 transitions. Word has length 72 [2023-02-15 20:25:49,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:25:49,154 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 174 transitions. [2023-02-15 20:25:49,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) [2023-02-15 20:25:49,155 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 174 transitions. [2023-02-15 20:25:49,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-02-15 20:25:49,155 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:25:49,156 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2023-02-15 20:25:49,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 20:25:49,360 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,SelfDestructingSolverStorable10 [2023-02-15 20:25:49,360 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:25:49,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:25:49,361 INFO L85 PathProgramCache]: Analyzing trace with hash 514910066, now seen corresponding path program 3 times [2023-02-15 20:25:49,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:25:49,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788835371] [2023-02-15 20:25:49,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:49,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:25:49,367 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:25:49,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [66382522] [2023-02-15 20:25:49,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 20:25:49,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:25:49,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:25:49,375 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 20:25:49,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 20:25:49,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-15 20:25:49,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 20:25:49,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-15 20:25:49,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:25:49,582 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 55 proven. 27 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-15 20:25:49,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 20:25:50,315 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 55 proven. 27 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-15 20:25:50,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:25:50,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788835371] [2023-02-15 20:25:50,315 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 20:25:50,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66382522] [2023-02-15 20:25:50,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66382522] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 20:25:50,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 20:25:50,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-02-15 20:25:50,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850385691] [2023-02-15 20:25:50,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 20:25:50,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 20:25:50,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:25:50,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 20:25:50,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-02-15 20:25:50,317 INFO L87 Difference]: Start difference. First operand 153 states and 174 transitions. Second operand has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) [2023-02-15 20:25:53,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-15 20:25:54,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:25:54,989 INFO L93 Difference]: Finished difference Result 159 states and 179 transitions. [2023-02-15 20:25:54,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 20:25:54,989 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) Word has length 79 [2023-02-15 20:25:54,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:25:54,990 INFO L225 Difference]: With dead ends: 159 [2023-02-15 20:25:54,990 INFO L226 Difference]: Without dead ends: 143 [2023-02-15 20:25:54,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2023-02-15 20:25:54,991 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 25 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 78 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-02-15 20:25:54,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 96 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 423 Invalid, 1 Unknown, 0 Unchecked, 3.9s Time] [2023-02-15 20:25:54,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-02-15 20:25:55,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2023-02-15 20:25:55,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 87 states have internal predecessors, (88), 34 states have call successors, (34), 22 states have call predecessors, (34), 22 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2023-02-15 20:25:55,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 155 transitions. [2023-02-15 20:25:55,017 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 155 transitions. Word has length 79 [2023-02-15 20:25:55,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:25:55,017 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 155 transitions. [2023-02-15 20:25:55,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) [2023-02-15 20:25:55,017 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 155 transitions. [2023-02-15 20:25:55,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-02-15 20:25:55,018 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:25:55,019 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:25:55,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 20:25:55,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:25:55,224 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:25:55,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:25:55,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1602424598, now seen corresponding path program 2 times [2023-02-15 20:25:55,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:25:55,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13846707] [2023-02-15 20:25:55,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:55,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:25:55,237 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:25:55,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1364655704] [2023-02-15 20:25:55,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 20:25:55,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:25:55,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:25:55,247 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 20:25:55,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 20:25:55,303 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 20:25:55,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 20:25:55,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 20:25:55,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:25:55,429 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 120 proven. 656 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2023-02-15 20:25:55,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 20:25:55,549 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-02-15 20:25:55,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:25:55,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13846707] [2023-02-15 20:25:55,549 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 20:25:55,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364655704] [2023-02-15 20:25:55,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364655704] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 20:25:55,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 20:25:55,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-02-15 20:25:55,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240611184] [2023-02-15 20:25:55,550 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 20:25:55,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 20:25:55,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:25:55,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 20:25:55,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-02-15 20:25:55,551 INFO L87 Difference]: Start difference. First operand 141 states and 155 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 9 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) [2023-02-15 20:25:55,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:25:55,877 INFO L93 Difference]: Finished difference Result 398 states and 422 transitions. [2023-02-15 20:25:55,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 20:25:55,878 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 9 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) Word has length 125 [2023-02-15 20:25:55,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:25:55,879 INFO L225 Difference]: With dead ends: 398 [2023-02-15 20:25:55,879 INFO L226 Difference]: Without dead ends: 382 [2023-02-15 20:25:55,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2023-02-15 20:25:55,880 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 143 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 20:25:55,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 357 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 20:25:55,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2023-02-15 20:25:55,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 326. [2023-02-15 20:25:55,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 202 states have (on average 1.0495049504950495) internal successors, (212), 209 states have internal predecessors, (212), 68 states have call successors, (68), 56 states have call predecessors, (68), 55 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) [2023-02-15 20:25:55,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 345 transitions. [2023-02-15 20:25:55,933 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 345 transitions. Word has length 125 [2023-02-15 20:25:55,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:25:55,933 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 345 transitions. [2023-02-15 20:25:55,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 9 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) [2023-02-15 20:25:55,934 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 345 transitions. [2023-02-15 20:25:55,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-02-15 20:25:55,935 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:25:55,935 INFO L195 NwaCegarLoop]: trace histogram [24, 23, 23, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:25:55,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 20:25:56,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-15 20:25:56,138 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:25:56,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:25:56,138 INFO L85 PathProgramCache]: Analyzing trace with hash 36255119, now seen corresponding path program 1 times [2023-02-15 20:25:56,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:25:56,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408160072] [2023-02-15 20:25:56,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:56,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:25:56,165 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:25:56,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1435459650] [2023-02-15 20:25:56,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:56,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:25:56,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:25:56,178 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 20:25:56,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 20:25:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:25:56,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-15 20:25:56,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:25:56,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1106 backedges. 104 proven. 116 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2023-02-15 20:25:56,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 20:25:57,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:25:57,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408160072] [2023-02-15 20:25:57,136 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 20:25:57,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435459650] [2023-02-15 20:25:57,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435459650] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 20:25:57,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-15 20:25:57,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2023-02-15 20:25:57,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235337977] [2023-02-15 20:25:57,136 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-15 20:25:57,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 20:25:57,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:25:57,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 20:25:57,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2023-02-15 20:25:57,137 INFO L87 Difference]: Start difference. First operand 326 states and 345 transitions. Second operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2023-02-15 20:25:57,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:25:57,551 INFO L93 Difference]: Finished difference Result 328 states and 346 transitions. [2023-02-15 20:25:57,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 20:25:57,552 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) Word has length 133 [2023-02-15 20:25:57,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:25:57,553 INFO L225 Difference]: With dead ends: 328 [2023-02-15 20:25:57,553 INFO L226 Difference]: Without dead ends: 312 [2023-02-15 20:25:57,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 163 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2023-02-15 20:25:57,554 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 12 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 20:25:57,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 149 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 20:25:57,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2023-02-15 20:25:57,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2023-02-15 20:25:57,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 201 states have internal predecessors, (203), 64 states have call successors, (64), 53 states have call predecessors, (64), 53 states have return successors, (62), 57 states have call predecessors, (62), 62 states have call successors, (62) [2023-02-15 20:25:57,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 329 transitions. [2023-02-15 20:25:57,603 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 329 transitions. Word has length 133 [2023-02-15 20:25:57,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:25:57,604 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 329 transitions. [2023-02-15 20:25:57,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2023-02-15 20:25:57,604 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 329 transitions. [2023-02-15 20:25:57,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-02-15 20:25:57,605 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:25:57,605 INFO L195 NwaCegarLoop]: trace histogram [28, 27, 27, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:25:57,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 20:25:57,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-15 20:25:57,810 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:25:57,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:25:57,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1972302768, now seen corresponding path program 2 times [2023-02-15 20:25:57,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:25:57,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990801895] [2023-02-15 20:25:57,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:57,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:25:57,817 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:25:57,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1610948036] [2023-02-15 20:25:57,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 20:25:57,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:25:57,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:25:57,819 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 20:25:57,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 20:25:57,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 20:25:57,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 20:25:57,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-15 20:25:57,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:25:58,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 128 proven. 84 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2023-02-15 20:25:58,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 20:25:58,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:25:58,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990801895] [2023-02-15 20:25:58,703 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 20:25:58,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610948036] [2023-02-15 20:25:58,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610948036] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 20:25:58,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-15 20:25:58,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2023-02-15 20:25:58,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705890136] [2023-02-15 20:25:58,703 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-15 20:25:58,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 20:25:58,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:25:58,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 20:25:58,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2023-02-15 20:25:58,704 INFO L87 Difference]: Start difference. First operand 312 states and 329 transitions. Second operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 7 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 6 states have call predecessors, (27), 7 states have call successors, (27) [2023-02-15 20:25:59,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:25:59,185 INFO L93 Difference]: Finished difference Result 325 states and 342 transitions. [2023-02-15 20:25:59,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 20:25:59,185 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 7 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 6 states have call predecessors, (27), 7 states have call successors, (27) Word has length 156 [2023-02-15 20:25:59,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:25:59,186 INFO L225 Difference]: With dead ends: 325 [2023-02-15 20:25:59,186 INFO L226 Difference]: Without dead ends: 323 [2023-02-15 20:25:59,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2023-02-15 20:25:59,187 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 11 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 20:25:59,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 175 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 20:25:59,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2023-02-15 20:25:59,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 322. [2023-02-15 20:25:59,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 200 states have (on average 1.045) internal successors, (209), 207 states have internal predecessors, (209), 66 states have call successors, (66), 55 states have call predecessors, (66), 55 states have return successors, (64), 59 states have call predecessors, (64), 64 states have call successors, (64) [2023-02-15 20:25:59,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 339 transitions. [2023-02-15 20:25:59,239 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 339 transitions. Word has length 156 [2023-02-15 20:25:59,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:25:59,239 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 339 transitions. [2023-02-15 20:25:59,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 7 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 6 states have call predecessors, (27), 7 states have call successors, (27) [2023-02-15 20:25:59,239 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 339 transitions. [2023-02-15 20:25:59,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-02-15 20:25:59,240 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:25:59,240 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 28, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:25:59,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-02-15 20:25:59,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-15 20:25:59,445 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:25:59,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:25:59,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1802004917, now seen corresponding path program 2 times [2023-02-15 20:25:59,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:25:59,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163816033] [2023-02-15 20:25:59,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:25:59,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:25:59,461 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:25:59,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1077093539] [2023-02-15 20:25:59,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 20:25:59,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:25:59,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:25:59,478 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 20:25:59,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 20:25:59,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 20:25:59,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 20:25:59,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 63 conjunts are in the unsatisfiable core [2023-02-15 20:25:59,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:26:01,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 204 proven. 88 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked. [2023-02-15 20:26:01,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 20:26:09,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 204 proven. 88 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked. [2023-02-15 20:26:09,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:26:09,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163816033] [2023-02-15 20:26:09,513 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 20:26:09,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077093539] [2023-02-15 20:26:09,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077093539] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 20:26:09,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 20:26:09,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2023-02-15 20:26:09,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102224795] [2023-02-15 20:26:09,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 20:26:09,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-15 20:26:09,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:26:09,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-15 20:26:09,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2023-02-15 20:26:09,514 INFO L87 Difference]: Start difference. First operand 322 states and 339 transitions. Second operand has 22 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 14 states have call successors, (58), 3 states have call predecessors, (58), 2 states have return successors, (56), 14 states have call predecessors, (56), 14 states have call successors, (56) [2023-02-15 20:26:42,275 WARN L233 SmtUtils]: Spent 31.55s on a formula simplification that was a NOOP. DAG size: 161 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 20:26:44,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-15 20:26:46,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-15 20:26:48,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-15 20:26:50,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-15 20:26:53,328 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse19 (* |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~x~0#1|)) (.cse17 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~n~0#1|))) (let ((.cse4 (not (= (+ (* 6 |c_ULTIMATE.start_main_~n~0#1|) 6) |c_ULTIMATE.start_main_~z~0#1|))) (.cse9 (* 6 .cse17)) (.cse6 (* 18 .cse19)) (.cse7 (* 4 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (.cse3 (* 2 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (.cse8 (* 2 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (.cse5 (* 18 .cse17)) (.cse10 (* 6 .cse19)) (.cse14 (* |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~n~0#1|)) (.cse2 (* 12 |c_ULTIMATE.start_main_~x~0#1|)) (.cse15 (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (.cse1 (* 6 (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~x~0#1|))) (.cse11 (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (.cse16 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~n~0#1|))) (and (let ((.cse0 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~x~0#1|))) (or (not (= .cse0 (+ .cse1 .cse2))) (= (+ (* 10 |c_ULTIMATE.start_main_~y~0#1|) (* 3 .cse0) (* 18 |c_ULTIMATE.start_main_~x~0#1|) 10) (+ .cse3 (* 3 |c_ULTIMATE.start_main_~z~0#1|))))) (or .cse4 (not (<= |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|)) (= (+ .cse5 (* 64 |c_ULTIMATE.start_main_~y~0#1|) .cse6 (* 10 |c_ULTIMATE.start_main_~z~0#1|) (* 54 |c_ULTIMATE.start_main_~x~0#1|)) (+ .cse7 .cse3 (* 18 |c_ULTIMATE.start_main_~n~0#1|) .cse8 26)) (not (= (+ .cse9 .cse10) (+ (* 6 .cse11) .cse1)))) (let ((.cse12 (* 12 .cse17)) (.cse13 (* 6 .cse16))) (or .cse4 (= (+ .cse12 (* 106 |c_ULTIMATE.start_main_~y~0#1|) .cse6 (* 34 |c_ULTIMATE.start_main_~z~0#1|) (* 72 |c_ULTIMATE.start_main_~x~0#1|)) (+ .cse7 .cse3 (* 246 |c_ULTIMATE.start_main_~n~0#1|) .cse13 (* 72 .cse14) .cse8 212)) (not (<= (+ |c_ULTIMATE.start_main_~n~0#1| 1) |c_ULTIMATE.start_main_~a~0#1|)) (not (= (+ .cse12 (* 12 |c_ULTIMATE.start_main_~y~0#1|) .cse10 (* 6 |c_ULTIMATE.start_main_~z~0#1|) .cse13 (* 6 |c_ULTIMATE.start_main_~x~0#1|)) (+ (* 6 .cse15) (* 12 .cse11) .cse1))))) (let ((.cse18 (* 12 .cse16))) (or .cse4 (= (+ .cse9 (* 160 |c_ULTIMATE.start_main_~y~0#1|) .cse6 (* 70 |c_ULTIMATE.start_main_~z~0#1|) (* 90 |c_ULTIMATE.start_main_~x~0#1|)) (+ .cse7 .cse3 (* 582 |c_ULTIMATE.start_main_~n~0#1|) .cse18 (* 180 .cse14) .cse8 482)) (not (= (+ .cse5 .cse10 (* 24 |c_ULTIMATE.start_main_~z~0#1|) (* 144 |c_ULTIMATE.start_main_~n~0#1|) (* 36 |c_ULTIMATE.start_main_~y~0#1|) .cse18 (* 36 .cse14) .cse2 144) (+ (* 12 .cse15) (* 72 |c_ULTIMATE.start_main_~a~0#1|) (* 36 (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~n~0#1|)) .cse1 (* 18 .cse11)))) (not (<= (+ |c_ULTIMATE.start_main_~n~0#1| 2) |c_ULTIMATE.start_main_~a~0#1|))))))) is different from false [2023-02-15 20:26:55,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-15 20:27:06,007 WARN L233 SmtUtils]: Spent 10.45s on a formula simplification that was a NOOP. DAG size: 167 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 20:27:08,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-15 20:27:21,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-15 20:27:23,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-15 20:27:43,858 WARN L233 SmtUtils]: Spent 9.32s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 20:27:45,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-15 20:27:48,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-15 20:27:51,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-15 20:27:54,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-15 20:27:57,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-15 20:28:01,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:28:01,014 INFO L93 Difference]: Finished difference Result 346 states and 373 transitions. [2023-02-15 20:28:01,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 20:28:01,015 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 14 states have call successors, (58), 3 states have call predecessors, (58), 2 states have return successors, (56), 14 states have call predecessors, (56), 14 states have call successors, (56) Word has length 161 [2023-02-15 20:28:01,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:28:01,016 INFO L225 Difference]: With dead ends: 346 [2023-02-15 20:28:01,016 INFO L226 Difference]: Without dead ends: 320 [2023-02-15 20:28:01,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 298 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 81.7s TimeCoverageRelationStatistics Valid=263, Invalid=796, Unknown=1, NotChecked=62, Total=1122 [2023-02-15 20:28:01,017 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 30 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 115 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 32.8s IncrementalHoareTripleChecker+Time [2023-02-15 20:28:01,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 189 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1088 Invalid, 10 Unknown, 2 Unchecked, 32.8s Time] [2023-02-15 20:28:01,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2023-02-15 20:28:01,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 317. [2023-02-15 20:28:01,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 194 states have (on average 1.041237113402062) internal successors, (202), 200 states have internal predecessors, (202), 70 states have call successors, (70), 53 states have call predecessors, (70), 52 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2023-02-15 20:28:01,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 339 transitions. [2023-02-15 20:28:01,139 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 339 transitions. Word has length 161 [2023-02-15 20:28:01,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:28:01,140 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 339 transitions. [2023-02-15 20:28:01,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 14 states have call successors, (58), 3 states have call predecessors, (58), 2 states have return successors, (56), 14 states have call predecessors, (56), 14 states have call successors, (56) [2023-02-15 20:28:01,140 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 339 transitions. [2023-02-15 20:28:01,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2023-02-15 20:28:01,141 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:28:01,141 INFO L195 NwaCegarLoop]: trace histogram [33, 32, 32, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:28:01,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-15 20:28:01,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-15 20:28:01,346 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:28:01,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:28:01,346 INFO L85 PathProgramCache]: Analyzing trace with hash -476934806, now seen corresponding path program 3 times [2023-02-15 20:28:01,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:28:01,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292004523] [2023-02-15 20:28:01,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:28:01,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:28:01,357 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:28:01,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [335242308] [2023-02-15 20:28:01,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 20:28:01,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:28:01,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:28:01,358 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 20:28:01,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-15 20:28:02,403 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-15 20:28:02,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 20:28:02,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-15 20:28:02,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:28:21,572 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 20:28:29,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2168 backedges. 485 proven. 59 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2023-02-15 20:28:29,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 20:28:31,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2168 backedges. 350 proven. 19 refuted. 0 times theorem prover too weak. 1799 trivial. 0 not checked. [2023-02-15 20:28:31,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:28:31,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292004523] [2023-02-15 20:28:31,729 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 20:28:31,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335242308] [2023-02-15 20:28:31,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335242308] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 20:28:31,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 20:28:31,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 20 [2023-02-15 20:28:31,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161523794] [2023-02-15 20:28:31,730 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 20:28:31,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 20:28:31,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:28:31,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 20:28:31,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=293, Unknown=1, NotChecked=0, Total=380 [2023-02-15 20:28:31,731 INFO L87 Difference]: Start difference. First operand 317 states and 339 transitions. Second operand has 20 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 12 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (31), 11 states have call predecessors, (31), 10 states have call successors, (31) [2023-02-15 20:28:36,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-15 20:28:39,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-15 20:28:41,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-15 20:28:50,380 WARN L233 SmtUtils]: Spent 6.62s on a formula simplification. DAG size of input: 80 DAG size of output: 71 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 20:28:53,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-15 20:28:56,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:28:56,604 INFO L93 Difference]: Finished difference Result 329 states and 350 transitions. [2023-02-15 20:28:56,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 20:28:56,605 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 12 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (31), 11 states have call predecessors, (31), 10 states have call successors, (31) Word has length 184 [2023-02-15 20:28:56,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:28:56,606 INFO L225 Difference]: With dead ends: 329 [2023-02-15 20:28:56,606 INFO L226 Difference]: Without dead ends: 296 [2023-02-15 20:28:56,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 345 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=140, Invalid=459, Unknown=1, NotChecked=0, Total=600 [2023-02-15 20:28:56,607 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 63 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2023-02-15 20:28:56,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 82 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 237 Invalid, 3 Unknown, 0 Unchecked, 13.9s Time] [2023-02-15 20:28:56,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2023-02-15 20:28:56,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 290. [2023-02-15 20:28:56,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 187 states have (on average 1.0053475935828877) internal successors, (188), 187 states have internal predecessors, (188), 52 states have call successors, (52), 51 states have call predecessors, (52), 50 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2023-02-15 20:28:56,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 291 transitions. [2023-02-15 20:28:56,695 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 291 transitions. Word has length 184 [2023-02-15 20:28:56,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:28:56,696 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 291 transitions. [2023-02-15 20:28:56,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 12 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (31), 11 states have call predecessors, (31), 10 states have call successors, (31) [2023-02-15 20:28:56,696 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 291 transitions. [2023-02-15 20:28:56,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2023-02-15 20:28:56,698 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:28:56,698 INFO L195 NwaCegarLoop]: trace histogram [52, 51, 51, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:28:56,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-15 20:28:56,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:28:56,905 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:28:56,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:28:56,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1951591730, now seen corresponding path program 3 times [2023-02-15 20:28:56,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:28:56,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737938684] [2023-02-15 20:28:56,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:28:56,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:28:56,917 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 20:28:56,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1171623478] [2023-02-15 20:28:56,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 20:28:56,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:28:56,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:28:56,918 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 20:28:56,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-15 20:28:57,130 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2023-02-15 20:28:57,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-15 20:28:57,130 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 20:28:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 20:28:57,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 20:28:57,300 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 20:28:57,301 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 20:28:57,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-15 20:28:57,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-15 20:28:57,512 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:28:57,515 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 20:28:57,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 08:28:57 BoogieIcfgContainer [2023-02-15 20:28:57,573 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 20:28:57,574 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 20:28:57,574 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 20:28:57,574 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 20:28:57,575 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 08:25:37" (3/4) ... [2023-02-15 20:28:57,576 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-15 20:28:57,636 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 20:28:57,636 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 20:28:57,636 INFO L158 Benchmark]: Toolchain (without parser) took 200947.77ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 151.5MB in the beginning and 121.1MB in the end (delta: 30.5MB). Peak memory consumption was 124.4MB. Max. memory is 16.1GB. [2023-02-15 20:28:57,637 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 151.0MB. Free memory is still 94.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 20:28:57,637 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.57ms. Allocated memory is still 201.3MB. Free memory was 151.1MB in the beginning and 140.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 20:28:57,637 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.47ms. Allocated memory is still 201.3MB. Free memory was 140.6MB in the beginning and 139.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 20:28:57,637 INFO L158 Benchmark]: Boogie Preprocessor took 22.01ms. Allocated memory is still 201.3MB. Free memory was 139.0MB in the beginning and 137.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 20:28:57,637 INFO L158 Benchmark]: RCFGBuilder took 271.43ms. Allocated memory is still 201.3MB. Free memory was 137.7MB in the beginning and 125.9MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 20:28:57,638 INFO L158 Benchmark]: TraceAbstraction took 200364.93ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 125.1MB in the beginning and 130.5MB in the end (delta: -5.4MB). Peak memory consumption was 88.7MB. Max. memory is 16.1GB. [2023-02-15 20:28:57,638 INFO L158 Benchmark]: Witness Printer took 62.17ms. Allocated memory is still 293.6MB. Free memory was 130.5MB in the beginning and 121.1MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-15 20:28:57,639 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.14ms. Allocated memory is still 151.0MB. Free memory is still 94.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.57ms. Allocated memory is still 201.3MB. Free memory was 151.1MB in the beginning and 140.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.47ms. Allocated memory is still 201.3MB. Free memory was 140.6MB in the beginning and 139.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.01ms. Allocated memory is still 201.3MB. Free memory was 139.0MB in the beginning and 137.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 271.43ms. Allocated memory is still 201.3MB. Free memory was 137.7MB in the beginning and 125.9MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 200364.93ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 125.1MB in the beginning and 130.5MB in the end (delta: -5.4MB). Peak memory consumption was 88.7MB. Max. memory is 16.1GB. * Witness Printer took 62.17ms. Allocated memory is still 293.6MB. Free memory was 130.5MB in the beginning and 121.1MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. 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: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [counter=0] [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [a=10, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [a=10, counter=1, counter++=0, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=10, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=10, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=10, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=10, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=10, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=10, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [a=10, counter=2, counter++=1, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=10, counter=2, n=1, x=1, y=7, z=12] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=10, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=10, counter=2, n=1, x=1, y=7, z=12] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=10, counter=2, n=1, x=1, y=7, z=12] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=10, counter=2, n=1, x=1, y=7, z=12] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=10, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [a=10, counter=3, counter++=2, n=2, x=8, y=19, z=18] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=10, counter=3, n=2, x=8, y=19, z=18] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=10, counter=3, n=2, x=8, y=19, z=18] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=10, counter=3, n=2, x=8, y=19, z=18] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=10, counter=3, n=2, x=8, y=19, z=18] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=10, counter=3, n=2, x=8, y=19, z=18] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=10, counter=3, n=3, x=27, y=37, z=24] [L33] EXPR counter++ VAL [a=10, counter=4, counter++=3, n=3, x=27, y=37, z=24] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=10, counter=4, n=3, x=27, y=37, z=24] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=10, counter=4, n=3, x=27, y=37, z=24] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=10, counter=4, n=3, x=27, y=37, z=24] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=10, counter=4, n=3, x=27, y=37, z=24] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=10, counter=4, n=3, x=27, y=37, z=24] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=10, counter=4, n=4, x=64, y=61, z=30] [L33] EXPR counter++ VAL [a=10, counter=5, counter++=4, n=4, x=64, y=61, z=30] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=10, counter=5, n=4, x=64, y=61, z=30] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=10, counter=5, n=4, x=64, y=61, z=30] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=10, counter=5, n=4, x=64, y=61, z=30] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=10, counter=5, n=4, x=64, y=61, z=30] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=10, counter=5, n=4, x=64, y=61, z=30] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=10, counter=5, n=5, x=125, y=91, z=36] [L33] EXPR counter++ VAL [a=10, counter=6, counter++=5, n=5, x=125, y=91, z=36] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=10, counter=6, n=5, x=125, y=91, z=36] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=10, counter=6, n=5, x=125, y=91, z=36] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=10, counter=6, n=5, x=125, y=91, z=36] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=10, counter=6, n=5, x=125, y=91, z=36] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=10, counter=6, n=5, x=125, y=91, z=36] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=10, counter=6, n=6, x=216, y=127, z=42] [L33] EXPR counter++ VAL [a=10, counter=7, counter++=6, n=6, x=216, y=127, z=42] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=10, counter=7, n=6, x=216, y=127, z=42] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=10, counter=7, n=6, x=216, y=127, z=42] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=10, counter=7, n=6, x=216, y=127, z=42] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=10, counter=7, n=6, x=216, y=127, z=42] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=10, counter=7, n=6, x=216, y=127, z=42] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=10, counter=7, n=7, x=343, y=169, z=48] [L33] EXPR counter++ VAL [a=10, counter=8, counter++=7, n=7, x=343, y=169, z=48] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=10, counter=8, n=7, x=343, y=169, z=48] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=10, counter=8, n=7, x=343, y=169, z=48] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=10, counter=8, n=7, x=343, y=169, z=48] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=10, counter=8, n=7, x=343, y=169, z=48] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=10, counter=8, n=7, x=343, y=169, z=48] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=10, counter=8, n=8, x=512, y=217, z=54] [L33] EXPR counter++ VAL [a=10, counter=9, counter++=8, n=8, x=512, y=217, z=54] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=10, counter=9, n=8, x=512, y=217, z=54] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=10, counter=9, n=8, x=512, y=217, z=54] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=10, counter=9, n=8, x=512, y=217, z=54] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=10, counter=9, n=8, x=512, y=217, z=54] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=10, counter=9, n=8, x=512, y=217, z=54] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=10, counter=9, n=9, x=729, y=271, z=60] [L33] EXPR counter++ VAL [a=10, counter=10, counter++=9, n=9, x=729, y=271, z=60] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=10, counter=10, n=9, x=729, y=271, z=60] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=10, counter=10, n=9, x=729, y=271, z=60] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=10, counter=10, n=9, x=729, y=271, z=60] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=10, counter=10, n=9, x=729, y=271, z=60] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=10, counter=10, n=9, x=729, y=271, z=60] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=10, counter=10, n=10, x=1000, y=331, z=66] [L33] EXPR counter++ VAL [a=10, counter=11, counter++=10, n=10, x=1000, y=331, z=66] [L33] COND FALSE !(counter++<10) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [a=10, counter=11, n=10, x=1000, y=331, z=66] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, counter=11] [L15] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=11] [L17] reach_error() VAL [\old(cond)=0, cond=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 200.3s, OverallIterations: 18, TraceHistogramMax: 52, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 149.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 15 mSolverCounterUnknown, 554 SdHoareTripleChecker+Valid, 57.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 441 mSDsluCounter, 1970 SdHoareTripleChecker+Invalid, 57.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2 IncrementalHoareTripleChecker+Unchecked, 1378 mSDsCounter, 626 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6016 IncrementalHoareTripleChecker+Invalid, 6659 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 626 mSolverCounterUnsat, 592 mSDtfsCounter, 6016 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2204 GetRequests, 1933 SyntacticMatches, 20 SemanticMatches, 251 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 107.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=326occurred in iteration=13, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 84 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 44.6s InterpolantComputationTime, 1490 NumberOfCodeBlocks, 1329 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 2053 ConstructedInterpolants, 2 QuantifiedInterpolants, 17486 SizeOfPredicates, 52 NumberOfNonLiveVariables, 2546 ConjunctsInSsa, 414 ConjunctsInUnsatCore, 29 InterpolantComputations, 3 PerfectInterpolantSequences, 13196/14708 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! [2023-02-15 20:28:57,676 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