/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/bresenham-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 05:10:39,381 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 05:10:39,382 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 05:10:39,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 05:10:39,408 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 05:10:39,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 05:10:39,410 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 05:10:39,411 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 05:10:39,411 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 05:10:39,412 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 05:10:39,413 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 05:10:39,413 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 05:10:39,413 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 05:10:39,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 05:10:39,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 05:10:39,415 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 05:10:39,416 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 05:10:39,417 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 05:10:39,418 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 05:10:39,419 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 05:10:39,420 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 05:10:39,421 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 05:10:39,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 05:10:39,422 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 05:10:39,425 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 05:10:39,425 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 05:10:39,425 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 05:10:39,426 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 05:10:39,426 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 05:10:39,427 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 05:10:39,427 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 05:10:39,427 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 05:10:39,428 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 05:10:39,428 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 05:10:39,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 05:10:39,429 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 05:10:39,430 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 05:10:39,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 05:10:39,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 05:10:39,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 05:10:39,431 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 05:10:39,436 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-01 05:10:39,452 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 05:10:39,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 05:10:39,453 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 05:10:39,453 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 05:10:39,453 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 05:10:39,453 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 05:10:39,454 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 05:10:39,454 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 05:10:39,454 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 05:10:39,454 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 05:10:39,454 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 05:10:39,454 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 05:10:39,454 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 05:10:39,454 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 05:10:39,454 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 05:10:39,454 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 05:10:39,454 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 05:10:39,455 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 05:10:39,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 05:10:39,455 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 05:10:39,455 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 05:10:39,455 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 05:10:39,455 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 05:10:39,455 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 05:10:39,455 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 05:10:39,455 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 05:10:39,456 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 05:10:39,456 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 05:10:39,456 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 05:10:39,456 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 05:10:39,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 05:10:39,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 05:10:39,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 05:10:39,456 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 05:10:39,456 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 05:10:39,457 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 05:10:39,457 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 05:10:39,457 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 05:10:39,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 05:10:39,457 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 05:10:39,457 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 05:10:39,457 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-01 05:10:39,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 05:10:39,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 05:10:39,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 05:10:39,641 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 05:10:39,642 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 05:10:39,643 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound20.c [2023-04-01 05:10:40,660 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 05:10:40,824 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 05:10:40,826 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound20.c [2023-04-01 05:10:40,831 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c6dae98a/c5fdd799e2f042899e383aadcbbbb15f/FLAG3e6bb249b [2023-04-01 05:10:40,848 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c6dae98a/c5fdd799e2f042899e383aadcbbbb15f [2023-04-01 05:10:40,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 05:10:40,851 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 05:10:40,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 05:10:40,854 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 05:10:40,856 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 05:10:40,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 05:10:40" (1/1) ... [2023-04-01 05:10:40,858 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4807496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 05:10:40, skipping insertion in model container [2023-04-01 05:10:40,858 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 05:10:40" (1/1) ... [2023-04-01 05:10:40,863 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 05:10:40,875 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 05:10:40,996 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/bresenham-ll_unwindbound20.c[597,610] [2023-04-01 05:10:41,014 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 05:10:41,021 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 05:10:41,029 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/bresenham-ll_unwindbound20.c[597,610] [2023-04-01 05:10:41,034 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 05:10:41,043 INFO L208 MainTranslator]: Completed translation [2023-04-01 05:10:41,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 05:10:41 WrapperNode [2023-04-01 05:10:41,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 05:10:41,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 05:10:41,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 05:10:41,045 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 05:10:41,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 05:10:41" (1/1) ... [2023-04-01 05:10:41,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 05:10:41" (1/1) ... [2023-04-01 05:10:41,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 05:10:41" (1/1) ... [2023-04-01 05:10:41,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 05:10:41" (1/1) ... [2023-04-01 05:10:41,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 05:10:41" (1/1) ... [2023-04-01 05:10:41,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 05:10:41" (1/1) ... [2023-04-01 05:10:41,076 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 05:10:41" (1/1) ... [2023-04-01 05:10:41,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 05:10:41" (1/1) ... [2023-04-01 05:10:41,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 05:10:41,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 05:10:41,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 05:10:41,079 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 05:10:41,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 05:10:41" (1/1) ... [2023-04-01 05:10:41,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 05:10:41,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 05:10:41,100 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-01 05:10:41,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-01 05:10:41,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 05:10:41,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 05:10:41,125 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 05:10:41,126 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-04-01 05:10:41,126 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-04-01 05:10:41,126 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 05:10:41,126 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 05:10:41,126 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 05:10:41,126 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 05:10:41,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 05:10:41,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 05:10:41,128 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-04-01 05:10:41,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-04-01 05:10:41,129 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 05:10:41,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 05:10:41,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 05:10:41,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 05:10:41,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 05:10:41,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 05:10:41,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 05:10:41,179 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 05:10:41,181 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 05:10:41,329 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 05:10:41,381 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 05:10:41,382 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-04-01 05:10:41,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 05:10:41 BoogieIcfgContainer [2023-04-01 05:10:41,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 05:10:41,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 05:10:41,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 05:10:41,388 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 05:10:41,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 05:10:40" (1/3) ... [2023-04-01 05:10:41,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d2277e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 05:10:41, skipping insertion in model container [2023-04-01 05:10:41,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 05:10:41" (2/3) ... [2023-04-01 05:10:41,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d2277e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 05:10:41, skipping insertion in model container [2023-04-01 05:10:41,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 05:10:41" (3/3) ... [2023-04-01 05:10:41,396 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound20.c [2023-04-01 05:10:41,411 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 05:10:41,411 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 05:10:41,457 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 05:10:41,463 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;@4ed71515, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 05:10:41,463 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 05:10:41,467 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-01 05:10:41,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-04-01 05:10:41,473 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 05:10:41,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 05:10:41,474 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 05:10:41,479 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 05:10:41,479 INFO L85 PathProgramCache]: Analyzing trace with hash 960667193, now seen corresponding path program 1 times [2023-04-01 05:10:41,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 05:10:41,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950997079] [2023-04-01 05:10:41,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 05:10:41,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 05:10:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 05:10:41,607 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 05:10:41,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950997079] [2023-04-01 05:10:41,608 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-04-01 05:10:41,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906974882] [2023-04-01 05:10:41,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 05:10:41,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 05:10:41,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 05:10:41,623 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 05:10:41,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-01 05:10:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 05:10:41,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 1 conjunts are in the unsatisfiable core [2023-04-01 05:10:41,707 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 05:10:41,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 05:10:41,733 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 05:10:41,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906974882] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 05:10:41,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 05:10:41,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-04-01 05:10:41,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195236083] [2023-04-01 05:10:41,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 05:10:41,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-04-01 05:10:41,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 05:10:41,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-04-01 05:10:41,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-04-01 05:10:41,780 INFO L87 Difference]: Start difference. First operand has 21 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 05:10:41,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 05:10:41,815 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2023-04-01 05:10:41,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-04-01 05:10:41,817 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-04-01 05:10:41,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 05:10:41,822 INFO L225 Difference]: With dead ends: 37 [2023-04-01 05:10:41,822 INFO L226 Difference]: Without dead ends: 17 [2023-04-01 05:10:41,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-04-01 05:10:41,830 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 05:10:41,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 05:10:41,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-04-01 05:10:41,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-04-01 05:10:41,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 05:10:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2023-04-01 05:10:41,875 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2023-04-01 05:10:41,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 05:10:41,875 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2023-04-01 05:10:41,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 05:10:41,876 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2023-04-01 05:10:41,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-04-01 05:10:41,876 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 05:10:41,876 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 05:10:41,892 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-01 05:10:42,083 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-01 05:10:42,084 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 05:10:42,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 05:10:42,084 INFO L85 PathProgramCache]: Analyzing trace with hash 372324734, now seen corresponding path program 1 times [2023-04-01 05:10:42,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 05:10:42,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047256253] [2023-04-01 05:10:42,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 05:10:42,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 05:10:42,102 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 05:10:42,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1836679587] [2023-04-01 05:10:42,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 05:10:42,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 05:10:42,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 05:10:42,104 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 05:10:42,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-01 05:10:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 05:10:42,164 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 16 conjunts are in the unsatisfiable core [2023-04-01 05:10:42,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 05:10:42,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 05:10:42,254 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 05:10:42,255 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 05:10:42,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047256253] [2023-04-01 05:10:42,255 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 05:10:42,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836679587] [2023-04-01 05:10:42,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836679587] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 05:10:42,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 05:10:42,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-01 05:10:42,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210668840] [2023-04-01 05:10:42,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 05:10:42,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-01 05:10:42,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 05:10:42,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-01 05:10:42,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-04-01 05:10:42,257 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 05:10:42,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 05:10:42,354 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2023-04-01 05:10:42,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 05:10:42,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-04-01 05:10:42,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 05:10:42,355 INFO L225 Difference]: With dead ends: 30 [2023-04-01 05:10:42,355 INFO L226 Difference]: Without dead ends: 25 [2023-04-01 05:10:42,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-04-01 05:10:42,357 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 05:10:42,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 47 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 05:10:42,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-04-01 05:10:42,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-04-01 05:10:42,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 05:10:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2023-04-01 05:10:42,362 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 11 [2023-04-01 05:10:42,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 05:10:42,363 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-04-01 05:10:42,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 05:10:42,363 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2023-04-01 05:10:42,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-04-01 05:10:42,364 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 05:10:42,364 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 05:10:42,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-01 05:10:42,568 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-01 05:10:42,569 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 05:10:42,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 05:10:42,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1361165766, now seen corresponding path program 1 times [2023-04-01 05:10:42,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 05:10:42,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355572479] [2023-04-01 05:10:42,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 05:10:42,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 05:10:42,583 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 05:10:42,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [772668864] [2023-04-01 05:10:42,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 05:10:42,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 05:10:42,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 05:10:42,589 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 05:10:42,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-01 05:10:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 05:10:42,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 30 conjunts are in the unsatisfiable core [2023-04-01 05:10:42,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 05:10:43,003 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 05:10:43,003 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 05:10:43,223 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 05:10:43,223 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 05:10:43,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355572479] [2023-04-01 05:10:43,223 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 05:10:43,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772668864] [2023-04-01 05:10:43,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772668864] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 05:10:43,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [163866568] [2023-04-01 05:10:43,240 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-04-01 05:10:43,240 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 05:10:43,244 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 05:10:43,248 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 05:10:43,250 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 05:10:43,310 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 13 for LOIs [2023-04-01 05:10:44,477 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 82 for LOIs [2023-04-01 05:10:44,574 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-01 05:10:44,579 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 05:10:45,699 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '374#(and (<= 1 |#StackHeapBarrier|) (< ~counter~0 21) (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-01 05:10:45,699 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 05:10:45,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 05:10:45,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2023-04-01 05:10:45,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477133616] [2023-04-01 05:10:45,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 05:10:45,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-04-01 05:10:45,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 05:10:45,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-04-01 05:10:45,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2023-04-01 05:10:45,703 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 15 states, 11 states have (on average 2.090909090909091) internal successors, (23), 14 states have internal predecessors, (23), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 05:10:45,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 05:10:45,946 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2023-04-01 05:10:45,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-01 05:10:45,946 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.090909090909091) internal successors, (23), 14 states have internal predecessors, (23), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 19 [2023-04-01 05:10:45,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 05:10:45,947 INFO L225 Difference]: With dead ends: 39 [2023-04-01 05:10:45,947 INFO L226 Difference]: Without dead ends: 35 [2023-04-01 05:10:45,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=116, Invalid=814, Unknown=0, NotChecked=0, Total=930 [2023-04-01 05:10:45,948 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 35 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 05:10:45,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 70 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 05:10:45,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-04-01 05:10:45,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2023-04-01 05:10:45,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 05:10:45,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2023-04-01 05:10:45,961 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 19 [2023-04-01 05:10:45,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 05:10:45,961 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2023-04-01 05:10:45,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.090909090909091) internal successors, (23), 14 states have internal predecessors, (23), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 05:10:45,961 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2023-04-01 05:10:45,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-04-01 05:10:45,961 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 05:10:45,962 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 05:10:45,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-04-01 05:10:46,166 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-01 05:10:46,167 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 05:10:46,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 05:10:46,167 INFO L85 PathProgramCache]: Analyzing trace with hash -828878547, now seen corresponding path program 1 times [2023-04-01 05:10:46,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 05:10:46,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574533796] [2023-04-01 05:10:46,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 05:10:46,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 05:10:46,195 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 05:10:46,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2092391663] [2023-04-01 05:10:46,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 05:10:46,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 05:10:46,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 05:10:46,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-01 05:10:46,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-01 05:10:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 05:10:46,245 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2023-04-01 05:10:46,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 05:10:46,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 05:10:46,272 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 05:10:46,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 05:10:46,302 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 05:10:46,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574533796] [2023-04-01 05:10:46,305 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 05:10:46,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092391663] [2023-04-01 05:10:46,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092391663] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 05:10:46,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1819014250] [2023-04-01 05:10:46,313 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-04-01 05:10:46,313 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 05:10:46,313 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 05:10:46,313 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 05:10:46,313 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 05:10:46,338 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 13 for LOIs [2023-04-01 05:10:47,066 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 25 for LOIs [2023-04-01 05:10:47,081 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-01 05:10:47,084 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 05:10:48,011 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '612#(and (or (and (<= 1 |#StackHeapBarrier|) (<= 21 ~counter~0) (<= ~counter~0 4294967296) (= |#NULL.offset| 0) (= |#NULL.base| 0)) (and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (<= ~counter~0 20) (= |#NULL.offset| 0) (= |#NULL.base| 0))) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0))' at error location [2023-04-01 05:10:48,011 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 05:10:48,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 05:10:48,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-04-01 05:10:48,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37320073] [2023-04-01 05:10:48,011 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 05:10:48,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-01 05:10:48,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 05:10:48,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-01 05:10:48,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2023-04-01 05:10:48,012 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-01 05:10:48,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 05:10:48,083 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2023-04-01 05:10:48,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-01 05:10:48,083 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2023-04-01 05:10:48,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 05:10:48,085 INFO L225 Difference]: With dead ends: 63 [2023-04-01 05:10:48,085 INFO L226 Difference]: Without dead ends: 57 [2023-04-01 05:10:48,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2023-04-01 05:10:48,089 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 05:10:48,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 78 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 05:10:48,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-04-01 05:10:48,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 45. [2023-04-01 05:10:48,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 05:10:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2023-04-01 05:10:48,098 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 20 [2023-04-01 05:10:48,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 05:10:48,098 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2023-04-01 05:10:48,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-01 05:10:48,098 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2023-04-01 05:10:48,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-04-01 05:10:48,099 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 05:10:48,099 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 05:10:48,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-01 05:10:48,305 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-01 05:10:48,305 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 05:10:48,305 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 05:10:48,305 INFO L85 PathProgramCache]: Analyzing trace with hash 34015446, now seen corresponding path program 1 times [2023-04-01 05:10:48,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 05:10:48,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107255967] [2023-04-01 05:10:48,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 05:10:48,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 05:10:48,315 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 05:10:48,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1144745442] [2023-04-01 05:10:48,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 05:10:48,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 05:10:48,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 05:10:48,316 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 05:10:48,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-01 05:10:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 05:10:48,356 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 30 conjunts are in the unsatisfiable core [2023-04-01 05:10:48,358 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 05:10:48,638 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 05:10:48,638 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 05:10:48,948 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 05:10:48,948 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 05:10:48,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107255967] [2023-04-01 05:10:48,948 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 05:10:48,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144745442] [2023-04-01 05:10:48,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144745442] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 05:10:48,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [649707373] [2023-04-01 05:10:48,950 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-04-01 05:10:48,950 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 05:10:48,951 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 05:10:48,951 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 05:10:48,951 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 05:10:48,969 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 13 for LOIs [2023-04-01 05:10:49,585 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 19 for LOIs [2023-04-01 05:10:49,590 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-01 05:10:49,592 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 05:10:50,536 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '955#(and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (<= ~counter~0 20) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-01 05:10:50,536 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 05:10:50,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 05:10:50,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2023-04-01 05:10:50,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661974050] [2023-04-01 05:10:50,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 05:10:50,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-01 05:10:50,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 05:10:50,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-01 05:10:50,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=881, Unknown=0, NotChecked=0, Total=992 [2023-04-01 05:10:50,538 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 18 states, 14 states have (on average 2.142857142857143) internal successors, (30), 16 states have internal predecessors, (30), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-04-01 05:10:50,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 05:10:50,822 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2023-04-01 05:10:50,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-01 05:10:50,822 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.142857142857143) internal successors, (30), 16 states have internal predecessors, (30), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 26 [2023-04-01 05:10:50,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 05:10:50,823 INFO L225 Difference]: With dead ends: 53 [2023-04-01 05:10:50,823 INFO L226 Difference]: Without dead ends: 45 [2023-04-01 05:10:50,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=177, Invalid=1305, Unknown=0, NotChecked=0, Total=1482 [2023-04-01 05:10:50,824 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 05:10:50,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 56 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 05:10:50,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-04-01 05:10:50,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-04-01 05:10:50,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 05:10:50,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2023-04-01 05:10:50,845 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 26 [2023-04-01 05:10:50,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 05:10:50,845 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2023-04-01 05:10:50,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.142857142857143) internal successors, (30), 16 states have internal predecessors, (30), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-04-01 05:10:50,845 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2023-04-01 05:10:50,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-04-01 05:10:50,846 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 05:10:50,846 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 05:10:50,853 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-01 05:10:51,051 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-01 05:10:51,051 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 05:10:51,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 05:10:51,052 INFO L85 PathProgramCache]: Analyzing trace with hash -2141253803, now seen corresponding path program 2 times [2023-04-01 05:10:51,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 05:10:51,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633605701] [2023-04-01 05:10:51,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 05:10:51,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 05:10:51,059 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 05:10:51,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1046469304] [2023-04-01 05:10:51,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 05:10:51,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 05:10:51,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 05:10:51,060 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 05:10:51,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-01 05:10:51,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-04-01 05:10:51,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 05:10:51,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 13 conjunts are in the unsatisfiable core [2023-04-01 05:10:51,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 05:10:51,217 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 05:10:51,218 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 05:10:51,292 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-04-01 05:10:51,293 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 05:10:51,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633605701] [2023-04-01 05:10:51,293 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 05:10:51,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046469304] [2023-04-01 05:10:51,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046469304] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 05:10:51,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [295119640] [2023-04-01 05:10:51,297 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-04-01 05:10:51,297 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 05:10:51,297 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 05:10:51,297 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 05:10:51,297 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 05:10:51,312 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 13 for LOIs [2023-04-01 05:10:51,977 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 25 for LOIs [2023-04-01 05:10:51,989 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-01 05:10:51,992 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 05:10:52,994 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1397#(and (or (and (<= 1 |#StackHeapBarrier|) (<= 21 ~counter~0) (<= ~counter~0 4294967296) (= |#NULL.offset| 0) (= |#NULL.base| 0)) (and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (<= ~counter~0 20) (= |#NULL.offset| 0) (= |#NULL.base| 0))) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0))' at error location [2023-04-01 05:10:52,994 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 05:10:52,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 05:10:52,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-04-01 05:10:52,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463858770] [2023-04-01 05:10:52,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 05:10:52,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-01 05:10:52,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 05:10:52,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-01 05:10:52,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2023-04-01 05:10:52,997 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2023-04-01 05:10:53,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 05:10:53,163 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2023-04-01 05:10:53,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-04-01 05:10:53,163 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 44 [2023-04-01 05:10:53,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 05:10:53,164 INFO L225 Difference]: With dead ends: 99 [2023-04-01 05:10:53,164 INFO L226 Difference]: Without dead ends: 93 [2023-04-01 05:10:53,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=256, Invalid=1076, Unknown=0, NotChecked=0, Total=1332 [2023-04-01 05:10:53,165 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 38 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 05:10:53,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 71 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 05:10:53,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-04-01 05:10:53,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-04-01 05:10:53,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-04-01 05:10:53,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2023-04-01 05:10:53,182 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 44 [2023-04-01 05:10:53,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 05:10:53,183 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2023-04-01 05:10:53,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2023-04-01 05:10:53,183 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2023-04-01 05:10:53,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-04-01 05:10:53,184 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 05:10:53,184 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 05:10:53,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-01 05:10:53,389 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-01 05:10:53,389 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 05:10:53,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 05:10:53,390 INFO L85 PathProgramCache]: Analyzing trace with hash 476750757, now seen corresponding path program 3 times [2023-04-01 05:10:53,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 05:10:53,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514415238] [2023-04-01 05:10:53,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 05:10:53,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 05:10:53,399 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 05:10:53,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [53916566] [2023-04-01 05:10:53,399 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 05:10:53,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 05:10:53,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 05:10:53,400 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 05:10:53,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-01 05:10:53,494 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 05:10:53,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 05:10:53,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 25 conjunts are in the unsatisfiable core [2023-04-01 05:10:53,498 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 05:10:53,648 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 05:10:53,648 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 05:10:53,865 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 200 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-04-01 05:10:53,866 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 05:10:53,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514415238] [2023-04-01 05:10:53,866 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 05:10:53,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53916566] [2023-04-01 05:10:53,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53916566] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 05:10:53,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1058026530] [2023-04-01 05:10:53,869 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-04-01 05:10:53,869 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 05:10:53,869 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 05:10:53,869 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 05:10:53,869 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 05:10:53,889 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 13 for LOIs [2023-04-01 05:10:54,403 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 25 for LOIs [2023-04-01 05:10:54,415 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-01 05:10:54,418 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 05:10:55,248 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2270#(and (or (and (<= 1 |#StackHeapBarrier|) (<= 21 ~counter~0) (<= ~counter~0 4294967296) (= |#NULL.offset| 0) (= |#NULL.base| 0)) (and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (<= ~counter~0 20) (= |#NULL.offset| 0) (= |#NULL.base| 0))) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0))' at error location [2023-04-01 05:10:55,248 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 05:10:55,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 05:10:55,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2023-04-01 05:10:55,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694341840] [2023-04-01 05:10:55,249 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 05:10:55,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-04-01 05:10:55,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 05:10:55,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-04-01 05:10:55,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=1068, Unknown=0, NotChecked=0, Total=1406 [2023-04-01 05:10:55,251 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand has 24 states, 24 states have (on average 4.25) internal successors, (102), 24 states have internal predecessors, (102), 22 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2023-04-01 05:10:55,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 05:10:55,680 INFO L93 Difference]: Finished difference Result 179 states and 188 transitions. [2023-04-01 05:10:55,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-04-01 05:10:55,680 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.25) internal successors, (102), 24 states have internal predecessors, (102), 22 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) Word has length 92 [2023-04-01 05:10:55,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 05:10:55,684 INFO L225 Difference]: With dead ends: 179 [2023-04-01 05:10:55,684 INFO L226 Difference]: Without dead ends: 173 [2023-04-01 05:10:55,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 236 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=767, Invalid=2425, Unknown=0, NotChecked=0, Total=3192 [2023-04-01 05:10:55,685 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 51 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 05:10:55,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 138 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 05:10:55,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-04-01 05:10:55,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2023-04-01 05:10:55,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 128 states have (on average 1.0078125) internal successors, (129), 128 states have internal predecessors, (129), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-04-01 05:10:55,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2023-04-01 05:10:55,711 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 92 [2023-04-01 05:10:55,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 05:10:55,712 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2023-04-01 05:10:55,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.25) internal successors, (102), 24 states have internal predecessors, (102), 22 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2023-04-01 05:10:55,712 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2023-04-01 05:10:55,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-04-01 05:10:55,714 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 05:10:55,714 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 05:10:55,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-04-01 05:10:55,920 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-01 05:10:55,920 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 05:10:55,921 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 05:10:55,921 INFO L85 PathProgramCache]: Analyzing trace with hash 743906005, now seen corresponding path program 4 times [2023-04-01 05:10:55,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 05:10:55,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909409384] [2023-04-01 05:10:55,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 05:10:55,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 05:10:55,948 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 05:10:55,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2122469893] [2023-04-01 05:10:55,948 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 05:10:55,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 05:10:55,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 05:10:55,950 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-01 05:10:55,952 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-01 05:10:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 05:10:56,156 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-04-01 05:10:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 05:10:56,493 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-04-01 05:10:56,493 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-04-01 05:10:56,494 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-01 05:10:56,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-04-01 05:10:56,702 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-01 05:10:56,705 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2023-04-01 05:10:56,708 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-01 05:10:56,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.04 05:10:56 BoogieIcfgContainer [2023-04-01 05:10:56,791 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-01 05:10:56,792 INFO L158 Benchmark]: Toolchain (without parser) took 15940.46ms. Allocated memory was 189.8MB in the beginning and 459.3MB in the end (delta: 269.5MB). Free memory was 144.2MB in the beginning and 425.6MB in the end (delta: -281.4MB). Peak memory consumption was 258.0MB. Max. memory is 8.0GB. [2023-04-01 05:10:56,792 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 189.8MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-01 05:10:56,792 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.85ms. Allocated memory is still 189.8MB. Free memory was 144.2MB in the beginning and 133.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-04-01 05:10:56,792 INFO L158 Benchmark]: Boogie Preprocessor took 33.89ms. Allocated memory is still 189.8MB. Free memory was 133.7MB in the beginning and 132.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-04-01 05:10:56,792 INFO L158 Benchmark]: RCFGBuilder took 305.07ms. Allocated memory is still 189.8MB. Free memory was 132.3MB in the beginning and 118.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-04-01 05:10:56,792 INFO L158 Benchmark]: TraceAbstraction took 15405.75ms. Allocated memory was 189.8MB in the beginning and 459.3MB in the end (delta: 269.5MB). Free memory was 118.0MB in the beginning and 425.6MB in the end (delta: -307.6MB). Peak memory consumption was 231.7MB. Max. memory is 8.0GB. [2023-04-01 05:10:56,793 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.08ms. Allocated memory is still 189.8MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 189.85ms. Allocated memory is still 189.8MB. Free memory was 144.2MB in the beginning and 133.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.89ms. Allocated memory is still 189.8MB. Free memory was 133.7MB in the beginning and 132.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 305.07ms. Allocated memory is still 189.8MB. Free memory was 132.3MB in the beginning and 118.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 15405.75ms. Allocated memory was 189.8MB in the beginning and 459.3MB in the end (delta: 269.5MB). Free memory was 118.0MB in the beginning and 425.6MB in the end (delta: -307.6MB). Peak memory consumption was 231.7MB. 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: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int counter = 0; [L23] int X, Y; [L24] long long x, y, v, xy, yx; [L25] X = __VERIFIER_nondet_int() [L26] Y = __VERIFIER_nondet_int() [L27] v = ((long long) 2 * Y) - X [L28] y = 0 [L29] x = 0 VAL [X=45, Y=8, \old(counter)=0, counter=0, v=-29, x=0, y=0] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=0, counter=1, v=-29, x=0, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=1, v=-29, x=0, x=0, x=0, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=1, v=-29, x=0, x=0, x=0, y=0] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=1, v=-13, x=0, x=0, x=1, y++=59, y=0] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=1, counter=2, v=-13, x=0, x=0, x=1, y++=59, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=2, v=-13, x=0, x=1, x=8, y++=59, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=2, v=-13, x=0, x=1, x=8, y++=59, y=0] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=2, v=3, x=0, x=2, x=8, y++=59, y=0] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=2, counter=3, v=3, x=0, x=2, x=8, y++=59, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=3, v=3, x=0, x=16, x=2, y++=59, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=3, v=3, x=0, x=16, x=2, y++=59, y=0] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=3, v=-71, x=0, x=16, x=3, y++=100, y=1] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=3, counter=4, v=-71, x=0, x=16, x=3, y++=100, y=1] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=4, v=-71, x=24, x=3, x=45, y++=100, y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=4, v=-71, x=24, x=3, x=45, y++=100, y=1] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=4, v=-55, x=24, x=4, x=45, y++=100, y=1] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=4, counter=5, v=-55, x=24, x=4, x=45, y++=100, y=1] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=5, v=-55, x=32, x=4, x=45, y++=100, y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=5, v=-55, x=32, x=4, x=45, y++=100, y=1] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=5, v=-39, x=32, x=45, x=5, y++=100, y=1] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=5, counter=6, v=-39, x=32, x=45, x=5, y++=100, y=1] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=6, v=-39, x=40, x=45, x=5, y++=100, y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=6, v=-39, x=40, x=45, x=5, y++=100, y=1] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=6, v=-23, x=40, x=45, x=6, y++=100, y=1] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=6, counter=7, v=-23, x=40, x=45, x=6, y++=100, y=1] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=7, v=-23, x=45, x=48, x=6, y++=100, y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=7, v=-23, x=45, x=48, x=6, y++=100, y=1] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=7, v=-7, x=45, x=48, x=7, y++=100, y=1] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=7, counter=8, v=-7, x=45, x=48, x=7, y++=100, y=1] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=8, v=-7, x=45, x=56, x=7, y++=100, y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=8, v=-7, x=45, x=56, x=7, y++=100, y=1] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=8, v=9, x=45, x=56, x=8, y++=100, y=1] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=8, counter=9, v=9, x=45, x=56, x=8, y++=100, y=1] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=9, v=9, x=45, x=64, x=8, y++=100, y=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=9, v=9, x=45, x=64, x=8, y++=100, y=1] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=9, v=-65, x=45, x=64, x=9, y++=158, y=2] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=9, counter=10, v=-65, x=45, x=64, x=9, y++=158, y=2] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=10, v=-65, x=72, x=9, x=90, y++=158, y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=10, v=-65, x=72, x=9, x=90, y++=158, y=2] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=10, v=-49, x=10, x=72, x=90, y++=158, y=2] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=10, counter=11, v=-49, x=10, x=72, x=90, y++=158, y=2] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=11, v=-49, x=10, x=80, x=90, y++=158, y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=11, v=-49, x=10, x=80, x=90, y++=158, y=2] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=11, v=-33, x=11, x=80, x=90, y++=158, y=2] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=11, counter=12, v=-33, x=11, x=80, x=90, y++=158, y=2] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=12, v=-33, x=11, x=88, x=90, y++=158, y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=12, v=-33, x=11, x=88, x=90, y++=158, y=2] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=12, v=-17, x=12, x=88, x=90, y++=158, y=2] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=12, counter=13, v=-17, x=12, x=88, x=90, y++=158, y=2] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=13, v=-17, x=12, x=90, x=96, y++=158, y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=13, v=-17, x=12, x=90, x=96, y++=158, y=2] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=13, v=-1, x=13, x=90, x=96, y++=158, y=2] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=13, counter=14, v=-1, x=13, x=90, x=96, y++=158, y=2] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=14, v=-1, x=104, x=13, x=90, y++=158, y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=14, v=-1, x=104, x=13, x=90, y++=158, y=2] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=14, v=15, x=104, x=14, x=90, y++=158, y=2] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=14, counter=15, v=15, x=104, x=14, x=90, y++=158, y=2] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=15, v=15, x=112, x=14, x=90, y++=158, y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=15, v=15, x=112, x=14, x=90, y++=158, y=2] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=15, v=-59, x=112, x=15, x=90, y++=200, y=3] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=15, counter=16, v=-59, x=112, x=15, x=90, y++=200, y=3] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=16, v=-59, x=120, x=135, x=15, y++=200, y=3] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=16, v=-59, x=120, x=135, x=15, y++=200, y=3] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=16, v=-43, x=120, x=135, x=16, y++=200, y=3] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=16, counter=17, v=-43, x=120, x=135, x=16, y++=200, y=3] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=17, v=-43, x=128, x=135, x=16, y++=200, y=3] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=17, v=-43, x=128, x=135, x=16, y++=200, y=3] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=17, v=-27, x=128, x=135, x=17, y++=200, y=3] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=17, counter=18, v=-27, x=128, x=135, x=17, y++=200, y=3] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=18, v=-27, x=135, x=136, x=17, y++=200, y=3] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=18, v=-27, x=135, x=136, x=17, y++=200, y=3] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=18, v=-11, x=135, x=136, x=18, y++=200, y=3] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=18, counter=19, v=-11, x=135, x=136, x=18, y++=200, y=3] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=19, v=-11, x=135, x=144, x=18, y++=200, y=3] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=19, v=-11, x=135, x=144, x=18, y++=200, y=3] [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=19, v=5, x=135, x=144, x=19, y++=200, y=3] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=19, counter=20, v=5, x=135, x=144, x=19, y++=200, y=3] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=45, Y=8, \old(counter)=0, counter=20, v=5, x=135, x=152, x=19, y++=200, y=3] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=45, Y=8, \old(counter)=0, counter=20, v=5, x=135, x=152, x=19, y++=200, y=3] [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ VAL [X=45, Y=8, \old(counter)=0, counter=20, v=-69, x=135, x=152, x=20, y++=0, y=4] [L31] EXPR counter++ VAL [X=45, Y=8, \old(counter)=0, counter++=20, counter=21, v=-69, x=135, x=152, x=20, y++=0, y=4] [L31] COND FALSE !(counter++<20) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [X=45, Y=8, \old(counter)=0, counter=21, v=-69, x=160, x=20, x=80, y++=0, y=4] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, \old(counter)=0, counter=21] [L14] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] [L16] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.3s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 196 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 194 mSDsluCounter, 480 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 382 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 473 IncrementalHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 98 mSDtfsCounter, 473 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 662 GetRequests, 472 SyntacticMatches, 5 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1947 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173occurred in iteration=7, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 406 NumberOfCodeBlocks, 406 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 412 ConstructedInterpolants, 0 QuantifiedInterpolants, 1706 SizeOfPredicates, 34 NumberOfNonLiveVariables, 916 ConjunctsInSsa, 122 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 286/970 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-04-01 05:10:56,816 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...