/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 OctagonDomain -i ../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 23:20:31,178 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 23:20:31,179 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 23:20:31,212 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 23:20:31,212 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 23:20:31,215 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 23:20:31,217 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 23:20:31,219 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 23:20:31,221 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 23:20:31,225 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 23:20:31,226 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 23:20:31,228 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 23:20:31,228 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 23:20:31,230 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 23:20:31,232 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 23:20:31,233 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 23:20:31,233 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 23:20:31,235 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 23:20:31,236 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 23:20:31,241 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 23:20:31,242 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 23:20:31,243 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 23:20:31,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 23:20:31,245 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 23:20:31,252 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 23:20:31,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 23:20:31,253 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 23:20:31,254 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 23:20:31,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 23:20:31,255 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 23:20:31,256 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 23:20:31,256 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 23:20:31,257 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 23:20:31,258 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 23:20:31,259 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 23:20:31,259 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 23:20:31,259 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 23:20:31,259 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 23:20:31,260 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 23:20:31,260 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 23:20:31,261 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 23:20:31,261 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-02 23:20:31,294 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 23:20:31,294 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 23:20:31,294 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 23:20:31,295 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 23:20:31,295 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 23:20:31,295 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 23:20:31,296 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-02 23:20:31,296 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-02 23:20:31,296 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-02 23:20:31,296 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-02 23:20:31,297 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-02 23:20:31,297 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-02 23:20:31,297 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-02 23:20:31,297 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-02 23:20:31,297 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-02 23:20:31,297 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-02 23:20:31,297 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-02 23:20:31,297 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-02 23:20:31,298 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 23:20:31,299 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 23:20:31,299 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 23:20:31,299 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 23:20:31,300 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 23:20:31,300 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 23:20:31,300 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 23:20:31,300 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 23:20:31,300 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 23:20:31,300 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 23:20:31,300 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 23:20:31,300 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 23:20:31,301 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 23:20:31,301 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 23:20:31,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 23:20:31,301 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 23:20:31,301 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-02 23:20:31,301 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 23:20:31,301 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 23:20:31,302 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-02 23:20:31,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 23:20:31,302 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 23:20:31,302 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-02 23:20:31,302 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 -> OctagonDomain [2023-04-02 23:20:31,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 23:20:31,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 23:20:31,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 23:20:31,561 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 23:20:31,561 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 23:20:31,562 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound50.c [2023-04-02 23:20:32,687 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 23:20:32,850 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 23:20:32,850 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound50.c [2023-04-02 23:20:32,856 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfc4cd6f7/0a59c37f09e0454194a850ad60a8f86d/FLAG768f232af [2023-04-02 23:20:32,867 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfc4cd6f7/0a59c37f09e0454194a850ad60a8f86d [2023-04-02 23:20:32,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 23:20:32,871 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 23:20:32,874 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 23:20:32,874 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 23:20:32,880 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 23:20:32,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 11:20:32" (1/1) ... [2023-04-02 23:20:32,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77006259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 11:20:32, skipping insertion in model container [2023-04-02 23:20:32,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 11:20:32" (1/1) ... [2023-04-02 23:20:32,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 23:20:32,899 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 23:20:33,016 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/mannadiv_unwindbound50.c[573,586] [2023-04-02 23:20:33,035 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 23:20:33,044 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 23:20:33,056 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/mannadiv_unwindbound50.c[573,586] [2023-04-02 23:20:33,060 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 23:20:33,070 INFO L208 MainTranslator]: Completed translation [2023-04-02 23:20:33,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 11:20:33 WrapperNode [2023-04-02 23:20:33,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 23:20:33,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 23:20:33,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 23:20:33,072 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 23:20:33,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 11:20:33" (1/1) ... [2023-04-02 23:20:33,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 11:20:33" (1/1) ... [2023-04-02 23:20:33,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 11:20:33" (1/1) ... [2023-04-02 23:20:33,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 11:20:33" (1/1) ... [2023-04-02 23:20:33,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 11:20:33" (1/1) ... [2023-04-02 23:20:33,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 11:20:33" (1/1) ... [2023-04-02 23:20:33,092 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 11:20:33" (1/1) ... [2023-04-02 23:20:33,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 11:20:33" (1/1) ... [2023-04-02 23:20:33,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 23:20:33,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 23:20:33,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 23:20:33,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 23:20:33,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 11:20:33" (1/1) ... [2023-04-02 23:20:33,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 23:20:33,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 23:20:33,119 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-02 23:20:33,123 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-02 23:20:33,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 23:20:33,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 23:20:33,155 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 23:20:33,157 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-04-02 23:20:33,157 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-04-02 23:20:33,157 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 23:20:33,157 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 23:20:33,157 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 23:20:33,157 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 23:20:33,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 23:20:33,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-02 23:20:33,158 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-04-02 23:20:33,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-04-02 23:20:33,158 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 23:20:33,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 23:20:33,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 23:20:33,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 23:20:33,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 23:20:33,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 23:20:33,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 23:20:33,222 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 23:20:33,225 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 23:20:33,380 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 23:20:33,423 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 23:20:33,423 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-04-02 23:20:33,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 11:20:33 BoogieIcfgContainer [2023-04-02 23:20:33,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 23:20:33,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 23:20:33,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 23:20:33,429 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 23:20:33,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 11:20:32" (1/3) ... [2023-04-02 23:20:33,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c43f0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 11:20:33, skipping insertion in model container [2023-04-02 23:20:33,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 11:20:33" (2/3) ... [2023-04-02 23:20:33,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c43f0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 11:20:33, skipping insertion in model container [2023-04-02 23:20:33,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 11:20:33" (3/3) ... [2023-04-02 23:20:33,432 INFO L112 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound50.c [2023-04-02 23:20:33,450 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 23:20:33,450 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-02 23:20:33,493 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 23:20:33,499 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;@6bd13316, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-02 23:20:33,499 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-02 23:20:33,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-02 23:20:33,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-04-02 23:20:33,509 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 23:20:33,510 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 23:20:33,510 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 23:20:33,514 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 23:20:33,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1539655439, now seen corresponding path program 1 times [2023-04-02 23:20:33,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 23:20:33,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609248299] [2023-04-02 23:20:33,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 23:20:33,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 23:20:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 23:20:33,640 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 23:20:33,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609248299] [2023-04-02 23:20:33,641 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-04-02 23:20:33,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666827755] [2023-04-02 23:20:33,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 23:20:33,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 23:20:33,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 23:20:33,643 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-02 23:20:33,645 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-02 23:20:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 23:20:33,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 1 conjunts are in the unsatisfiable core [2023-04-02 23:20:33,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 23:20:33,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 23:20:33,771 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 23:20:33,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666827755] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 23:20:33,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 23:20:33,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-04-02 23:20:33,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161425998] [2023-04-02 23:20:33,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 23:20:33,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-04-02 23:20:33,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 23:20:33,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-04-02 23:20:33,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-04-02 23:20:33,827 INFO L87 Difference]: Start difference. First operand has 25 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-02 23:20:33,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 23:20:33,850 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2023-04-02 23:20:33,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-04-02 23:20:33,855 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 17 [2023-04-02 23:20:33,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 23:20:33,861 INFO L225 Difference]: With dead ends: 40 [2023-04-02 23:20:33,862 INFO L226 Difference]: Without dead ends: 21 [2023-04-02 23:20:33,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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-02 23:20:33,867 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 23:20:33,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 23:20:33,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-04-02 23:20:33,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-04-02 23:20:33,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 23:20:33,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2023-04-02 23:20:33,899 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 17 [2023-04-02 23:20:33,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 23:20:33,900 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2023-04-02 23:20:33,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-02 23:20:33,901 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2023-04-02 23:20:33,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-04-02 23:20:33,902 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 23:20:33,902 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 23:20:33,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-04-02 23:20:34,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-04-02 23:20:34,108 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 23:20:34,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 23:20:34,108 INFO L85 PathProgramCache]: Analyzing trace with hash -98483365, now seen corresponding path program 1 times [2023-04-02 23:20:34,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 23:20:34,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132607559] [2023-04-02 23:20:34,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 23:20:34,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 23:20:34,125 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 23:20:34,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [663259831] [2023-04-02 23:20:34,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 23:20:34,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 23:20:34,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 23:20:34,127 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-02 23:20:34,136 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-02 23:20:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 23:20:34,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-02 23:20:34,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 23:20:34,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 23:20:34,262 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 23:20:34,262 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 23:20:34,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132607559] [2023-04-02 23:20:34,263 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 23:20:34,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663259831] [2023-04-02 23:20:34,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663259831] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 23:20:34,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 23:20:34,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-02 23:20:34,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616193556] [2023-04-02 23:20:34,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 23:20:34,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-02 23:20:34,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 23:20:34,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-02 23:20:34,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-02 23:20:34,266 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-04-02 23:20:34,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 23:20:34,283 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2023-04-02 23:20:34,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-04-02 23:20:34,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 18 [2023-04-02 23:20:34,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 23:20:34,285 INFO L225 Difference]: With dead ends: 30 [2023-04-02 23:20:34,285 INFO L226 Difference]: Without dead ends: 23 [2023-04-02 23:20:34,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 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-02 23:20:34,286 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 23:20:34,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 23:20:34,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-04-02 23:20:34,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-04-02 23:20:34,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 23:20:34,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-04-02 23:20:34,293 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 18 [2023-04-02 23:20:34,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 23:20:34,293 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-04-02 23:20:34,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-04-02 23:20:34,294 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-04-02 23:20:34,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-04-02 23:20:34,294 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 23:20:34,295 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 23:20:34,306 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-02 23:20:34,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-04-02 23:20:34,496 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 23:20:34,496 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 23:20:34,497 INFO L85 PathProgramCache]: Analyzing trace with hash -96695905, now seen corresponding path program 1 times [2023-04-02 23:20:34,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 23:20:34,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862601049] [2023-04-02 23:20:34,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 23:20:34,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 23:20:34,513 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 23:20:34,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [177478253] [2023-04-02 23:20:34,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 23:20:34,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 23:20:34,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 23:20:34,515 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-02 23:20:34,528 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-02 23:20:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 23:20:34,578 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 24 conjunts are in the unsatisfiable core [2023-04-02 23:20:34,581 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 23:20:34,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 23:20:34,839 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 23:20:34,839 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 23:20:34,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862601049] [2023-04-02 23:20:34,839 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 23:20:34,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177478253] [2023-04-02 23:20:34,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177478253] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 23:20:34,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 23:20:34,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-04-02 23:20:34,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260892866] [2023-04-02 23:20:34,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 23:20:34,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-02 23:20:34,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 23:20:34,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-02 23:20:34,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-04-02 23:20:34,846 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 9 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-02 23:20:34,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 23:20:34,949 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2023-04-02 23:20:34,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-02 23:20:34,949 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 18 [2023-04-02 23:20:34,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 23:20:34,952 INFO L225 Difference]: With dead ends: 32 [2023-04-02 23:20:34,952 INFO L226 Difference]: Without dead ends: 30 [2023-04-02 23:20:34,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-04-02 23:20:34,956 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 23:20:34,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 62 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 23:20:34,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-04-02 23:20:34,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2023-04-02 23:20:34,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-02 23:20:34,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-04-02 23:20:34,979 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 18 [2023-04-02 23:20:34,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 23:20:34,980 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-04-02 23:20:34,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-02 23:20:34,980 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2023-04-02 23:20:34,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-04-02 23:20:34,981 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 23:20:34,982 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 23:20:34,990 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-02 23:20:35,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 23:20:35,187 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 23:20:35,188 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 23:20:35,188 INFO L85 PathProgramCache]: Analyzing trace with hash -353290452, now seen corresponding path program 1 times [2023-04-02 23:20:35,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 23:20:35,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833103991] [2023-04-02 23:20:35,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 23:20:35,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 23:20:35,204 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 23:20:35,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1533435869] [2023-04-02 23:20:35,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 23:20:35,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 23:20:35,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 23:20:35,206 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-02 23:20:35,225 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-02 23:20:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 23:20:35,262 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 19 conjunts are in the unsatisfiable core [2023-04-02 23:20:35,265 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 23:20:35,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 23:20:35,399 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 23:20:35,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 23:20:35,514 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 23:20:35,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833103991] [2023-04-02 23:20:35,515 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 23:20:35,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533435869] [2023-04-02 23:20:35,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533435869] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 23:20:35,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1085686548] [2023-04-02 23:20:35,532 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-02 23:20:35,532 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 23:20:35,541 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 23:20:35,546 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 23:20:35,546 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 23:20:35,628 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 13 for LOIs [2023-04-02 23:20:35,961 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 13 for LOIs [2023-04-02 23:20:35,967 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 11 for LOIs [2023-04-02 23:20:35,969 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 23:20:35,978 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 23:20:36,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1085686548] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 23:20:36,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-04-02 23:20:36,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [11, 7] total 28 [2023-04-02 23:20:36,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084452084] [2023-04-02 23:20:36,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 23:20:36,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-04-02 23:20:36,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 23:20:36,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-04-02 23:20:36,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2023-04-02 23:20:36,532 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 23:20:37,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 23:20:37,115 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2023-04-02 23:20:37,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-02 23:20:37,115 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 24 [2023-04-02 23:20:37,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 23:20:37,116 INFO L225 Difference]: With dead ends: 36 [2023-04-02 23:20:37,116 INFO L226 Difference]: Without dead ends: 29 [2023-04-02 23:20:37,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=179, Invalid=1011, Unknown=0, NotChecked=0, Total=1190 [2023-04-02 23:20:37,117 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 17 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 23:20:37,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 15 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 23:20:37,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-04-02 23:20:37,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-04-02 23:20:37,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-02 23:20:37,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2023-04-02 23:20:37,125 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 24 [2023-04-02 23:20:37,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 23:20:37,125 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2023-04-02 23:20:37,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 23:20:37,126 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2023-04-02 23:20:37,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-04-02 23:20:37,126 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 23:20:37,126 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 23:20:37,136 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-02 23:20:37,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 23:20:37,327 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 23:20:37,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 23:20:37,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1507720734, now seen corresponding path program 1 times [2023-04-02 23:20:37,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 23:20:37,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391159868] [2023-04-02 23:20:37,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 23:20:37,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 23:20:37,340 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 23:20:37,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1009576689] [2023-04-02 23:20:37,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 23:20:37,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 23:20:37,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 23:20:37,349 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-02 23:20:37,368 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-02 23:20:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 23:20:37,396 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2023-04-02 23:20:37,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 23:20:37,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 23:20:37,434 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 23:20:37,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 23:20:37,478 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 23:20:37,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391159868] [2023-04-02 23:20:37,478 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 23:20:37,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009576689] [2023-04-02 23:20:37,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009576689] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 23:20:37,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1015463207] [2023-04-02 23:20:37,481 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-02 23:20:37,481 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 23:20:37,482 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 23:20:37,482 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 23:20:37,483 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 23:20:37,530 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 13 for LOIs [2023-04-02 23:20:38,406 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2023-04-02 23:20:38,442 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 11 for LOIs [2023-04-02 23:20:38,444 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 23:20:38,449 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 23:20:39,332 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '889#(and (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (or (and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (<= ~counter~0 2147483648) (= |#NULL.offset| 0) (= |#NULL.base| 0)) (and (<= 1 |#StackHeapBarrier|) (<= ~counter~0 2147483649) (<= 51 ~counter~0) (= |#NULL.offset| 0) (= |#NULL.base| 0))))' at error location [2023-04-02 23:20:39,332 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 23:20:39,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 23:20:39,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-04-02 23:20:39,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974366963] [2023-04-02 23:20:39,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 23:20:39,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-02 23:20:39,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 23:20:39,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-02 23:20:39,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2023-04-02 23:20:39,335 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2023-04-02 23:20:39,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 23:20:39,411 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2023-04-02 23:20:39,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-02 23:20:39,411 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 26 [2023-04-02 23:20:39,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 23:20:39,412 INFO L225 Difference]: With dead ends: 60 [2023-04-02 23:20:39,412 INFO L226 Difference]: Without dead ends: 53 [2023-04-02 23:20:39,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2023-04-02 23:20:39,414 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 25 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 23:20:39,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 68 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 23:20:39,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-04-02 23:20:39,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2023-04-02 23:20:39,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-02 23:20:39,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2023-04-02 23:20:39,429 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 26 [2023-04-02 23:20:39,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 23:20:39,429 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2023-04-02 23:20:39,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2023-04-02 23:20:39,429 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2023-04-02 23:20:39,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-04-02 23:20:39,430 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 23:20:39,430 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 23:20:39,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-02 23:20:39,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 23:20:39,637 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 23:20:39,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 23:20:39,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1509508194, now seen corresponding path program 1 times [2023-04-02 23:20:39,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 23:20:39,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337561474] [2023-04-02 23:20:39,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 23:20:39,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 23:20:39,647 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 23:20:39,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [723826624] [2023-04-02 23:20:39,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 23:20:39,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 23:20:39,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 23:20:39,651 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-02 23:20:39,655 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-02 23:20:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 23:20:39,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 23 conjunts are in the unsatisfiable core [2023-04-02 23:20:39,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 23:20:39,899 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 23:20:39,899 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 23:20:40,022 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 23:20:40,022 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 23:20:40,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337561474] [2023-04-02 23:20:40,025 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 23:20:40,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723826624] [2023-04-02 23:20:40,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723826624] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 23:20:40,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1468666011] [2023-04-02 23:20:40,030 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-04-02 23:20:40,030 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 23:20:40,030 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 23:20:40,030 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 23:20:40,031 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 23:20:40,052 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 13 for LOIs [2023-04-02 23:20:40,843 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 72 for LOIs [2023-04-02 23:20:40,906 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 11 for LOIs [2023-04-02 23:20:40,907 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 23:20:40,911 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 23:20:41,800 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1233#(and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (<= ~counter~0 2147483648) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 23:20:41,800 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 23:20:41,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 23:20:41,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 13 [2023-04-02 23:20:41,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359157329] [2023-04-02 23:20:41,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 23:20:41,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-02 23:20:41,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 23:20:41,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-02 23:20:41,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2023-04-02 23:20:41,802 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-04-02 23:20:41,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 23:20:41,956 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2023-04-02 23:20:41,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-02 23:20:41,965 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 26 [2023-04-02 23:20:41,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 23:20:41,968 INFO L225 Difference]: With dead ends: 63 [2023-04-02 23:20:41,968 INFO L226 Difference]: Without dead ends: 55 [2023-04-02 23:20:41,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2023-04-02 23:20:41,971 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 23:20:41,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 121 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 23:20:41,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-04-02 23:20:41,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2023-04-02 23:20:41,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-02 23:20:41,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2023-04-02 23:20:41,989 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 26 [2023-04-02 23:20:41,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 23:20:41,989 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2023-04-02 23:20:41,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-04-02 23:20:41,989 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2023-04-02 23:20:41,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-04-02 23:20:41,990 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 23:20:41,990 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 23:20:41,998 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-02 23:20:42,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 23:20:42,195 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 23:20:42,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 23:20:42,196 INFO L85 PathProgramCache]: Analyzing trace with hash 538547119, now seen corresponding path program 1 times [2023-04-02 23:20:42,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 23:20:42,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306760129] [2023-04-02 23:20:42,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 23:20:42,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 23:20:42,205 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 23:20:42,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2103911390] [2023-04-02 23:20:42,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 23:20:42,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 23:20:42,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 23:20:42,207 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-02 23:20:42,210 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-02 23:20:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 23:20:42,249 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 19 conjunts are in the unsatisfiable core [2023-04-02 23:20:42,251 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 23:20:42,381 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-02 23:20:42,381 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 23:20:42,466 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-02 23:20:42,466 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 23:20:42,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306760129] [2023-04-02 23:20:42,466 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 23:20:42,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103911390] [2023-04-02 23:20:42,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103911390] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 23:20:42,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [795635031] [2023-04-02 23:20:42,468 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-02 23:20:42,469 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 23:20:42,469 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 23:20:42,469 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 23:20:42,469 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 23:20:42,485 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 13 for LOIs [2023-04-02 23:20:43,194 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 19 for LOIs [2023-04-02 23:20:43,201 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 11 for LOIs [2023-04-02 23:20:43,202 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 23:20:43,205 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 23:20:43,967 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1617#(and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (<= ~counter~0 2147483648) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-02 23:20:43,967 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 23:20:43,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 23:20:43,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2023-04-02 23:20:43,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440390817] [2023-04-02 23:20:43,968 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 23:20:43,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-02 23:20:43,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 23:20:43,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-02 23:20:43,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2023-04-02 23:20:43,969 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 14 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-04-02 23:20:44,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 23:20:44,100 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2023-04-02 23:20:44,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-02 23:20:44,101 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 32 [2023-04-02 23:20:44,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 23:20:44,101 INFO L225 Difference]: With dead ends: 55 [2023-04-02 23:20:44,101 INFO L226 Difference]: Without dead ends: 49 [2023-04-02 23:20:44,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2023-04-02 23:20:44,103 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 13 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 23:20:44,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 93 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 23:20:44,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-04-02 23:20:44,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-04-02 23:20:44,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-02 23:20:44,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2023-04-02 23:20:44,111 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 32 [2023-04-02 23:20:44,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 23:20:44,112 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2023-04-02 23:20:44,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-04-02 23:20:44,113 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2023-04-02 23:20:44,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-04-02 23:20:44,113 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 23:20:44,114 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 23:20:44,120 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-02 23:20:44,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 23:20:44,317 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 23:20:44,317 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 23:20:44,317 INFO L85 PathProgramCache]: Analyzing trace with hash -548963225, now seen corresponding path program 2 times [2023-04-02 23:20:44,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 23:20:44,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614837074] [2023-04-02 23:20:44,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 23:20:44,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 23:20:44,328 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 23:20:44,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [53032016] [2023-04-02 23:20:44,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 23:20:44,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 23:20:44,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 23:20:44,332 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 23:20:44,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-02 23:20:44,384 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-04-02 23:20:44,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 23:20:44,386 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 13 conjunts are in the unsatisfiable core [2023-04-02 23:20:44,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 23:20:44,456 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 23:20:44,456 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 23:20:44,544 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-04-02 23:20:44,545 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 23:20:44,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614837074] [2023-04-02 23:20:44,545 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 23:20:44,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53032016] [2023-04-02 23:20:44,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53032016] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 23:20:44,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [16658804] [2023-04-02 23:20:44,547 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-02 23:20:44,547 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 23:20:44,547 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 23:20:44,547 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 23:20:44,547 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 23:20:44,563 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 13 for LOIs [2023-04-02 23:20:45,209 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2023-04-02 23:20:45,227 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 11 for LOIs [2023-04-02 23:20:45,229 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 23:20:45,232 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 23:20:45,924 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2102#(and (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (or (and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (<= ~counter~0 2147483648) (= |#NULL.offset| 0) (= |#NULL.base| 0)) (and (<= 1 |#StackHeapBarrier|) (<= ~counter~0 2147483649) (<= 51 ~counter~0) (= |#NULL.offset| 0) (= |#NULL.base| 0))))' at error location [2023-04-02 23:20:45,925 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 23:20:45,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 23:20:45,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-04-02 23:20:45,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177208032] [2023-04-02 23:20:45,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 23:20:45,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-02 23:20:45,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 23:20:45,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-02 23:20:45,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=634, Unknown=0, NotChecked=0, Total=812 [2023-04-02 23:20:45,926 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2023-04-02 23:20:46,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 23:20:46,102 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2023-04-02 23:20:46,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-04-02 23:20:46,103 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 50 [2023-04-02 23:20:46,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 23:20:46,104 INFO L225 Difference]: With dead ends: 102 [2023-04-02 23:20:46,104 INFO L226 Difference]: Without dead ends: 97 [2023-04-02 23:20:46,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=291, Invalid=1115, Unknown=0, NotChecked=0, Total=1406 [2023-04-02 23:20:46,105 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 29 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 23:20:46,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 82 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 23:20:46,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-04-02 23:20:46,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-04-02 23:20:46,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-04-02 23:20:46,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2023-04-02 23:20:46,119 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 50 [2023-04-02 23:20:46,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 23:20:46,119 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2023-04-02 23:20:46,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2023-04-02 23:20:46,120 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2023-04-02 23:20:46,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-04-02 23:20:46,126 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 23:20:46,127 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 23:20:46,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-04-02 23:20:46,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-04-02 23:20:46,332 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 23:20:46,333 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 23:20:46,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1194371079, now seen corresponding path program 3 times [2023-04-02 23:20:46,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 23:20:46,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663391726] [2023-04-02 23:20:46,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 23:20:46,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 23:20:46,360 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 23:20:46,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2006760304] [2023-04-02 23:20:46,361 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-02 23:20:46,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 23:20:46,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 23:20:46,363 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 23:20:46,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-04-02 23:20:46,434 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-02 23:20:46,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 23:20:46,436 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 25 conjunts are in the unsatisfiable core [2023-04-02 23:20:46,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 23:20:46,625 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 23:20:46,625 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 23:20:46,883 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 20 proven. 200 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2023-04-02 23:20:46,883 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 23:20:46,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663391726] [2023-04-02 23:20:46,884 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 23:20:46,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006760304] [2023-04-02 23:20:46,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006760304] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 23:20:46,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [680165057] [2023-04-02 23:20:46,886 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-02 23:20:46,886 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 23:20:46,886 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 23:20:46,886 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 23:20:46,886 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 23:20:46,908 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 13 for LOIs [2023-04-02 23:20:47,480 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2023-04-02 23:20:47,496 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 11 for LOIs [2023-04-02 23:20:47,497 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 23:20:47,501 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 23:20:48,303 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3027#(and (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (or (and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (<= ~counter~0 2147483648) (= |#NULL.offset| 0) (= |#NULL.base| 0)) (and (<= 1 |#StackHeapBarrier|) (<= ~counter~0 2147483649) (<= 51 ~counter~0) (= |#NULL.offset| 0) (= |#NULL.base| 0))))' at error location [2023-04-02 23:20:48,304 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 23:20:48,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 23:20:48,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-04-02 23:20:48,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958936141] [2023-04-02 23:20:48,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 23:20:48,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-04-02 23:20:48,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 23:20:48,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-04-02 23:20:48,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=1180, Unknown=0, NotChecked=0, Total=1640 [2023-04-02 23:20:48,306 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2023-04-02 23:20:48,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 23:20:48,787 INFO L93 Difference]: Finished difference Result 198 states and 210 transitions. [2023-04-02 23:20:48,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-04-02 23:20:48,788 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) Word has length 98 [2023-04-02 23:20:48,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 23:20:48,789 INFO L225 Difference]: With dead ends: 198 [2023-04-02 23:20:48,789 INFO L226 Difference]: Without dead ends: 193 [2023-04-02 23:20:48,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1150 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=975, Invalid=2807, Unknown=0, NotChecked=0, Total=3782 [2023-04-02 23:20:48,790 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 86 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 23:20:48,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 135 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 23:20:48,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-04-02 23:20:48,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2023-04-02 23:20:48,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 141 states have (on average 1.0070921985815602) internal successors, (142), 141 states have internal predecessors, (142), 27 states have call successors, (27), 26 states have call predecessors, (27), 24 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-04-02 23:20:48,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2023-04-02 23:20:48,812 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 98 [2023-04-02 23:20:48,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 23:20:48,812 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2023-04-02 23:20:48,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2023-04-02 23:20:48,812 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2023-04-02 23:20:48,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2023-04-02 23:20:48,814 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 23:20:48,815 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 23:20:48,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-04-02 23:20:49,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 23:20:49,021 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 23:20:49,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 23:20:49,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1896778525, now seen corresponding path program 4 times [2023-04-02 23:20:49,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 23:20:49,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790965689] [2023-04-02 23:20:49,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 23:20:49,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 23:20:49,035 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 23:20:49,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1450426074] [2023-04-02 23:20:49,035 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-02 23:20:49,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 23:20:49,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 23:20:49,043 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 23:20:49,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-04-02 23:20:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 23:20:49,142 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 49 conjunts are in the unsatisfiable core [2023-04-02 23:20:49,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 23:20:49,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1938 backedges. 44 proven. 1892 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 23:20:49,541 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 23:20:50,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1938 backedges. 44 proven. 968 refuted. 0 times theorem prover too weak. 926 trivial. 0 not checked. [2023-04-02 23:20:50,289 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 23:20:50,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790965689] [2023-04-02 23:20:50,290 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 23:20:50,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450426074] [2023-04-02 23:20:50,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450426074] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 23:20:50,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1354044581] [2023-04-02 23:20:50,292 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-02 23:20:50,292 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 23:20:50,292 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 23:20:50,292 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 23:20:50,292 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 23:20:50,307 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 13 for LOIs [2023-04-02 23:20:50,856 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2023-04-02 23:20:50,868 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 11 for LOIs [2023-04-02 23:20:50,868 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 23:20:50,871 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 23:20:51,739 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4840#(and (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (or (and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (<= ~counter~0 2147483648) (= |#NULL.offset| 0) (= |#NULL.base| 0)) (and (<= 1 |#StackHeapBarrier|) (<= ~counter~0 2147483649) (<= 51 ~counter~0) (= |#NULL.offset| 0) (= |#NULL.base| 0))))' at error location [2023-04-02 23:20:51,739 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 23:20:51,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 23:20:51,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-04-02 23:20:51,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520589158] [2023-04-02 23:20:51,739 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 23:20:51,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-04-02 23:20:51,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 23:20:51,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-04-02 23:20:51,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1456, Invalid=2704, Unknown=0, NotChecked=0, Total=4160 [2023-04-02 23:20:51,743 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand has 50 states, 50 states have (on average 4.32) internal successors, (216), 50 states have internal predecessors, (216), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2023-04-02 23:20:53,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 23:20:53,116 INFO L93 Difference]: Finished difference Result 390 states and 414 transitions. [2023-04-02 23:20:53,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-04-02 23:20:53,117 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.32) internal successors, (216), 50 states have internal predecessors, (216), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) Word has length 194 [2023-04-02 23:20:53,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 23:20:53,120 INFO L225 Difference]: With dead ends: 390 [2023-04-02 23:20:53,120 INFO L226 Difference]: Without dead ends: 385 [2023-04-02 23:20:53,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 517 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3052 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3639, Invalid=8351, Unknown=0, NotChecked=0, Total=11990 [2023-04-02 23:20:53,124 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 284 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-02 23:20:53,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 185 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-02 23:20:53,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2023-04-02 23:20:53,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2023-04-02 23:20:53,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 285 states have (on average 1.0035087719298246) internal successors, (286), 285 states have internal predecessors, (286), 51 states have call successors, (51), 50 states have call predecessors, (51), 48 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2023-04-02 23:20:53,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 386 transitions. [2023-04-02 23:20:53,161 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 386 transitions. Word has length 194 [2023-04-02 23:20:53,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 23:20:53,162 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 386 transitions. [2023-04-02 23:20:53,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.32) internal successors, (216), 50 states have internal predecessors, (216), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2023-04-02 23:20:53,162 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 386 transitions. [2023-04-02 23:20:53,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2023-04-02 23:20:53,167 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 23:20:53,167 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 23:20:53,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-04-02 23:20:53,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-04-02 23:20:53,376 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 23:20:53,376 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 23:20:53,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1898635621, now seen corresponding path program 5 times [2023-04-02 23:20:53,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 23:20:53,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094199889] [2023-04-02 23:20:53,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 23:20:53,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 23:20:53,400 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 23:20:53,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [732402742] [2023-04-02 23:20:53,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 23:20:53,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 23:20:53,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 23:20:53,401 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 23:20:53,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-04-02 23:20:53,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2023-04-02 23:20:53,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 23:20:53,765 INFO L262 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 97 conjunts are in the unsatisfiable core [2023-04-02 23:20:53,772 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 23:20:54,881 INFO L134 CoverageAnalysis]: Checked inductivity of 8466 backedges. 92 proven. 8372 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 23:20:54,882 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 23:20:55,972 INFO L134 CoverageAnalysis]: Checked inductivity of 8466 backedges. 92 proven. 4232 refuted. 0 times theorem prover too weak. 4142 trivial. 0 not checked. [2023-04-02 23:20:55,972 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 23:20:55,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094199889] [2023-04-02 23:20:55,972 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 23:20:55,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732402742] [2023-04-02 23:20:55,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732402742] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 23:20:55,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [469202245] [2023-04-02 23:20:55,974 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-02 23:20:55,974 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 23:20:55,975 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 23:20:55,975 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 23:20:55,975 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 23:20:55,998 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 13 for LOIs [2023-04-02 23:20:56,502 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2023-04-02 23:20:56,518 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 11 for LOIs [2023-04-02 23:20:56,519 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 23:20:56,522 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 23:20:57,478 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8385#(and (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (or (and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (<= ~counter~0 2147483648) (= |#NULL.offset| 0) (= |#NULL.base| 0)) (and (<= 1 |#StackHeapBarrier|) (<= ~counter~0 2147483649) (<= 51 ~counter~0) (= |#NULL.offset| 0) (= |#NULL.base| 0))))' at error location [2023-04-02 23:20:57,479 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 23:20:57,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 23:20:57,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 54 [2023-04-02 23:20:57,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257108866] [2023-04-02 23:20:57,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 23:20:57,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-04-02 23:20:57,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 23:20:57,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-04-02 23:20:57,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1678, Invalid=3014, Unknown=0, NotChecked=0, Total=4692 [2023-04-02 23:20:57,483 INFO L87 Difference]: Start difference. First operand 385 states and 386 transitions. Second operand has 54 states, 54 states have (on average 5.611111111111111) internal successors, (303), 54 states have internal predecessors, (303), 52 states have call successors, (100), 49 states have call predecessors, (100), 48 states have return successors, (98), 50 states have call predecessors, (98), 51 states have call successors, (98) [2023-04-02 23:20:58,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 23:20:58,883 INFO L93 Difference]: Finished difference Result 422 states and 426 transitions. [2023-04-02 23:20:58,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-04-02 23:20:58,884 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.611111111111111) internal successors, (303), 54 states have internal predecessors, (303), 52 states have call successors, (100), 49 states have call predecessors, (100), 48 states have return successors, (98), 50 states have call predecessors, (98), 51 states have call successors, (98) Word has length 386 [2023-04-02 23:20:58,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 23:20:58,886 INFO L225 Difference]: With dead ends: 422 [2023-04-02 23:20:58,886 INFO L226 Difference]: Without dead ends: 417 [2023-04-02 23:20:58,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1206 GetRequests, 1044 SyntacticMatches, 46 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4112 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4273, Invalid=9533, Unknown=0, NotChecked=0, Total=13806 [2023-04-02 23:20:58,891 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-02 23:20:58,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 244 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-02 23:20:58,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2023-04-02 23:20:58,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2023-04-02 23:20:58,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 309 states have (on average 1.0032362459546926) internal successors, (310), 309 states have internal predecessors, (310), 55 states have call successors, (55), 54 states have call predecessors, (55), 52 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2023-04-02 23:20:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 418 transitions. [2023-04-02 23:20:58,924 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 418 transitions. Word has length 386 [2023-04-02 23:20:58,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 23:20:58,925 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 418 transitions. [2023-04-02 23:20:58,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.611111111111111) internal successors, (303), 54 states have internal predecessors, (303), 52 states have call successors, (100), 49 states have call predecessors, (100), 48 states have return successors, (98), 50 states have call predecessors, (98), 51 states have call successors, (98) [2023-04-02 23:20:58,925 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 418 transitions. [2023-04-02 23:20:58,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2023-04-02 23:20:58,931 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 23:20:58,931 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 23:20:58,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-04-02 23:20:59,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-04-02 23:20:59,139 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 23:20:59,139 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 23:20:59,139 INFO L85 PathProgramCache]: Analyzing trace with hash 46559857, now seen corresponding path program 6 times [2023-04-02 23:20:59,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 23:20:59,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081086553] [2023-04-02 23:20:59,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 23:20:59,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 23:20:59,174 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 23:20:59,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1004752034] [2023-04-02 23:20:59,174 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-02 23:20:59,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 23:20:59,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 23:20:59,175 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 23:20:59,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-04-02 23:20:59,487 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-02 23:20:59,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-04-02 23:20:59,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-04-02 23:20:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-02 23:20:59,977 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-04-02 23:20:59,977 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-04-02 23:20:59,979 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-02 23:20:59,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-04-02 23:21:00,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-04-02 23:21:00,191 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2023-04-02 23:21:00,195 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-02 23:21:00,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.04 11:21:00 BoogieIcfgContainer [2023-04-02 23:21:00,319 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-02 23:21:00,320 INFO L158 Benchmark]: Toolchain (without parser) took 27448.72ms. Allocated memory was 177.2MB in the beginning and 503.3MB in the end (delta: 326.1MB). Free memory was 126.0MB in the beginning and 232.5MB in the end (delta: -106.5MB). Peak memory consumption was 220.2MB. Max. memory is 8.0GB. [2023-04-02 23:21:00,320 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 177.2MB. Free memory is still 130.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-02 23:21:00,320 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.52ms. Allocated memory is still 177.2MB. Free memory was 125.7MB in the beginning and 115.5MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-04-02 23:21:00,321 INFO L158 Benchmark]: Boogie Preprocessor took 22.69ms. Allocated memory is still 177.2MB. Free memory was 115.5MB in the beginning and 114.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-04-02 23:21:00,321 INFO L158 Benchmark]: RCFGBuilder took 330.32ms. Allocated memory is still 177.2MB. Free memory was 114.0MB in the beginning and 101.6MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-04-02 23:21:00,321 INFO L158 Benchmark]: TraceAbstraction took 26892.69ms. Allocated memory was 177.2MB in the beginning and 503.3MB in the end (delta: 326.1MB). Free memory was 100.9MB in the beginning and 232.5MB in the end (delta: -131.7MB). Peak memory consumption was 195.0MB. Max. memory is 8.0GB. [2023-04-02 23:21:00,324 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 177.2MB. Free memory is still 130.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 197.52ms. Allocated memory is still 177.2MB. Free memory was 125.7MB in the beginning and 115.5MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.69ms. Allocated memory is still 177.2MB. Free memory was 115.5MB in the beginning and 114.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 330.32ms. Allocated memory is still 177.2MB. Free memory was 114.0MB in the beginning and 101.6MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 26892.69ms. Allocated memory was 177.2MB in the beginning and 503.3MB in the end (delta: 326.1MB). Free memory was 100.9MB in the beginning and 232.5MB in the end (delta: -131.7MB). Peak memory consumption was 195.0MB. 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; [L24] int x1, x2; [L25] int y1, y2, y3; [L26] x1 = __VERIFIER_nondet_int() [L27] x2 = __VERIFIER_nondet_int() [L29] CALL assume_abort_if_not(x1 >= 0) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L13] COND FALSE !(!cond) [L29] RET assume_abort_if_not(x1 >= 0) VAL [\old(counter)=0, counter=0, x1=51, x2=47] [L30] CALL assume_abort_if_not(x2 != 0) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L13] COND FALSE !(!cond) [L30] RET assume_abort_if_not(x2 != 0) VAL [\old(counter)=0, counter=0, x1=51, x2=47] [L32] y1 = 0 [L33] y2 = 0 [L34] y3 = x1 VAL [\old(counter)=0, counter=0, x1=51, x2=47, y1=0, y2=0, y3=51] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=0, counter=1, x1=51, x2=47, y1=0, y2=0, y3=51] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=1, x1=51, x2=47, y1=0, y2=0, y3=51] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=1, x1=51, x2=47, y1=0, y2=1, y3=50] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=1, counter=2, x1=51, x2=47, y1=0, y2=1, y3=50] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=2, x1=51, x2=47, y1=0, y2=1, y3=50] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=2, x1=51, x2=47, y1=0, y2=2, y3=49] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=2, counter=3, x1=51, x2=47, y1=0, y2=2, y3=49] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=3, x1=51, x2=47, y1=0, y2=2, y3=49] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=3, x1=51, x2=47, y1=0, y2=3, y3=48] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=3, counter=4, x1=51, x2=47, y1=0, y2=3, y3=48] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=4, x1=51, x2=47, y1=0, y2=3, y3=48] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=4, x1=51, x2=47, y1=0, y2=4, y3=47] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=4, counter=5, x1=51, x2=47, y1=0, y2=4, y3=47] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=5, x1=51, x2=47, y1=0, y2=4, y3=47] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=5, x1=51, x2=47, y1=0, y2=5, y3=46] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=5, counter=6, x1=51, x2=47, y1=0, y2=5, y3=46] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=6, x1=51, x2=47, y1=0, y2=5, y3=46] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=6, x1=51, x2=47, y1=0, y2=6, y3=45] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=6, counter=7, x1=51, x2=47, y1=0, y2=6, y3=45] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=7, x1=51, x2=47, y1=0, y2=6, y3=45] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=7, x1=51, x2=47, y1=0, y2=7, y3=44] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=7, counter=8, x1=51, x2=47, y1=0, y2=7, y3=44] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=8, x1=51, x2=47, y1=0, y2=7, y3=44] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=8, x1=51, x2=47, y1=0, y2=8, y3=43] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=8, counter=9, x1=51, x2=47, y1=0, y2=8, y3=43] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=9, x1=51, x2=47, y1=0, y2=8, y3=43] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=9, x1=51, x2=47, y1=0, y2=9, y3=42] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=9, counter=10, x1=51, x2=47, y1=0, y2=9, y3=42] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=10, x1=51, x2=47, y1=0, y2=9, y3=42] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=10, x1=51, x2=47, y1=0, y2=10, y3=41] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=10, counter=11, x1=51, x2=47, y1=0, y2=10, y3=41] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=11, x1=51, x2=47, y1=0, y2=10, y3=41] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=11, x1=51, x2=47, y1=0, y2=11, y3=40] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=11, counter=12, x1=51, x2=47, y1=0, y2=11, y3=40] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=12, x1=51, x2=47, y1=0, y2=11, y3=40] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=12, x1=51, x2=47, y1=0, y2=12, y3=39] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=12, counter=13, x1=51, x2=47, y1=0, y2=12, y3=39] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=13, x1=51, x2=47, y1=0, y2=12, y3=39] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=13, x1=51, x2=47, y1=0, y2=13, y3=38] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=13, counter=14, x1=51, x2=47, y1=0, y2=13, y3=38] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=14, x1=51, x2=47, y1=0, y2=13, y3=38] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=14, x1=51, x2=47, y1=0, y2=14, y3=37] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=14, counter=15, x1=51, x2=47, y1=0, y2=14, y3=37] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=15, x1=51, x2=47, y1=0, y2=14, y3=37] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=15, x1=51, x2=47, y1=0, y2=15, y3=36] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=15, counter=16, x1=51, x2=47, y1=0, y2=15, y3=36] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=16, x1=51, x2=47, y1=0, y2=15, y3=36] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=16, x1=51, x2=47, y1=0, y2=16, y3=35] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=16, counter=17, x1=51, x2=47, y1=0, y2=16, y3=35] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=17, x1=51, x2=47, y1=0, y2=16, y3=35] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=17, x1=51, x2=47, y1=0, y2=17, y3=34] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=17, counter=18, x1=51, x2=47, y1=0, y2=17, y3=34] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=18, x1=51, x2=47, y1=0, y2=17, y3=34] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=18, x1=51, x2=47, y1=0, y2=18, y3=33] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=18, counter=19, x1=51, x2=47, y1=0, y2=18, y3=33] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=19, x1=51, x2=47, y1=0, y2=18, y3=33] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=19, x1=51, x2=47, y1=0, y2=19, y3=32] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=19, counter=20, x1=51, x2=47, y1=0, y2=19, y3=32] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=20, x1=51, x2=47, y1=0, y2=19, y3=32] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=20, x1=51, x2=47, y1=0, y2=20, y3=31] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=20, counter=21, x1=51, x2=47, y1=0, y2=20, y3=31] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=21, x1=51, x2=47, y1=0, y2=20, y3=31] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=21, x1=51, x2=47, y1=0, y2=21, y3=30] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=21, counter=22, x1=51, x2=47, y1=0, y2=21, y3=30] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=22] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=22] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=22, x1=51, x2=47, y1=0, y2=21, y3=30] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=22, x1=51, x2=47, y1=0, y2=22, y3=29] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=22, counter=23, x1=51, x2=47, y1=0, y2=22, y3=29] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=23] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=23] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=23, x1=51, x2=47, y1=0, y2=22, y3=29] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=23, x1=51, x2=47, y1=0, y2=23, y3=28] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=23, counter=24, x1=51, x2=47, y1=0, y2=23, y3=28] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=24] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=24] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=24, x1=51, x2=47, y1=0, y2=23, y3=28] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=24, x1=51, x2=47, y1=0, y2=24, y3=27] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=24, counter=25, x1=51, x2=47, y1=0, y2=24, y3=27] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=25, x1=51, x2=47, y1=0, y2=24, y3=27] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=25, x1=51, x2=47, y1=0, y2=25, y3=26] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=25, counter=26, x1=51, x2=47, y1=0, y2=25, y3=26] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=26] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=26] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=26, x1=51, x2=47, y1=0, y2=25, y3=26] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=26, x1=51, x2=47, y1=0, y2=26, y3=25] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=26, counter=27, x1=51, x2=47, y1=0, y2=26, y3=25] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=27] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=27] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=27, x1=51, x2=47, y1=0, y2=26, y3=25] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=27, x1=51, x2=47, y1=0, y2=27, y3=24] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=27, counter=28, x1=51, x2=47, y1=0, y2=27, y3=24] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=28] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=28] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=28, x1=51, x2=47, y1=0, y2=27, y3=24] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=28, x1=51, x2=47, y1=0, y2=28, y3=23] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=28, counter=29, x1=51, x2=47, y1=0, y2=28, y3=23] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=29, x1=51, x2=47, y1=0, y2=28, y3=23] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=29, x1=51, x2=47, y1=0, y2=29, y3=22] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=29, counter=30, x1=51, x2=47, y1=0, y2=29, y3=22] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=30] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=30] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=30, x1=51, x2=47, y1=0, y2=29, y3=22] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=30, x1=51, x2=47, y1=0, y2=30, y3=21] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=30, counter=31, x1=51, x2=47, y1=0, y2=30, y3=21] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=31] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=31] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=31, x1=51, x2=47, y1=0, y2=30, y3=21] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=31, x1=51, x2=47, y1=0, y2=31, y3=20] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=31, counter=32, x1=51, x2=47, y1=0, y2=31, y3=20] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=32] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=32] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=32, x1=51, x2=47, y1=0, y2=31, y3=20] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=32, x1=51, x2=47, y1=0, y2=32, y3=19] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=32, counter=33, x1=51, x2=47, y1=0, y2=32, y3=19] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=33] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=33] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=33, x1=51, x2=47, y1=0, y2=32, y3=19] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=33, x1=51, x2=47, y1=0, y2=33, y3=18] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=33, counter=34, x1=51, x2=47, y1=0, y2=33, y3=18] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=34] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=34] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=34, x1=51, x2=47, y1=0, y2=33, y3=18] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=34, x1=51, x2=47, y1=0, y2=34, y3=17] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=34, counter=35, x1=51, x2=47, y1=0, y2=34, y3=17] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=35] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=35] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=35, x1=51, x2=47, y1=0, y2=34, y3=17] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=35, x1=51, x2=47, y1=0, y2=35, y3=16] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=35, counter=36, x1=51, x2=47, y1=0, y2=35, y3=16] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=36] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=36] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=36, x1=51, x2=47, y1=0, y2=35, y3=16] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=36, x1=51, x2=47, y1=0, y2=36, y3=15] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=36, counter=37, x1=51, x2=47, y1=0, y2=36, y3=15] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=37, x1=51, x2=47, y1=0, y2=36, y3=15] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=37, x1=51, x2=47, y1=0, y2=37, y3=14] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=37, counter=38, x1=51, x2=47, y1=0, y2=37, y3=14] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=38] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=38] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=38, x1=51, x2=47, y1=0, y2=37, y3=14] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=38, x1=51, x2=47, y1=0, y2=38, y3=13] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=38, counter=39, x1=51, x2=47, y1=0, y2=38, y3=13] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=39] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=39] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=39, x1=51, x2=47, y1=0, y2=38, y3=13] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=39, x1=51, x2=47, y1=0, y2=39, y3=12] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=39, counter=40, x1=51, x2=47, y1=0, y2=39, y3=12] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=40] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=40] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=40, x1=51, x2=47, y1=0, y2=39, y3=12] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=40, x1=51, x2=47, y1=0, y2=40, y3=11] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=40, counter=41, x1=51, x2=47, y1=0, y2=40, y3=11] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=41, x1=51, x2=47, y1=0, y2=40, y3=11] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=41, x1=51, x2=47, y1=0, y2=41, y3=10] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=41, counter=42, x1=51, x2=47, y1=0, y2=41, y3=10] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=42] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=42] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=42, x1=51, x2=47, y1=0, y2=41, y3=10] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=42, x1=51, x2=47, y1=0, y2=42, y3=9] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=42, counter=43, x1=51, x2=47, y1=0, y2=42, y3=9] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=43] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=43] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=43, x1=51, x2=47, y1=0, y2=42, y3=9] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=43, x1=51, x2=47, y1=0, y2=43, y3=8] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=43, counter=44, x1=51, x2=47, y1=0, y2=43, y3=8] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=44] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=44] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=44, x1=51, x2=47, y1=0, y2=43, y3=8] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=44, x1=51, x2=47, y1=0, y2=44, y3=7] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=44, counter=45, x1=51, x2=47, y1=0, y2=44, y3=7] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=45] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=45] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=45, x1=51, x2=47, y1=0, y2=44, y3=7] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=45, x1=51, x2=47, y1=0, y2=45, y3=6] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=45, counter=46, x1=51, x2=47, y1=0, y2=45, y3=6] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=46] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=46] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=46, x1=51, x2=47, y1=0, y2=45, y3=6] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=46, x1=51, x2=47, y1=0, y2=46, y3=5] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=46, counter=47, x1=51, x2=47, y1=0, y2=46, y3=5] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=47] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=47] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=47, x1=51, x2=47, y1=0, y2=46, y3=5] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=47, x1=51, x2=47, y1=1, y2=0, y3=4] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=47, counter=48, x1=51, x2=47, y1=1, y2=0, y3=4] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=48] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=48] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=48, x1=51, x2=47, y1=1, y2=0, y3=4] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=48, x1=51, x2=47, y1=1, y2=1, y3=3] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=48, counter=49, x1=51, x2=47, y1=1, y2=1, y3=3] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=49, x1=51, x2=47, y1=1, y2=1, y3=3] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=49, x1=51, x2=47, y1=1, y2=2, y3=2] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=49, counter=50, x1=51, x2=47, y1=1, y2=2, y3=2] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=50] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=50] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=50, x1=51, x2=47, y1=1, y2=2, y3=2] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [\old(counter)=0, counter=50, x1=51, x2=47, y1=1, y2=3, y3=1] [L36] EXPR counter++ VAL [\old(counter)=0, counter++=50, counter=51, x1=51, x2=47, y1=1, y2=3, y3=1] [L36] COND FALSE !(counter++<50) [L50] CALL __VERIFIER_assert(y1*x2 + y2 == x1) VAL [\old(cond)=0, \old(counter)=0, counter=51] [L16] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=51] [L18] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.7s, OverallIterations: 12, TraceHistogramMax: 51, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 506 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 503 mSDsluCounter, 1077 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 887 mSDsCounter, 109 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1237 IncrementalHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 109 mSolverCounterUnsat, 190 mSDtfsCounter, 1237 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2693 GetRequests, 2193 SyntacticMatches, 54 SemanticMatches, 446 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9683 ImplicationChecksByTransitivity, 12.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=417occurred in iteration=11, InterpolantAutomatonStates: 326, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 1324 NumberOfCodeBlocks, 1324 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 1706 ConstructedInterpolants, 0 QuantifiedInterpolants, 4517 SizeOfPredicates, 102 NumberOfNonLiveVariables, 2346 ConjunctsInSsa, 282 ConjunctsInUnsatCore, 19 InterpolantComputations, 3 PerfectInterpolantSequences, 5661/21812 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.4s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 5, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 21, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 16, TOOLS_POST_TIME: 0.1s, TOOLS_POST_CALL_APPLICATIONS: 14, TOOLS_POST_CALL_TIME: 0.2s, TOOLS_POST_RETURN_APPLICATIONS: 8, TOOLS_POST_RETURN_TIME: 0.1s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 38, TOOLS_QUANTIFIERELIM_TIME: 0.3s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.0s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 60, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 12, DOMAIN_JOIN_TIME: 0.1s, 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: 21, 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: 8, CALL_SUMMARIZER_CACHE_MISSES: 3, 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: 169, DAG_COMPRESSION_RETAINED_NODES: 68, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-04-02 23:21:00,355 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...