/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain EqDomain -i ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 11:14:53,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 11:14:53,170 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 11:14:53,209 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 11:14:53,209 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 11:14:53,212 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 11:14:53,216 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 11:14:53,218 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 11:14:53,219 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 11:14:53,224 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 11:14:53,226 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 11:14:53,227 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 11:14:53,228 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 11:14:53,230 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 11:14:53,231 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 11:14:53,233 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 11:14:53,233 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 11:14:53,234 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 11:14:53,236 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 11:14:53,241 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 11:14:53,242 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 11:14:53,243 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 11:14:53,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 11:14:53,245 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 11:14:53,249 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 11:14:53,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 11:14:53,249 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 11:14:53,250 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 11:14:53,250 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 11:14:53,250 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 11:14:53,251 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 11:14:53,251 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 11:14:53,251 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 11:14:53,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 11:14:53,252 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 11:14:53,253 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 11:14:53,253 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 11:14:53,253 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 11:14:53,254 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 11:14:53,254 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 11:14:53,255 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 11:14:53,256 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-01 11:14:53,272 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 11:14:53,273 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 11:14:53,273 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 11:14:53,273 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 11:14:53,274 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 11:14:53,274 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 11:14:53,274 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 11:14:53,275 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 11:14:53,275 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 11:14:53,275 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 11:14:53,275 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 11:14:53,275 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 11:14:53,275 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 11:14:53,276 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 11:14:53,276 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 11:14:53,276 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 11:14:53,276 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 11:14:53,276 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 11:14:53,277 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 11:14:53,277 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 11:14:53,277 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 11:14:53,278 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 11:14:53,278 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 11:14:53,278 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 11:14:53,278 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 11:14:53,278 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 11:14:53,278 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 11:14:53,279 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 11:14:53,279 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 11:14:53,279 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 11:14:53,279 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 11:14:53,279 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 11:14:53,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 11:14:53,280 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 11:14:53,280 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 11:14:53,280 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 11:14:53,280 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 11:14:53,280 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 11:14:53,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 11:14:53,281 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 11:14:53,281 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 11:14:53,281 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> EqDomain [2023-04-01 11:14:53,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 11:14:53,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 11:14:53,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 11:14:53,521 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 11:14:53,522 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 11:14:53,523 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound2.c [2023-04-01 11:14:54,729 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 11:14:54,905 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 11:14:54,905 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound2.c [2023-04-01 11:14:54,913 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bf30415e/bb84ae1c19fc47a4804e89ccc4724f84/FLAG93cbd5533 [2023-04-01 11:14:54,930 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bf30415e/bb84ae1c19fc47a4804e89ccc4724f84 [2023-04-01 11:14:54,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 11:14:54,934 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 11:14:54,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 11:14:54,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 11:14:54,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 11:14:54,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 11:14:54" (1/1) ... [2023-04-01 11:14:54,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52913750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:14:54, skipping insertion in model container [2023-04-01 11:14:54,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 11:14:54" (1/1) ... [2023-04-01 11:14:54,950 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 11:14:54,966 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 11:14:55,084 WARN L247 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_unwindbound2.c[588,601] [2023-04-01 11:14:55,124 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 11:14:55,135 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 11:14:55,146 WARN L247 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_unwindbound2.c[588,601] [2023-04-01 11:14:55,154 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 11:14:55,166 INFO L208 MainTranslator]: Completed translation [2023-04-01 11:14:55,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:14:55 WrapperNode [2023-04-01 11:14:55,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 11:14:55,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 11:14:55,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 11:14:55,168 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 11:14:55,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:14:55" (1/1) ... [2023-04-01 11:14:55,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:14:55" (1/1) ... [2023-04-01 11:14:55,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:14:55" (1/1) ... [2023-04-01 11:14:55,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:14:55" (1/1) ... [2023-04-01 11:14:55,187 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:14:55" (1/1) ... [2023-04-01 11:14:55,190 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:14:55" (1/1) ... [2023-04-01 11:14:55,191 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:14:55" (1/1) ... [2023-04-01 11:14:55,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:14:55" (1/1) ... [2023-04-01 11:14:55,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 11:14:55,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 11:14:55,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 11:14:55,195 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 11:14:55,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:14:55" (1/1) ... [2023-04-01 11:14:55,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 11:14:55,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:14:55,230 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-04-01 11:14:55,233 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-04-01 11:14:55,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 11:14:55,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 11:14:55,263 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 11:14:55,263 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-04-01 11:14:55,263 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-04-01 11:14:55,263 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 11:14:55,263 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 11:14:55,264 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 11:14:55,264 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 11:14:55,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 11:14:55,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2023-04-01 11:14:55,264 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-04-01 11:14:55,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-04-01 11:14:55,264 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 11:14:55,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 11:14:55,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 11:14:55,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 11:14:55,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 11:14:55,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 11:14:55,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 11:14:55,324 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 11:14:55,326 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 11:14:55,458 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 11:14:55,478 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 11:14:55,479 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-04-01 11:14:55,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 11:14:55 BoogieIcfgContainer [2023-04-01 11:14:55,481 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 11:14:55,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 11:14:55,485 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 11:14:55,487 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 11:14:55,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 11:14:54" (1/3) ... [2023-04-01 11:14:55,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a808418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 11:14:55, skipping insertion in model container [2023-04-01 11:14:55,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:14:55" (2/3) ... [2023-04-01 11:14:55,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a808418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 11:14:55, skipping insertion in model container [2023-04-01 11:14:55,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 11:14:55" (3/3) ... [2023-04-01 11:14:55,489 INFO L112 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound2.c [2023-04-01 11:14:55,529 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 11:14:55,530 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 11:14:55,601 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 11:14:55,631 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=FINITE_AUTOMATA, 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;@3e68d321, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 11:14:55,632 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 11:14:55,636 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-04-01 11:14:55,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-04-01 11:14:55,643 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:14:55,643 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:14:55,644 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:14:55,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:14:55,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1647932821, now seen corresponding path program 1 times [2023-04-01 11:14:55,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:14:55,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916287811] [2023-04-01 11:14:55,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:14:55,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:14:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:14:55,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:14:55,811 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:14:55,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916287811] [2023-04-01 11:14:55,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916287811] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 11:14:55,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 11:14:55,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-04-01 11:14:55,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146298238] [2023-04-01 11:14:55,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 11:14:55,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-04-01 11:14:55,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:14:55,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-04-01 11:14:55,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-04-01 11:14:55,856 INFO L87 Difference]: Start difference. First operand has 29 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:14:55,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:14:55,880 INFO L93 Difference]: Finished difference Result 53 states and 90 transitions. [2023-04-01 11:14:55,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-04-01 11:14:55,882 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-04-01 11:14:55,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:14:55,888 INFO L225 Difference]: With dead ends: 53 [2023-04-01 11:14:55,888 INFO L226 Difference]: Without dead ends: 25 [2023-04-01 11:14:55,891 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-04-01 11:14:55,894 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 11:14:55,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 11:14:55,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-04-01 11:14:55,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-04-01 11:14:55,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-04-01 11:14:55,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2023-04-01 11:14:55,936 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 36 transitions. Word has length 10 [2023-04-01 11:14:55,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:14:55,936 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 36 transitions. [2023-04-01 11:14:55,936 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:14:55,936 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions. [2023-04-01 11:14:55,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-04-01 11:14:55,937 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:14:55,937 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:14:55,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 11:14:55,938 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:14:55,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:14:55,938 INFO L85 PathProgramCache]: Analyzing trace with hash -78558798, now seen corresponding path program 1 times [2023-04-01 11:14:55,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:14:55,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195723059] [2023-04-01 11:14:55,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:14:55,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:14:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:14:56,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:14:56,073 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:14:56,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195723059] [2023-04-01 11:14:56,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195723059] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 11:14:56,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 11:14:56,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-01 11:14:56,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442133642] [2023-04-01 11:14:56,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 11:14:56,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-01 11:14:56,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:14:56,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-01 11:14:56,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-01 11:14:56,077 INFO L87 Difference]: Start difference. First operand 25 states and 36 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:14:56,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:14:56,138 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2023-04-01 11:14:56,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-04-01 11:14:56,140 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), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-04-01 11:14:56,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:14:56,140 INFO L225 Difference]: With dead ends: 39 [2023-04-01 11:14:56,141 INFO L226 Difference]: Without dead ends: 27 [2023-04-01 11:14:56,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-04-01 11:14:56,143 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 11:14:56,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 11:14:56,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-04-01 11:14:56,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-04-01 11:14:56,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-04-01 11:14:56,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions. [2023-04-01 11:14:56,153 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 38 transitions. Word has length 11 [2023-04-01 11:14:56,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:14:56,153 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 38 transitions. [2023-04-01 11:14:56,154 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), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:14:56,154 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2023-04-01 11:14:56,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-04-01 11:14:56,154 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:14:56,154 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:14:56,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-01 11:14:56,155 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:14:56,156 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:14:56,156 INFO L85 PathProgramCache]: Analyzing trace with hash -77009666, now seen corresponding path program 1 times [2023-04-01 11:14:56,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:14:56,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534868088] [2023-04-01 11:14:56,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:14:56,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:14:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:14:56,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:14:56,345 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:14:56,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534868088] [2023-04-01 11:14:56,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534868088] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 11:14:56,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 11:14:56,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 11:14:56,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331724426] [2023-04-01 11:14:56,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 11:14:56,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 11:14:56,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:14:56,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 11:14:56,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 11:14:56,347 INFO L87 Difference]: Start difference. First operand 27 states and 38 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:14:56,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:14:56,457 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2023-04-01 11:14:56,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 11:14:56,457 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-04-01 11:14:56,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:14:56,458 INFO L225 Difference]: With dead ends: 33 [2023-04-01 11:14:56,458 INFO L226 Difference]: Without dead ends: 31 [2023-04-01 11:14:56,459 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-04-01 11:14:56,460 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 8 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 11:14:56,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 70 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 11:14:56,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-04-01 11:14:56,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-04-01 11:14:56,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-04-01 11:14:56,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2023-04-01 11:14:56,472 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 11 [2023-04-01 11:14:56,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:14:56,473 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2023-04-01 11:14:56,473 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:14:56,473 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2023-04-01 11:14:56,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-04-01 11:14:56,474 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:14:56,474 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:14:56,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-01 11:14:56,474 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:14:56,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:14:56,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1662799058, now seen corresponding path program 1 times [2023-04-01 11:14:56,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:14:56,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528554414] [2023-04-01 11:14:56,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:14:56,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:14:56,489 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 11:14:56,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [491862726] [2023-04-01 11:14:56,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:14:56,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:14:56,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:14:56,493 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-04-01 11:14:56,494 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-04-01 11:14:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:14:56,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 17 conjunts are in the unsatisfiable core [2023-04-01 11:14:56,550 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 11:14:56,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:14:56,651 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 11:14:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:14:56,833 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:14:56,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528554414] [2023-04-01 11:14:56,833 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 11:14:56,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491862726] [2023-04-01 11:14:56,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491862726] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 11:14:56,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1667794491] [2023-04-01 11:14:56,890 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-04-01 11:14:56,890 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 11:14:56,893 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 11:14:56,897 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 11:14:56,898 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 11:14:57,050 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 47 for LOIs [2023-04-01 11:14:57,441 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 47 for LOIs [2023-04-01 11:14:57,467 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-01 11:14:57,474 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 11:14:58,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1667794491] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 11:14:58,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-04-01 11:14:58,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [8, 7] total 22 [2023-04-01 11:14:58,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854223557] [2023-04-01 11:14:58,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 11:14:58,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-01 11:14:58,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:14:58,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-01 11:14:58,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2023-04-01 11:14:58,348 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 12 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 11:14:58,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:14:58,946 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2023-04-01 11:14:58,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-01 11:14:58,946 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2023-04-01 11:14:58,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:14:58,949 INFO L225 Difference]: With dead ends: 53 [2023-04-01 11:14:58,949 INFO L226 Difference]: Without dead ends: 45 [2023-04-01 11:14:58,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2023-04-01 11:14:58,953 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 11:14:58,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 36 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-01 11:14:58,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-04-01 11:14:58,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-04-01 11:14:58,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-04-01 11:14:58,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2023-04-01 11:14:58,984 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 16 [2023-04-01 11:14:58,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:14:58,989 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2023-04-01 11:14:58,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 11:14:58,989 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2023-04-01 11:14:58,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-04-01 11:14:58,991 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:14:58,991 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, 1, 1, 1] [2023-04-01 11:14:59,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-01 11:14:59,196 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-04-01 11:14:59,196 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:14:59,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:14:59,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1441032967, now seen corresponding path program 1 times [2023-04-01 11:14:59,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:14:59,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273906973] [2023-04-01 11:14:59,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:14:59,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:14:59,215 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 11:14:59,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [238632939] [2023-04-01 11:14:59,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:14:59,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:14:59,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:14:59,232 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-04-01 11:14:59,235 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-04-01 11:14:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:14:59,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 7 conjunts are in the unsatisfiable core [2023-04-01 11:14:59,292 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 11:14:59,351 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-04-01 11:14:59,351 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 11:14:59,408 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-04-01 11:14:59,408 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:14:59,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273906973] [2023-04-01 11:14:59,408 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 11:14:59,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238632939] [2023-04-01 11:14:59,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238632939] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 11:14:59,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1110073750] [2023-04-01 11:14:59,411 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-01 11:14:59,411 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 11:14:59,411 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 11:14:59,412 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 11:14:59,412 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 11:14:59,481 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 47 for LOIs [2023-04-01 11:15:03,081 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 43 for LOIs [2023-04-01 11:15:03,105 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-01 11:15:03,111 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 11:15:04,982 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '926#(and (= (select |#length| 3) 12) (= 13 (select |#length| 2)) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (not (= |#StackHeapBarrier| 0)) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select (select |#memory_int| 1) 0) 48) (= (select (select |#memory_int| 1) 1) 0) (= |#NULL.base| 0))' at error location [2023-04-01 11:15:04,983 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 11:15:04,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 11:15:04,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2023-04-01 11:15:04,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743614916] [2023-04-01 11:15:04,983 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 11:15:04,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 11:15:04,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:15:04,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 11:15:04,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2023-04-01 11:15:04,985 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-04-01 11:15:05,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:15:05,027 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2023-04-01 11:15:05,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 11:15:05,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 44 [2023-04-01 11:15:05,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:15:05,028 INFO L225 Difference]: With dead ends: 63 [2023-04-01 11:15:05,028 INFO L226 Difference]: Without dead ends: 47 [2023-04-01 11:15:05,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 106 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2023-04-01 11:15:05,029 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 11:15:05,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 11:15:05,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-04-01 11:15:05,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-04-01 11:15:05,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-04-01 11:15:05,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2023-04-01 11:15:05,041 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 44 [2023-04-01 11:15:05,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:15:05,041 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2023-04-01 11:15:05,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-04-01 11:15:05,041 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2023-04-01 11:15:05,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-04-01 11:15:05,042 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:15:05,042 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:15:05,049 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-04-01 11:15:05,249 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-04-01 11:15:05,249 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:15:05,250 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:15:05,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1933148283, now seen corresponding path program 1 times [2023-04-01 11:15:05,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:15:05,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276936837] [2023-04-01 11:15:05,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:15:05,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:15:05,263 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 11:15:05,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [388329316] [2023-04-01 11:15:05,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:15:05,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:15:05,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:15:05,282 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-04-01 11:15:05,284 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-04-01 11:15:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:15:05,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 21 conjunts are in the unsatisfiable core [2023-04-01 11:15:05,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 11:15:05,407 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-04-01 11:15:05,407 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 11:15:05,529 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-04-01 11:15:05,529 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:15:05,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276936837] [2023-04-01 11:15:05,530 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 11:15:05,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388329316] [2023-04-01 11:15:05,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388329316] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 11:15:05,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1557764462] [2023-04-01 11:15:05,534 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 11:15:05,534 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 11:15:05,534 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 11:15:05,535 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 11:15:05,535 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 11:15:05,573 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 47 for LOIs [2023-04-01 11:15:08,132 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 43 for LOIs [2023-04-01 11:15:08,148 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-01 11:15:08,151 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 11:15:09,348 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1392#(and (= (select |#length| 3) 12) (= 13 (select |#length| 2)) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (not (= |#StackHeapBarrier| 0)) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select (select |#memory_int| 1) 0) 48) (= (select (select |#memory_int| 1) 1) 0) (= |#NULL.base| 0))' at error location [2023-04-01 11:15:09,348 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 11:15:09,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 11:15:09,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-04-01 11:15:09,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869291006] [2023-04-01 11:15:09,348 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 11:15:09,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-01 11:15:09,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:15:09,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-01 11:15:09,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2023-04-01 11:15:09,351 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand has 13 states, 13 states have (on average 2.0) 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, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2023-04-01 11:15:11,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-04-01 11:15:11,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:15:11,358 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2023-04-01 11:15:11,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 11:15:11,359 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) 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, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) Word has length 44 [2023-04-01 11:15:11,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:15:11,359 INFO L225 Difference]: With dead ends: 69 [2023-04-01 11:15:11,360 INFO L226 Difference]: Without dead ends: 67 [2023-04-01 11:15:11,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2023-04-01 11:15:11,361 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 27 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-04-01 11:15:11,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 74 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-04-01 11:15:11,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-04-01 11:15:11,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2023-04-01 11:15:11,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-04-01 11:15:11,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2023-04-01 11:15:11,374 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 44 [2023-04-01 11:15:11,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:15:11,375 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2023-04-01 11:15:11,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) 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, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2023-04-01 11:15:11,375 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2023-04-01 11:15:11,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-04-01 11:15:11,376 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:15:11,376 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, 1, 1, 1] [2023-04-01 11:15:11,387 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-04-01 11:15:11,581 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-04-01 11:15:11,582 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:15:11,582 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:15:11,582 INFO L85 PathProgramCache]: Analyzing trace with hash -82151627, now seen corresponding path program 2 times [2023-04-01 11:15:11,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:15:11,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676695095] [2023-04-01 11:15:11,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:15:11,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:15:11,590 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 11:15:11,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2039468666] [2023-04-01 11:15:11,590 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 11:15:11,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:15:11,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:15:11,592 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-04-01 11:15:11,615 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-04-01 11:15:11,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-04-01 11:15:11,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 11:15:11,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 16 conjunts are in the unsatisfiable core [2023-04-01 11:15:11,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 11:15:11,718 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-04-01 11:15:11,719 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 11:15:11,780 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-04-01 11:15:11,780 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:15:11,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676695095] [2023-04-01 11:15:11,780 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 11:15:11,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039468666] [2023-04-01 11:15:11,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039468666] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 11:15:11,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [674422549] [2023-04-01 11:15:11,782 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 11:15:11,782 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 11:15:11,782 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 11:15:11,782 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 11:15:11,782 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 11:15:11,808 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 47 for LOIs [2023-04-01 11:15:16,739 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Solver couldn't answer isBottom for original: 84#(and (= (select |#length| 3) 12) (not (= |#length| (select |#memory_int| 1))) (not (= 7 main_~n~0)) (<= main_~n~0 (+ main_~a~0 1)) (not (= (+ 49 main_~x~0) (+ main_~n~0 main_~y~0))) (= 13 (select |#length| 2)) (not (= (+ main_~x~0 1) main_~n~0)) (not (= main_~n~0 14)) (= 2 (select |#length| 1)) (not (= (+ main_~x~0 2) (+ main_~n~0 main_~y~0))) (= (select |#valid| 3) 1) (not (= (* main_~n~0 2) (+ main_~x~0 2))) (not (= main_~n~0 4)) (not (= (+ main_~n~0 47) main_~x~0)) (= (+ (* (* main_~n~0 main_~x~0) 2) (* main_~y~0 main_~x~0) (* main_~y~0 3)) (+ (* main_~n~0 main_~y~0) 3 (* main_~n~0 2) (* main_~x~0 16) (* main_~n~0 main_~n~0) (* main_~x~0 main_~x~0))) (not (= (+ (* main_~x~0 2) 2) (+ main_~y~0 (* main_~n~0 2)))) (not (= |#length| |#valid|)) (= (+ main_~z~0 main_~x~0) (+ 5 main_~n~0 main_~y~0)) (not (= 49 main_~n~0)) (not (= (+ main_~x~0 1) (+ main_~n~0 main_~y~0))) (not (= main_~x~0 (+ main_~n~0 1))) (not (= |#StackHeapBarrier| 0)) (not (= (+ main_~x~0 4) (+ main_~n~0 main_~y~0))) (not (= main_~x~0 (+ main_~n~0 11))) (= (select |#valid| 1) 1) (not (= (+ main_~x~0 8) (+ main_~n~0 main_~y~0))) (not (= main_~n~0 13)) (not (= main_~x~0 (+ main_~n~0 2))) (= |old(~counter~0)| 0) (not (= (+ main_~x~0 3) (+ main_~n~0 main_~y~0))) (not (= (+ main_~n~0 12) main_~x~0)) (not (= ~counter~0 main_~n~0)) (= (select |#valid| 0) 0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~y~0 8) (* main_~x~0 4) (* (* main_~n~0 main_~x~0) 2)) (+ 7 (* main_~n~0 4) (* main_~n~0 main_~n~0) (* main_~y~0 main_~y~0) (* main_~x~0 main_~x~0) (* (* main_~n~0 main_~y~0) 2))) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (not (= (+ main_~n~0 main_~y~0) (+ ~counter~0 main_~x~0))) (not (= main_~n~0 8)) (not (= |#valid| (select |#memory_int| 1))) (= (select (select |#memory_int| 1) 0) 48) (not (= ~counter~0 1)) (not (= main_~y~0 main_~x~0)) (< ~counter~0 3) (= (select (select |#memory_int| 1) 1) 0) (not (= (+ 5 main_~n~0) main_~x~0)) (not (= (+ main_~x~0 14) (+ main_~n~0 main_~y~0))) (= |#NULL.base| 0) (not (= main_~n~0 3))) abstracted: 86#(and (= (select |#length| 3) 12) (not (= |#length| (select |#memory_int| 1))) (not (= 7 main_~n~0)) (not (= (+ 49 main_~x~0) (+ main_~n~0 main_~y~0))) (= 13 (select |#length| 2)) (not (= (+ main_~x~0 1) main_~n~0)) (not (= main_~n~0 14)) (= 2 (select |#length| 1)) (not (= (+ main_~x~0 2) (+ main_~n~0 main_~y~0))) (= (select |#valid| 3) 1) (not (= (* main_~n~0 2) (+ main_~x~0 2))) (not (= main_~n~0 4)) (not (= (+ main_~n~0 47) main_~x~0)) (= (+ (* (* main_~n~0 main_~x~0) 2) (* main_~y~0 main_~x~0) (* main_~y~0 3)) (+ (* main_~n~0 main_~y~0) 3 (* main_~n~0 2) (* main_~x~0 16) (* main_~n~0 main_~n~0) (* main_~x~0 main_~x~0))) (not (= (+ (* main_~x~0 2) 2) (+ main_~y~0 (* main_~n~0 2)))) (not (= |#length| |#valid|)) (= (+ main_~z~0 main_~x~0) (+ 5 main_~n~0 main_~y~0)) (not (= 49 main_~n~0)) (not (= (+ main_~x~0 1) (+ main_~n~0 main_~y~0))) (not (= ~counter~0 3)) (not (= main_~x~0 (+ main_~n~0 1))) (not (= |#StackHeapBarrier| 0)) (not (= (+ main_~x~0 4) (+ main_~n~0 main_~y~0))) (not (= main_~x~0 (+ main_~n~0 11))) (= (select |#valid| 1) 1) (not (= (+ main_~x~0 8) (+ main_~n~0 main_~y~0))) (not (= main_~n~0 13)) (not (= main_~x~0 (+ main_~n~0 2))) (= |old(~counter~0)| 0) (not (= (+ main_~x~0 3) (+ main_~n~0 main_~y~0))) (not (= (+ main_~n~0 12) main_~x~0)) (not (= ~counter~0 main_~n~0)) (= (select |#valid| 0) 0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~y~0 8) (* main_~x~0 4) (* (* main_~n~0 main_~x~0) 2)) (+ 7 (* main_~n~0 4) (* main_~n~0 main_~n~0) (* main_~y~0 main_~y~0) (* main_~x~0 main_~x~0) (* (* main_~n~0 main_~y~0) 2))) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (not (= (+ main_~n~0 main_~y~0) (+ ~counter~0 main_~x~0))) (not (= main_~n~0 8)) (not (= |#valid| (select |#memory_int| 1))) (= (select (select |#memory_int| 1) 0) 48) (not (= ~counter~0 1)) (not (= main_~y~0 main_~x~0)) (= (select (select |#memory_int| 1) 1) 0) (not (= (+ 5 main_~n~0) main_~x~0)) (not (= (+ main_~x~0 14) (+ main_~n~0 main_~y~0))) (= |#NULL.base| 0) (not (= main_~n~0 3))) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:63) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StateBasedDomain.isEqBottom(StateBasedDomain.java:112) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpretForSingleMarker(DagInterpreter.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarizeInternal(FixpointLoopSummarizer.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:98) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 11:15:16,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 11:15:16,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-04-01 11:15:16,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653804506] [2023-04-01 11:15:16,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 11:15:16,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-01 11:15:16,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:15:16,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-01 11:15:16,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-04-01 11:15:16,745 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2023-04-01 11:15:16,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:15:16,936 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2023-04-01 11:15:16,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-01 11:15:16,937 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 49 [2023-04-01 11:15:16,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:15:16,938 INFO L225 Difference]: With dead ends: 81 [2023-04-01 11:15:16,938 INFO L226 Difference]: Without dead ends: 79 [2023-04-01 11:15:16,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-04-01 11:15:16,939 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 11 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 11:15:16,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 160 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 11:15:16,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-04-01 11:15:16,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2023-04-01 11:15:16,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 40 states have internal predecessors, (41), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2023-04-01 11:15:16,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2023-04-01 11:15:16,954 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 49 [2023-04-01 11:15:16,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:15:16,955 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2023-04-01 11:15:16,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2023-04-01 11:15:16,955 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2023-04-01 11:15:16,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-04-01 11:15:16,956 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:15:16,956 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:15:16,961 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-04-01 11:15:17,157 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-04-01 11:15:17,157 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:15:17,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:15:17,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1692777595, now seen corresponding path program 3 times [2023-04-01 11:15:17,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:15:17,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115747377] [2023-04-01 11:15:17,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:15:17,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:15:17,165 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 11:15:17,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [845388994] [2023-04-01 11:15:17,165 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 11:15:17,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:15:17,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:15:17,166 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-04-01 11:15:17,169 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-04-01 11:15:17,224 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 11:15:17,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 11:15:17,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 27 conjunts are in the unsatisfiable core [2023-04-01 11:15:17,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 11:15:17,365 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 15 proven. 28 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-04-01 11:15:17,366 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 11:15:17,935 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 15 proven. 28 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-04-01 11:15:17,935 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:15:17,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115747377] [2023-04-01 11:15:17,935 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 11:15:17,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845388994] [2023-04-01 11:15:17,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845388994] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 11:15:17,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [809232362] [2023-04-01 11:15:17,937 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 11:15:17,937 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 11:15:17,937 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 11:15:17,937 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 11:15:17,937 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 11:15:17,965 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 47 for LOIs [2023-04-01 11:15:22,952 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Solver couldn't answer isBottom for original: 84#(and (= (select |#length| 3) 12) (not (= |#length| (select |#memory_int| 1))) (not (= 7 main_~n~0)) (<= main_~n~0 (+ main_~a~0 1)) (not (= (+ 49 main_~x~0) (+ main_~n~0 main_~y~0))) (= 13 (select |#length| 2)) (not (= (+ main_~x~0 1) main_~n~0)) (not (= main_~n~0 14)) (= 2 (select |#length| 1)) (not (= (+ main_~x~0 2) (+ main_~n~0 main_~y~0))) (= (select |#valid| 3) 1) (not (= (* main_~n~0 2) (+ main_~x~0 2))) (not (= main_~n~0 4)) (not (= (+ main_~n~0 47) main_~x~0)) (= (+ (* (* main_~n~0 main_~x~0) 2) (* main_~y~0 main_~x~0) (* main_~y~0 3)) (+ (* main_~n~0 main_~y~0) 3 (* main_~n~0 2) (* main_~x~0 16) (* main_~n~0 main_~n~0) (* main_~x~0 main_~x~0))) (not (= (+ (* main_~x~0 2) 2) (+ main_~y~0 (* main_~n~0 2)))) (not (= |#length| |#valid|)) (= (+ main_~z~0 main_~x~0) (+ 5 main_~n~0 main_~y~0)) (not (= 49 main_~n~0)) (not (= (+ main_~x~0 1) (+ main_~n~0 main_~y~0))) (not (= main_~x~0 (+ main_~n~0 1))) (not (= |#StackHeapBarrier| 0)) (not (= (+ main_~x~0 4) (+ main_~n~0 main_~y~0))) (not (= main_~x~0 (+ main_~n~0 11))) (= (select |#valid| 1) 1) (not (= (+ main_~x~0 8) (+ main_~n~0 main_~y~0))) (not (= main_~n~0 13)) (not (= main_~x~0 (+ main_~n~0 2))) (= |old(~counter~0)| 0) (not (= (+ main_~x~0 3) (+ main_~n~0 main_~y~0))) (not (= (+ main_~n~0 12) main_~x~0)) (not (= ~counter~0 main_~n~0)) (= (select |#valid| 0) 0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~y~0 8) (* main_~x~0 4) (* (* main_~n~0 main_~x~0) 2)) (+ 7 (* main_~n~0 4) (* main_~n~0 main_~n~0) (* main_~y~0 main_~y~0) (* main_~x~0 main_~x~0) (* (* main_~n~0 main_~y~0) 2))) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (not (= (+ main_~n~0 main_~y~0) (+ ~counter~0 main_~x~0))) (not (= main_~n~0 8)) (not (= |#valid| (select |#memory_int| 1))) (= (select (select |#memory_int| 1) 0) 48) (not (= ~counter~0 1)) (not (= main_~y~0 main_~x~0)) (< ~counter~0 3) (= (select (select |#memory_int| 1) 1) 0) (not (= (+ 5 main_~n~0) main_~x~0)) (not (= (+ main_~x~0 14) (+ main_~n~0 main_~y~0))) (= |#NULL.base| 0) (not (= main_~n~0 3))) abstracted: 86#(and (= (select |#length| 3) 12) (not (= |#length| (select |#memory_int| 1))) (not (= 7 main_~n~0)) (not (= (+ 49 main_~x~0) (+ main_~n~0 main_~y~0))) (= 13 (select |#length| 2)) (not (= (+ main_~x~0 1) main_~n~0)) (not (= main_~n~0 14)) (= 2 (select |#length| 1)) (not (= (+ main_~x~0 2) (+ main_~n~0 main_~y~0))) (= (select |#valid| 3) 1) (not (= (* main_~n~0 2) (+ main_~x~0 2))) (not (= main_~n~0 4)) (not (= (+ main_~n~0 47) main_~x~0)) (= (+ (* (* main_~n~0 main_~x~0) 2) (* main_~y~0 main_~x~0) (* main_~y~0 3)) (+ (* main_~n~0 main_~y~0) 3 (* main_~n~0 2) (* main_~x~0 16) (* main_~n~0 main_~n~0) (* main_~x~0 main_~x~0))) (not (= (+ (* main_~x~0 2) 2) (+ main_~y~0 (* main_~n~0 2)))) (not (= |#length| |#valid|)) (= (+ main_~z~0 main_~x~0) (+ 5 main_~n~0 main_~y~0)) (not (= 49 main_~n~0)) (not (= (+ main_~x~0 1) (+ main_~n~0 main_~y~0))) (not (= ~counter~0 3)) (not (= main_~x~0 (+ main_~n~0 1))) (not (= |#StackHeapBarrier| 0)) (not (= (+ main_~x~0 4) (+ main_~n~0 main_~y~0))) (not (= main_~x~0 (+ main_~n~0 11))) (= (select |#valid| 1) 1) (not (= (+ main_~x~0 8) (+ main_~n~0 main_~y~0))) (not (= main_~n~0 13)) (not (= main_~x~0 (+ main_~n~0 2))) (= |old(~counter~0)| 0) (not (= (+ main_~x~0 3) (+ main_~n~0 main_~y~0))) (not (= (+ main_~n~0 12) main_~x~0)) (not (= ~counter~0 main_~n~0)) (= (select |#valid| 0) 0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~y~0 8) (* main_~x~0 4) (* (* main_~n~0 main_~x~0) 2)) (+ 7 (* main_~n~0 4) (* main_~n~0 main_~n~0) (* main_~y~0 main_~y~0) (* main_~x~0 main_~x~0) (* (* main_~n~0 main_~y~0) 2))) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (not (= (+ main_~n~0 main_~y~0) (+ ~counter~0 main_~x~0))) (not (= main_~n~0 8)) (not (= |#valid| (select |#memory_int| 1))) (= (select (select |#memory_int| 1) 0) 48) (not (= ~counter~0 1)) (not (= main_~y~0 main_~x~0)) (= (select (select |#memory_int| 1) 1) 0) (not (= (+ 5 main_~n~0) main_~x~0)) (not (= (+ main_~x~0 14) (+ main_~n~0 main_~y~0))) (= |#NULL.base| 0) (not (= main_~n~0 3))) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:63) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StateBasedDomain.isEqBottom(StateBasedDomain.java:112) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpretForSingleMarker(DagInterpreter.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarizeInternal(FixpointLoopSummarizer.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:98) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 11:15:22,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 11:15:22,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-04-01 11:15:22,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122338251] [2023-04-01 11:15:22,953 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 11:15:22,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-01 11:15:22,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:15:22,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-01 11:15:22,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-04-01 11:15:22,955 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2023-04-01 11:15:24,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:15:24,525 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2023-04-01 11:15:24,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 11:15:24,525 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) Word has length 54 [2023-04-01 11:15:24,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:15:24,526 INFO L225 Difference]: With dead ends: 89 [2023-04-01 11:15:24,527 INFO L226 Difference]: Without dead ends: 81 [2023-04-01 11:15:24,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2023-04-01 11:15:24,527 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 23 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-04-01 11:15:24,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 108 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-04-01 11:15:24,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-04-01 11:15:24,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2023-04-01 11:15:24,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-04-01 11:15:24,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2023-04-01 11:15:24,545 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 54 [2023-04-01 11:15:24,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:15:24,545 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2023-04-01 11:15:24,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2023-04-01 11:15:24,546 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2023-04-01 11:15:24,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-04-01 11:15:24,547 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:15:24,547 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, 1, 1, 1] [2023-04-01 11:15:24,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-04-01 11:15:24,751 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-04-01 11:15:24,751 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:15:24,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:15:24,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1446194315, now seen corresponding path program 1 times [2023-04-01 11:15:24,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:15:24,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588567887] [2023-04-01 11:15:24,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:15:24,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:15:24,760 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 11:15:24,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [221156119] [2023-04-01 11:15:24,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:15:24,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:15:24,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:15:24,761 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-04-01 11:15:24,777 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-04-01 11:15:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:15:24,821 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 26 conjunts are in the unsatisfiable core [2023-04-01 11:15:24,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 11:15:24,991 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 21 proven. 39 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-04-01 11:15:24,991 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 11:15:25,136 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:15:25,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588567887] [2023-04-01 11:15:25,137 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 11:15:25,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221156119] [2023-04-01 11:15:25,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221156119] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 11:15:25,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1260698066] [2023-04-01 11:15:25,138 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-01 11:15:25,139 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 11:15:25,139 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 11:15:25,139 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 11:15:25,139 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 11:15:25,169 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 47 for LOIs [2023-04-01 11:15:30,068 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Solver couldn't answer isBottom for original: 84#(and (= (select |#length| 3) 12) (not (= |#length| (select |#memory_int| 1))) (not (= 7 main_~n~0)) (<= main_~n~0 (+ main_~a~0 1)) (not (= (+ 49 main_~x~0) (+ main_~n~0 main_~y~0))) (= 13 (select |#length| 2)) (not (= (+ main_~x~0 1) main_~n~0)) (not (= main_~n~0 14)) (= 2 (select |#length| 1)) (not (= (+ main_~x~0 2) (+ main_~n~0 main_~y~0))) (= (select |#valid| 3) 1) (not (= (* main_~n~0 2) (+ main_~x~0 2))) (not (= main_~n~0 4)) (not (= (+ main_~n~0 47) main_~x~0)) (= (+ (* (* main_~n~0 main_~x~0) 2) (* main_~y~0 main_~x~0) (* main_~y~0 3)) (+ (* main_~n~0 main_~y~0) 3 (* main_~n~0 2) (* main_~x~0 16) (* main_~n~0 main_~n~0) (* main_~x~0 main_~x~0))) (not (= (+ (* main_~x~0 2) 2) (+ main_~y~0 (* main_~n~0 2)))) (not (= |#length| |#valid|)) (= (+ main_~z~0 main_~x~0) (+ 5 main_~n~0 main_~y~0)) (not (= 49 main_~n~0)) (not (= (+ main_~x~0 1) (+ main_~n~0 main_~y~0))) (not (= main_~x~0 (+ main_~n~0 1))) (not (= |#StackHeapBarrier| 0)) (not (= (+ main_~x~0 4) (+ main_~n~0 main_~y~0))) (not (= main_~x~0 (+ main_~n~0 11))) (= (select |#valid| 1) 1) (not (= (+ main_~x~0 8) (+ main_~n~0 main_~y~0))) (not (= main_~n~0 13)) (not (= main_~x~0 (+ main_~n~0 2))) (= |old(~counter~0)| 0) (not (= (+ main_~x~0 3) (+ main_~n~0 main_~y~0))) (not (= (+ main_~n~0 12) main_~x~0)) (not (= ~counter~0 main_~n~0)) (= (select |#valid| 0) 0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~y~0 8) (* main_~x~0 4) (* (* main_~n~0 main_~x~0) 2)) (+ 7 (* main_~n~0 4) (* main_~n~0 main_~n~0) (* main_~y~0 main_~y~0) (* main_~x~0 main_~x~0) (* (* main_~n~0 main_~y~0) 2))) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (not (= (+ main_~n~0 main_~y~0) (+ ~counter~0 main_~x~0))) (not (= main_~n~0 8)) (not (= |#valid| (select |#memory_int| 1))) (= (select (select |#memory_int| 1) 0) 48) (not (= ~counter~0 1)) (not (= main_~y~0 main_~x~0)) (< ~counter~0 3) (= (select (select |#memory_int| 1) 1) 0) (not (= (+ 5 main_~n~0) main_~x~0)) (not (= (+ main_~x~0 14) (+ main_~n~0 main_~y~0))) (= |#NULL.base| 0) (not (= main_~n~0 3))) abstracted: 86#(and (= (select |#length| 3) 12) (not (= |#length| (select |#memory_int| 1))) (not (= 7 main_~n~0)) (not (= (+ 49 main_~x~0) (+ main_~n~0 main_~y~0))) (= 13 (select |#length| 2)) (not (= (+ main_~x~0 1) main_~n~0)) (not (= main_~n~0 14)) (= 2 (select |#length| 1)) (not (= (+ main_~x~0 2) (+ main_~n~0 main_~y~0))) (= (select |#valid| 3) 1) (not (= (* main_~n~0 2) (+ main_~x~0 2))) (not (= main_~n~0 4)) (not (= (+ main_~n~0 47) main_~x~0)) (= (+ (* (* main_~n~0 main_~x~0) 2) (* main_~y~0 main_~x~0) (* main_~y~0 3)) (+ (* main_~n~0 main_~y~0) 3 (* main_~n~0 2) (* main_~x~0 16) (* main_~n~0 main_~n~0) (* main_~x~0 main_~x~0))) (not (= (+ (* main_~x~0 2) 2) (+ main_~y~0 (* main_~n~0 2)))) (not (= |#length| |#valid|)) (= (+ main_~z~0 main_~x~0) (+ 5 main_~n~0 main_~y~0)) (not (= 49 main_~n~0)) (not (= (+ main_~x~0 1) (+ main_~n~0 main_~y~0))) (not (= ~counter~0 3)) (not (= main_~x~0 (+ main_~n~0 1))) (not (= |#StackHeapBarrier| 0)) (not (= (+ main_~x~0 4) (+ main_~n~0 main_~y~0))) (not (= main_~x~0 (+ main_~n~0 11))) (= (select |#valid| 1) 1) (not (= (+ main_~x~0 8) (+ main_~n~0 main_~y~0))) (not (= main_~n~0 13)) (not (= main_~x~0 (+ main_~n~0 2))) (= |old(~counter~0)| 0) (not (= (+ main_~x~0 3) (+ main_~n~0 main_~y~0))) (not (= (+ main_~n~0 12) main_~x~0)) (not (= ~counter~0 main_~n~0)) (= (select |#valid| 0) 0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~y~0 8) (* main_~x~0 4) (* (* main_~n~0 main_~x~0) 2)) (+ 7 (* main_~n~0 4) (* main_~n~0 main_~n~0) (* main_~y~0 main_~y~0) (* main_~x~0 main_~x~0) (* (* main_~n~0 main_~y~0) 2))) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (not (= (+ main_~n~0 main_~y~0) (+ ~counter~0 main_~x~0))) (not (= main_~n~0 8)) (not (= |#valid| (select |#memory_int| 1))) (= (select (select |#memory_int| 1) 0) 48) (not (= ~counter~0 1)) (not (= main_~y~0 main_~x~0)) (= (select (select |#memory_int| 1) 1) 0) (not (= (+ 5 main_~n~0) main_~x~0)) (not (= (+ main_~x~0 14) (+ main_~n~0 main_~y~0))) (= |#NULL.base| 0) (not (= main_~n~0 3))) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:63) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StateBasedDomain.isEqBottom(StateBasedDomain.java:112) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpretForSingleMarker(DagInterpreter.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarizeInternal(FixpointLoopSummarizer.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:98) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 11:15:30,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-04-01 11:15:30,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2023-04-01 11:15:30,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347072280] [2023-04-01 11:15:30,068 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-04-01 11:15:30,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-01 11:15:30,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:15:30,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-01 11:15:30,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-04-01 11:15:30,071 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2023-04-01 11:15:30,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:15:30,249 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2023-04-01 11:15:30,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 11:15:30,250 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 70 [2023-04-01 11:15:30,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:15:30,251 INFO L225 Difference]: With dead ends: 91 [2023-04-01 11:15:30,251 INFO L226 Difference]: Without dead ends: 89 [2023-04-01 11:15:30,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2023-04-01 11:15:30,252 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 13 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 11:15:30,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 81 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 11:15:30,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-04-01 11:15:30,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2023-04-01 11:15:30,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 53 states have internal predecessors, (55), 22 states have call successors, (22), 15 states have call predecessors, (22), 14 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-04-01 11:15:30,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2023-04-01 11:15:30,272 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 70 [2023-04-01 11:15:30,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:15:30,272 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2023-04-01 11:15:30,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2023-04-01 11:15:30,272 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2023-04-01 11:15:30,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-04-01 11:15:30,273 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:15:30,273 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:15:30,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-01 11:15:30,477 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-04-01 11:15:30,477 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:15:30,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:15:30,477 INFO L85 PathProgramCache]: Analyzing trace with hash 2026174256, now seen corresponding path program 2 times [2023-04-01 11:15:30,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:15:30,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374546800] [2023-04-01 11:15:30,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:15:30,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:15:30,484 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 11:15:30,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1923389947] [2023-04-01 11:15:30,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 11:15:30,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:15:30,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:15:30,488 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-04-01 11:15:30,491 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-04-01 11:15:30,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-04-01 11:15:30,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-04-01 11:15:30,577 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-04-01 11:15:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 11:15:30,623 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-04-01 11:15:30,623 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-04-01 11:15:30,624 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-01 11:15:30,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-04-01 11:15:30,831 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-04-01 11:15:30,834 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2023-04-01 11:15:30,837 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-01 11:15:30,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.04 11:15:30 BoogieIcfgContainer [2023-04-01 11:15:30,870 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-01 11:15:30,871 INFO L158 Benchmark]: Toolchain (without parser) took 35937.21ms. Allocated memory was 187.7MB in the beginning and 532.7MB in the end (delta: 345.0MB). Free memory was 136.5MB in the beginning and 318.2MB in the end (delta: -181.6MB). Peak memory consumption was 164.6MB. Max. memory is 8.0GB. [2023-04-01 11:15:30,871 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 187.7MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-01 11:15:30,871 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.82ms. Allocated memory is still 187.7MB. Free memory was 136.3MB in the beginning and 125.5MB in the end (delta: 10.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-04-01 11:15:30,871 INFO L158 Benchmark]: Boogie Preprocessor took 26.59ms. Allocated memory is still 187.7MB. Free memory was 125.5MB in the beginning and 124.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-04-01 11:15:30,871 INFO L158 Benchmark]: RCFGBuilder took 286.28ms. Allocated memory is still 187.7MB. Free memory was 124.0MB in the beginning and 111.1MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-04-01 11:15:30,872 INFO L158 Benchmark]: TraceAbstraction took 35386.22ms. Allocated memory was 187.7MB in the beginning and 532.7MB in the end (delta: 345.0MB). Free memory was 110.3MB in the beginning and 318.2MB in the end (delta: -207.8MB). Peak memory consumption was 138.4MB. Max. memory is 8.0GB. [2023-04-01 11:15:30,872 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.16ms. Allocated memory is still 187.7MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 229.82ms. Allocated memory is still 187.7MB. Free memory was 136.3MB in the beginning and 125.5MB in the end (delta: 10.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.59ms. Allocated memory is still 187.7MB. Free memory was 125.5MB in the beginning and 124.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 286.28ms. Allocated memory is still 187.7MB. Free memory was 124.0MB in the beginning and 111.1MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 35386.22ms. Allocated memory was 187.7MB in the beginning and 532.7MB in the end (delta: 345.0MB). Free memory was 110.3MB in the beginning and 318.2MB in the end (delta: -207.8MB). Peak memory consumption was 138.4MB. Max. memory is 8.0GB. * 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; [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 [\old(counter)=0, a=2, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [\old(counter)=0, a=2, counter++=0, counter=1, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<2 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=2, 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, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=2, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=2, 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, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=2, 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, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=2, 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 [\old(counter)=0, a=2, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [\old(counter)=0, a=2, counter++=1, counter=2, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<2 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=2, 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, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=2, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=2, 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, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=2, 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, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=2, 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 [\old(counter)=0, a=2, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [\old(counter)=0, a=2, counter++=2, counter=3, n=2, x=8, y=19, z=18] [L33] COND FALSE !(counter++<2) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [\old(counter)=0, a=2, counter=3, n=2, x=8, y=19, z=18] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, \old(counter)=0, counter=3] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.3s, OverallIterations: 10, TraceHistogramMax: 12, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 131 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 96 mSDsluCounter, 761 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 471 mSDsCounter, 154 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1117 IncrementalHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 154 mSolverCounterUnsat, 290 mSDtfsCounter, 1117 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 650 GetRequests, 526 SyntacticMatches, 4 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=9, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 28 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 381 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 502 ConstructedInterpolants, 0 QuantifiedInterpolants, 2008 SizeOfPredicates, 14 NumberOfNonLiveVariables, 797 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 880/1028 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: OVERALL_TIME: 0.6s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 4, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 14, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 12, TOOLS_POST_TIME: 0.1s, TOOLS_POST_CALL_APPLICATIONS: 8, TOOLS_POST_CALL_TIME: 0.1s, TOOLS_POST_RETURN_APPLICATIONS: 4, TOOLS_POST_RETURN_TIME: 0.1s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 24, TOOLS_QUANTIFIERELIM_TIME: 0.3s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.0s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 41, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 5, DOMAIN_JOIN_TIME: 0.2s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 14, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 4, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 80, DAG_COMPRESSION_RETAINED_NODES: 49, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-04-01 11:15:30,889 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...