./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_byte_buf_eq_c_str_harness.i --full-output --preprocessor.use.memory.slicer false --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version abd6749d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/aws-c-common/aws_byte_buf_eq_c_str_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9e4ccc391c063e90fb229c8b3638d2f1089d6ba2ff288522cf06bf650b1be9e5 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 08:10:14,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 08:10:14,269 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 08:10:14,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 08:10:14,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 08:10:14,292 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 08:10:14,292 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 08:10:14,293 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 08:10:14,293 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 08:10:14,296 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 08:10:14,296 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 08:10:14,297 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 08:10:14,297 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 08:10:14,298 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 08:10:14,299 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 08:10:14,299 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 08:10:14,299 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 08:10:14,299 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 08:10:14,299 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 08:10:14,300 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 08:10:14,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 08:10:14,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 08:10:14,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 08:10:14,301 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 08:10:14,301 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 08:10:14,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 08:10:14,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 08:10:14,302 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 08:10:14,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:10:14,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 08:10:14,303 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 08:10:14,303 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 08:10:14,303 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 08:10:14,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 08:10:14,303 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 08:10:14,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 08:10:14,304 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 08:10:14,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 08:10:14,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 08:10:14,304 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9e4ccc391c063e90fb229c8b3638d2f1089d6ba2ff288522cf06bf650b1be9e5 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 08:10:14,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 08:10:14,553 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 08:10:14,555 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 08:10:14,556 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 08:10:14,556 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 08:10:14,557 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_byte_buf_eq_c_str_harness.i [2023-11-23 08:10:15,611 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 08:10:15,986 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 08:10:15,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_eq_c_str_harness.i [2023-11-23 08:10:16,016 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/927e45e48/c94c99621e934af4a74e15c24e9b1b3a/FLAG061469a0d [2023-11-23 08:10:16,026 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/927e45e48/c94c99621e934af4a74e15c24e9b1b3a [2023-11-23 08:10:16,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 08:10:16,029 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 08:10:16,030 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 08:10:16,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 08:10:16,035 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 08:10:16,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:10:16" (1/1) ... [2023-11-23 08:10:16,036 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e76f6f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:10:16, skipping insertion in model container [2023-11-23 08:10:16,036 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:10:16" (1/1) ... [2023-11-23 08:10:16,150 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:10:16,327 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_eq_c_str_harness.i[4495,4508] [2023-11-23 08:10:16,335 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_eq_c_str_harness.i[4555,4568] [2023-11-23 08:10:16,927 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:16,928 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:16,928 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:16,931 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:16,931 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:16,951 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:16,951 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:16,953 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:16,955 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:17,176 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:10:17,177 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:10:17,178 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:10:17,179 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:10:17,180 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:10:17,180 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:10:17,181 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:10:17,183 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:10:17,184 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:10:17,185 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:10:17,406 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:17,414 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:17,456 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:10:17,500 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 08:10:17,509 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_eq_c_str_harness.i[4495,4508] [2023-11-23 08:10:17,510 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_eq_c_str_harness.i[4555,4568] [2023-11-23 08:10:17,546 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:17,547 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:17,547 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:17,547 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:17,548 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:17,552 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:17,552 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:17,553 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:17,553 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:17,593 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:10:17,595 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:10:17,596 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:10:17,597 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:10:17,597 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:10:17,597 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:10:17,598 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:10:17,598 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:10:17,598 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:10:17,599 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:10:17,662 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8277] [2023-11-23 08:10:17,664 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:17,664 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:10:17,678 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8763-8774] [2023-11-23 08:10:17,694 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:10:17,850 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:17,851 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:17,851 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:17,851 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:17,851 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:17,851 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:17,851 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:17,852 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:17,852 WARN L675 CHandler]: The function fprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:17,852 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:17,852 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:17,852 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:17,852 WARN L675 CHandler]: The function predicate is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:17,853 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:17,853 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:17,853 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:17,853 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:17,853 WARN L675 CHandler]: The function memchr is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:10:17,859 INFO L206 MainTranslator]: Completed translation [2023-11-23 08:10:17,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:10:17 WrapperNode [2023-11-23 08:10:17,860 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 08:10:17,861 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 08:10:17,861 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 08:10:17,861 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 08:10:17,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:10:17" (1/1) ... [2023-11-23 08:10:17,926 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:10:17" (1/1) ... [2023-11-23 08:10:17,988 INFO L138 Inliner]: procedures = 690, calls = 2642, calls flagged for inlining = 64, calls inlined = 10, statements flattened = 902 [2023-11-23 08:10:17,988 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 08:10:17,989 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 08:10:17,989 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 08:10:17,989 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 08:10:17,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:10:17" (1/1) ... [2023-11-23 08:10:17,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:10:17" (1/1) ... [2023-11-23 08:10:18,003 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:10:17" (1/1) ... [2023-11-23 08:10:18,005 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:10:17" (1/1) ... [2023-11-23 08:10:18,025 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:10:17" (1/1) ... [2023-11-23 08:10:18,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:10:17" (1/1) ... [2023-11-23 08:10:18,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:10:17" (1/1) ... [2023-11-23 08:10:18,035 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:10:17" (1/1) ... [2023-11-23 08:10:18,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 08:10:18,042 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 08:10:18,042 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 08:10:18,042 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 08:10:18,042 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:10:17" (1/1) ... [2023-11-23 08:10:18,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:10:18,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:10:18,067 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-11-23 08:10:18,077 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-11-23 08:10:18,115 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq_c_str [2023-11-23 08:10:18,115 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq_c_str [2023-11-23 08:10:18,116 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2023-11-23 08:10:18,116 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2023-11-23 08:10:18,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 08:10:18,116 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2023-11-23 08:10:18,116 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2023-11-23 08:10:18,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 08:10:18,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 08:10:18,117 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 08:10:18,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 08:10:18,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 08:10:18,117 INFO L130 BoogieDeclarations]: Found specification of procedure save_byte_from_array [2023-11-23 08:10:18,117 INFO L138 BoogieDeclarations]: Found implementation of procedure save_byte_from_array [2023-11-23 08:10:18,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 08:10:18,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 08:10:18,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 08:10:18,118 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-23 08:10:18,118 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-23 08:10:18,118 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2023-11-23 08:10:18,118 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2023-11-23 08:10:18,118 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 08:10:18,118 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 08:10:18,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 08:10:18,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 08:10:18,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 08:10:18,119 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2023-11-23 08:10:18,119 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2023-11-23 08:10:18,119 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 08:10:18,119 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 08:10:18,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 08:10:18,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 08:10:18,381 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 08:10:18,384 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 08:10:19,280 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 08:10:19,395 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 08:10:19,395 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-23 08:10:19,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:10:19 BoogieIcfgContainer [2023-11-23 08:10:19,396 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 08:10:19,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 08:10:19,398 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 08:10:19,401 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 08:10:19,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:10:16" (1/3) ... [2023-11-23 08:10:19,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474c5977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:10:19, skipping insertion in model container [2023-11-23 08:10:19,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:10:17" (2/3) ... [2023-11-23 08:10:19,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474c5977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:10:19, skipping insertion in model container [2023-11-23 08:10:19,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:10:19" (3/3) ... [2023-11-23 08:10:19,405 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_eq_c_str_harness.i [2023-11-23 08:10:19,419 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 08:10:19,419 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 08:10:19,466 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 08:10:19,474 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@67aa57f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 08:10:19,475 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 08:10:19,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 79 states have internal predecessors, (100), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-23 08:10:19,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-23 08:10:19,492 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:10:19,493 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:10:19,493 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:10:19,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:10:19,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1794145998, now seen corresponding path program 1 times [2023-11-23 08:10:19,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:10:19,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282384160] [2023-11-23 08:10:19,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:10:19,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:10:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:19,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:10:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:19,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:10:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:20,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:10:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:20,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:10:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:20,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:10:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:20,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:10:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:20,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:10:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:20,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:10:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:20,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:10:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:20,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:10:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:20,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 08:10:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:20,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:10:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:20,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:10:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:20,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:10:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:20,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-23 08:10:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:20,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 08:10:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:20,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 08:10:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:20,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:10:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:20,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:10:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:20,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-23 08:10:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:20,171 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2023-11-23 08:10:20,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:10:20,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282384160] [2023-11-23 08:10:20,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282384160] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:10:20,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:10:20,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 08:10:20,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675595260] [2023-11-23 08:10:20,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:10:20,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 08:10:20,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:10:20,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 08:10:20,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 08:10:20,217 INFO L87 Difference]: Start difference. First operand has 125 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 79 states have internal predecessors, (100), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-23 08:10:20,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:10:20,578 INFO L93 Difference]: Finished difference Result 248 states and 369 transitions. [2023-11-23 08:10:20,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:10:20,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 114 [2023-11-23 08:10:20,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:10:20,587 INFO L225 Difference]: With dead ends: 248 [2023-11-23 08:10:20,588 INFO L226 Difference]: Without dead ends: 125 [2023-11-23 08:10:20,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:10:20,598 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 109 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:10:20,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 159 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:10:20,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-23 08:10:20,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2023-11-23 08:10:20,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 76 states have (on average 1.25) internal successors, (95), 77 states have internal predecessors, (95), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-11-23 08:10:20,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 166 transitions. [2023-11-23 08:10:20,632 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 166 transitions. Word has length 114 [2023-11-23 08:10:20,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:10:20,632 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 166 transitions. [2023-11-23 08:10:20,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-23 08:10:20,633 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 166 transitions. [2023-11-23 08:10:20,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-23 08:10:20,635 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:10:20,635 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:10:20,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 08:10:20,636 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:10:20,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:10:20,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1095434304, now seen corresponding path program 1 times [2023-11-23 08:10:20,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:10:20,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050794189] [2023-11-23 08:10:20,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:10:20,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:10:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:21,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:10:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:21,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:10:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:21,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:10:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:21,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:10:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:21,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:10:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:21,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:10:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:21,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:10:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:21,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:10:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:21,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:10:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:21,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:10:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:21,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 08:10:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:21,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:10:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:21,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:10:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:21,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:10:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:21,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-23 08:10:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:21,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 08:10:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:21,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 08:10:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:21,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:10:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:21,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:10:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:21,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-23 08:10:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:21,294 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2023-11-23 08:10:21,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:10:21,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050794189] [2023-11-23 08:10:21,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050794189] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:10:21,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920692505] [2023-11-23 08:10:21,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:10:21,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:10:21,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:10:21,297 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-11-23 08:10:21,298 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-11-23 08:10:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:21,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 2692 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 08:10:21,763 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:10:21,889 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-11-23 08:10:21,889 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:10:21,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920692505] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:10:21,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:10:21,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2023-11-23 08:10:21,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154969235] [2023-11-23 08:10:21,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:10:21,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 08:10:21,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:10:21,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 08:10:21,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:10:21,892 INFO L87 Difference]: Start difference. First operand 123 states and 166 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-23 08:10:22,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:10:22,002 INFO L93 Difference]: Finished difference Result 222 states and 303 transitions. [2023-11-23 08:10:22,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:10:22,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 114 [2023-11-23 08:10:22,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:10:22,014 INFO L225 Difference]: With dead ends: 222 [2023-11-23 08:10:22,014 INFO L226 Difference]: Without dead ends: 125 [2023-11-23 08:10:22,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:10:22,017 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 50 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:10:22,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 491 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:10:22,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-23 08:10:22,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2023-11-23 08:10:22,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 79 states have internal predecessors, (96), 36 states have call successors, (36), 10 states have call predecessors, (36), 11 states have return successors, (37), 35 states have call predecessors, (37), 35 states have call successors, (37) [2023-11-23 08:10:22,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 169 transitions. [2023-11-23 08:10:22,041 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 169 transitions. Word has length 114 [2023-11-23 08:10:22,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:10:22,042 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 169 transitions. [2023-11-23 08:10:22,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-23 08:10:22,043 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 169 transitions. [2023-11-23 08:10:22,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-23 08:10:22,047 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:10:22,047 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:10:22,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 08:10:22,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:10:22,261 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:10:22,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:10:22,261 INFO L85 PathProgramCache]: Analyzing trace with hash 132466581, now seen corresponding path program 1 times [2023-11-23 08:10:22,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:10:22,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258227285] [2023-11-23 08:10:22,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:10:22,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:10:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:22,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:10:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:22,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:10:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:22,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:10:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:22,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:10:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:22,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:10:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:22,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:10:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:22,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:10:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:22,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:10:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:22,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:10:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:22,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:10:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:22,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:10:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:22,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:10:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:22,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:10:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:22,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:10:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:22,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 08:10:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:22,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 08:10:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:22,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-23 08:10:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:22,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:10:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:22,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:10:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:22,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 08:10:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:22,865 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2023-11-23 08:10:22,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:10:22,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258227285] [2023-11-23 08:10:22,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258227285] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:10:22,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892732052] [2023-11-23 08:10:22,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:10:22,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:10:22,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:10:22,867 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-11-23 08:10:22,870 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-11-23 08:10:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:23,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 2709 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 08:10:23,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:10:23,373 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2023-11-23 08:10:23,374 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:10:23,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892732052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:10:23,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:10:23,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2023-11-23 08:10:23,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266305767] [2023-11-23 08:10:23,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:10:23,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:10:23,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:10:23,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:10:23,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-11-23 08:10:23,376 INFO L87 Difference]: Start difference. First operand 125 states and 169 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-23 08:10:23,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:10:23,469 INFO L93 Difference]: Finished difference Result 211 states and 285 transitions. [2023-11-23 08:10:23,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 08:10:23,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 120 [2023-11-23 08:10:23,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:10:23,471 INFO L225 Difference]: With dead ends: 211 [2023-11-23 08:10:23,471 INFO L226 Difference]: Without dead ends: 123 [2023-11-23 08:10:23,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-11-23 08:10:23,472 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 51 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:10:23,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 508 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:10:23,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-23 08:10:23,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2023-11-23 08:10:23,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 76 states have (on average 1.236842105263158) internal successors, (94), 77 states have internal predecessors, (94), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-11-23 08:10:23,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 165 transitions. [2023-11-23 08:10:23,480 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 165 transitions. Word has length 120 [2023-11-23 08:10:23,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:10:23,480 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 165 transitions. [2023-11-23 08:10:23,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-23 08:10:23,480 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 165 transitions. [2023-11-23 08:10:23,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-23 08:10:23,482 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:10:23,483 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:10:23,503 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-11-23 08:10:23,698 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,SelfDestructingSolverStorable2 [2023-11-23 08:10:23,698 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:10:23,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:10:23,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1190158219, now seen corresponding path program 1 times [2023-11-23 08:10:23,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:10:23,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053315980] [2023-11-23 08:10:23,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:10:23,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:10:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:24,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:10:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:24,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:10:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:24,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:10:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:24,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:10:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:24,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:10:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:24,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:10:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:24,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:10:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:24,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:10:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:24,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:10:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:24,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:10:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:24,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:10:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:24,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:10:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:24,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:10:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:24,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:10:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:24,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 08:10:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:24,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-23 08:10:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:24,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 08:10:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:24,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:10:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:24,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:10:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:24,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-23 08:10:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:24,510 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2023-11-23 08:10:24,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:10:24,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053315980] [2023-11-23 08:10:24,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053315980] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:10:24,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:10:24,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 08:10:24,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456203934] [2023-11-23 08:10:24,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:10:24,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 08:10:24,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:10:24,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 08:10:24,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:10:24,513 INFO L87 Difference]: Start difference. First operand 123 states and 165 transitions. Second operand has 10 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-23 08:10:25,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:10:25,076 INFO L93 Difference]: Finished difference Result 136 states and 182 transitions. [2023-11-23 08:10:25,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 08:10:25,077 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 132 [2023-11-23 08:10:25,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:10:25,078 INFO L225 Difference]: With dead ends: 136 [2023-11-23 08:10:25,078 INFO L226 Difference]: Without dead ends: 134 [2023-11-23 08:10:25,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2023-11-23 08:10:25,079 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 140 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 08:10:25,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 546 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 08:10:25,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-23 08:10:25,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2023-11-23 08:10:25,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 83 states have internal predecessors, (99), 37 states have call successors, (37), 11 states have call predecessors, (37), 12 states have return successors, (40), 36 states have call predecessors, (40), 36 states have call successors, (40) [2023-11-23 08:10:25,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 176 transitions. [2023-11-23 08:10:25,087 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 176 transitions. Word has length 132 [2023-11-23 08:10:25,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:10:25,088 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 176 transitions. [2023-11-23 08:10:25,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-23 08:10:25,088 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 176 transitions. [2023-11-23 08:10:25,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-23 08:10:25,089 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:10:25,090 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:10:25,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 08:10:25,090 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:10:25,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:10:25,090 INFO L85 PathProgramCache]: Analyzing trace with hash 724268845, now seen corresponding path program 1 times [2023-11-23 08:10:25,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:10:25,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329764991] [2023-11-23 08:10:25,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:10:25,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:10:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:25,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:10:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:25,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:10:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:25,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:10:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:25,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:10:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:25,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:10:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:25,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:10:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:25,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:10:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:25,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:10:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:25,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:10:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:25,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:10:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:25,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:10:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:25,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:10:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:25,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:10:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:25,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:10:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:25,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 08:10:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:25,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-23 08:10:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:25,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 08:10:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:25,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:10:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:25,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:10:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:25,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-23 08:10:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:25,967 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2023-11-23 08:10:25,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:10:25,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329764991] [2023-11-23 08:10:25,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329764991] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:10:25,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:10:25,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 08:10:25,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017660290] [2023-11-23 08:10:25,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:10:25,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:10:25,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:10:25,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:10:25,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 08:10:25,971 INFO L87 Difference]: Start difference. First operand 131 states and 176 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-23 08:10:26,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:10:26,437 INFO L93 Difference]: Finished difference Result 261 states and 360 transitions. [2023-11-23 08:10:26,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:10:26,438 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 136 [2023-11-23 08:10:26,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:10:26,439 INFO L225 Difference]: With dead ends: 261 [2023-11-23 08:10:26,439 INFO L226 Difference]: Without dead ends: 156 [2023-11-23 08:10:26,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2023-11-23 08:10:26,440 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 186 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 08:10:26,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 334 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 08:10:26,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-11-23 08:10:26,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 136. [2023-11-23 08:10:26,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 86 states have (on average 1.2325581395348837) internal successors, (106), 88 states have internal predecessors, (106), 37 states have call successors, (37), 11 states have call predecessors, (37), 12 states have return successors, (40), 36 states have call predecessors, (40), 36 states have call successors, (40) [2023-11-23 08:10:26,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 183 transitions. [2023-11-23 08:10:26,453 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 183 transitions. Word has length 136 [2023-11-23 08:10:26,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:10:26,454 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 183 transitions. [2023-11-23 08:10:26,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-23 08:10:26,454 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 183 transitions. [2023-11-23 08:10:26,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-23 08:10:26,455 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:10:26,455 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:10:26,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 08:10:26,455 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:10:26,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:10:26,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1425333423, now seen corresponding path program 1 times [2023-11-23 08:10:26,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:10:26,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112905811] [2023-11-23 08:10:26,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:10:26,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:10:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:29,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:10:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:29,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:10:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:29,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:10:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:29,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:10:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:29,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:10:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:29,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:10:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:29,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:10:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:29,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:10:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:29,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:10:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:29,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:10:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:29,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:10:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:29,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:10:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:29,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:10:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:29,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:10:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:29,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 08:10:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:29,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-23 08:10:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:29,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 08:10:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:29,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:10:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:29,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:10:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:29,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-23 08:10:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:29,532 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2023-11-23 08:10:29,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:10:29,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112905811] [2023-11-23 08:10:29,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112905811] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:10:29,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194812306] [2023-11-23 08:10:29,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:10:29,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:10:29,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:10:29,534 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-11-23 08:10:29,563 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-11-23 08:10:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:29,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 2750 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-23 08:10:29,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:10:30,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-23 08:10:30,317 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-11-23 08:10:30,317 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:10:30,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194812306] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:10:30,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:10:30,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18] total 27 [2023-11-23 08:10:30,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278039287] [2023-11-23 08:10:30,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:10:30,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 08:10:30,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:10:30,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 08:10:30,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2023-11-23 08:10:30,319 INFO L87 Difference]: Start difference. First operand 136 states and 183 transitions. Second operand has 11 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-23 08:10:32,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:34,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:37,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:39,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:41,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:43,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:10:43,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:10:43,544 INFO L93 Difference]: Finished difference Result 355 states and 477 transitions. [2023-11-23 08:10:43,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-23 08:10:43,545 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 136 [2023-11-23 08:10:43,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:10:43,546 INFO L225 Difference]: With dead ends: 355 [2023-11-23 08:10:43,546 INFO L226 Difference]: Without dead ends: 245 [2023-11-23 08:10:43,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2023-11-23 08:10:43,548 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 166 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 7 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:10:43,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1599 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 586 Invalid, 6 Unknown, 0 Unchecked, 13.1s Time] [2023-11-23 08:10:43,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2023-11-23 08:10:43,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2023-11-23 08:10:43,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 158 states have (on average 1.2468354430379747) internal successors, (197), 161 states have internal predecessors, (197), 62 states have call successors, (62), 20 states have call predecessors, (62), 22 states have return successors, (68), 61 states have call predecessors, (68), 60 states have call successors, (68) [2023-11-23 08:10:43,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 327 transitions. [2023-11-23 08:10:43,574 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 327 transitions. Word has length 136 [2023-11-23 08:10:43,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:10:43,574 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 327 transitions. [2023-11-23 08:10:43,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-23 08:10:43,575 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 327 transitions. [2023-11-23 08:10:43,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-23 08:10:43,576 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:10:43,577 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:10:43,594 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-11-23 08:10:43,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:10:43,792 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:10:43,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:10:43,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1858909079, now seen corresponding path program 2 times [2023-11-23 08:10:43,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:10:43,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834929452] [2023-11-23 08:10:43,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:10:43,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:10:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:44,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:10:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:44,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:10:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:44,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:10:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:44,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:10:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:44,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:10:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:44,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:10:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:44,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:10:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:44,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:10:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:44,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:10:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:44,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:10:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:44,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 08:10:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:44,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 08:10:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:44,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 08:10:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:44,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 08:10:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:44,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 08:10:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:44,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-23 08:10:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:44,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-23 08:10:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:44,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:10:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:44,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:10:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:44,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-23 08:10:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:10:44,786 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 15 proven. 19 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2023-11-23 08:10:44,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:10:44,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834929452] [2023-11-23 08:10:44,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834929452] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:10:44,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671441610] [2023-11-23 08:10:44,787 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 08:10:44,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:10:44,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:10:44,788 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-11-23 08:10:44,792 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-11-23 08:10:45,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 08:10:45,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 08:10:45,219 INFO L262 TraceCheckSpWp]: Trace formula consists of 2757 conjuncts, 80 conjunts are in the unsatisfiable core [2023-11-23 08:10:45,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:10:45,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-23 08:10:45,638 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-23 08:10:45,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2023-11-23 08:10:45,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-23 08:10:46,897 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 127 proven. 3 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-11-23 08:10:46,898 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:10:47,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2023-11-23 08:10:52,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671441610] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:10:52,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:10:52,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 20] total 30 [2023-11-23 08:10:52,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297733571] [2023-11-23 08:10:52,217 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:10:52,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-23 08:10:52,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:10:52,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-23 08:10:52,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1897, Unknown=3, NotChecked=0, Total=2070 [2023-11-23 08:10:52,220 INFO L87 Difference]: Start difference. First operand 243 states and 327 transitions. Second operand has 30 states, 25 states have (on average 4.84) internal successors, (121), 26 states have internal predecessors, (121), 10 states have call successors, (39), 7 states have call predecessors, (39), 9 states have return successors, (38), 9 states have call predecessors, (38), 10 states have call successors, (38) [2023-11-23 08:10:59,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:10:59,614 INFO L93 Difference]: Finished difference Result 631 states and 843 transitions. [2023-11-23 08:10:59,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-11-23 08:10:59,615 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 4.84) internal successors, (121), 26 states have internal predecessors, (121), 10 states have call successors, (39), 7 states have call predecessors, (39), 9 states have return successors, (38), 9 states have call predecessors, (38), 10 states have call successors, (38) Word has length 140 [2023-11-23 08:10:59,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:10:59,618 INFO L225 Difference]: With dead ends: 631 [2023-11-23 08:10:59,618 INFO L226 Difference]: Without dead ends: 404 [2023-11-23 08:10:59,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 241 SyntacticMatches, 25 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2636 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=1549, Invalid=9368, Unknown=3, NotChecked=0, Total=10920 [2023-11-23 08:10:59,622 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 671 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 4053 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 4333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 4053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-11-23 08:10:59,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 1369 Invalid, 4333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 4053 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-11-23 08:10:59,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2023-11-23 08:10:59,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 366. [2023-11-23 08:10:59,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 249 states have (on average 1.2610441767068272) internal successors, (314), 255 states have internal predecessors, (314), 83 states have call successors, (83), 28 states have call predecessors, (83), 33 states have return successors, (94), 82 states have call predecessors, (94), 80 states have call successors, (94) [2023-11-23 08:10:59,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 491 transitions. [2023-11-23 08:10:59,651 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 491 transitions. Word has length 140 [2023-11-23 08:10:59,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:10:59,651 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 491 transitions. [2023-11-23 08:10:59,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 4.84) internal successors, (121), 26 states have internal predecessors, (121), 10 states have call successors, (39), 7 states have call predecessors, (39), 9 states have return successors, (38), 9 states have call predecessors, (38), 10 states have call successors, (38) [2023-11-23 08:10:59,651 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 491 transitions. [2023-11-23 08:10:59,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-23 08:10:59,654 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:10:59,654 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:10:59,672 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-11-23 08:10:59,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:10:59,864 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:10:59,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:10:59,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1352029886, now seen corresponding path program 1 times [2023-11-23 08:10:59,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:10:59,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542023200] [2023-11-23 08:10:59,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:10:59,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:10:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:00,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:00,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:11:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:00,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:11:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:00,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:00,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:11:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:00,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:11:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:00,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:11:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:00,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:11:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:00,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:00,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:11:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:00,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:11:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:00,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:11:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:00,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:11:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:00,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 08:11:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:00,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-23 08:11:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:00,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 08:11:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:00,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-23 08:11:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:00,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:00,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:11:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:00,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-23 08:11:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:00,163 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2023-11-23 08:11:00,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:11:00,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542023200] [2023-11-23 08:11:00,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542023200] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:11:00,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10588276] [2023-11-23 08:11:00,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:11:00,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:11:00,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:11:00,165 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-11-23 08:11:00,166 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-11-23 08:11:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:00,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 2757 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 08:11:00,550 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:11:00,556 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2023-11-23 08:11:00,556 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:11:00,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10588276] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:11:00,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:11:00,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-11-23 08:11:00,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930357452] [2023-11-23 08:11:00,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:11:00,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 08:11:00,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:11:00,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 08:11:00,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 08:11:00,558 INFO L87 Difference]: Start difference. First operand 366 states and 491 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-23 08:11:00,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:11:00,635 INFO L93 Difference]: Finished difference Result 727 states and 983 transitions. [2023-11-23 08:11:00,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:11:00,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 142 [2023-11-23 08:11:00,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:11:00,638 INFO L225 Difference]: With dead ends: 727 [2023-11-23 08:11:00,638 INFO L226 Difference]: Without dead ends: 395 [2023-11-23 08:11:00,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 08:11:00,640 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 9 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:11:00,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 451 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:11:00,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2023-11-23 08:11:00,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 374. [2023-11-23 08:11:00,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 257 states have (on average 1.2529182879377432) internal successors, (322), 263 states have internal predecessors, (322), 83 states have call successors, (83), 28 states have call predecessors, (83), 33 states have return successors, (94), 82 states have call predecessors, (94), 80 states have call successors, (94) [2023-11-23 08:11:00,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 499 transitions. [2023-11-23 08:11:00,680 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 499 transitions. Word has length 142 [2023-11-23 08:11:00,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:11:00,680 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 499 transitions. [2023-11-23 08:11:00,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-23 08:11:00,681 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 499 transitions. [2023-11-23 08:11:00,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-23 08:11:00,682 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:11:00,682 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:11:00,698 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-11-23 08:11:00,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:11:00,882 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:11:00,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:11:00,883 INFO L85 PathProgramCache]: Analyzing trace with hash -794253954, now seen corresponding path program 1 times [2023-11-23 08:11:00,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:11:00,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904043188] [2023-11-23 08:11:00,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:11:00,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:11:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:01,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:01,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:11:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:01,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:11:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:01,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:01,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:11:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:01,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:11:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:01,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:11:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:01,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:11:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:01,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:01,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:11:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:01,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:11:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:01,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:11:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:01,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:11:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:01,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 08:11:01,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:01,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-23 08:11:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:01,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 08:11:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:01,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-23 08:11:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:01,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:01,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:11:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:01,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-23 08:11:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:01,169 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2023-11-23 08:11:01,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:11:01,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904043188] [2023-11-23 08:11:01,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904043188] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:11:01,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827569914] [2023-11-23 08:11:01,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:11:01,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:11:01,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:11:01,171 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-11-23 08:11:01,172 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-11-23 08:11:01,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:01,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 2759 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 08:11:01,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:11:01,575 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-23 08:11:01,576 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:11:01,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827569914] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:11:01,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:11:01,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-11-23 08:11:01,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223612855] [2023-11-23 08:11:01,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:11:01,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 08:11:01,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:11:01,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 08:11:01,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 08:11:01,578 INFO L87 Difference]: Start difference. First operand 374 states and 499 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-23 08:11:01,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:11:01,655 INFO L93 Difference]: Finished difference Result 770 states and 1035 transitions. [2023-11-23 08:11:01,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:11:01,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 142 [2023-11-23 08:11:01,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:11:01,659 INFO L225 Difference]: With dead ends: 770 [2023-11-23 08:11:01,659 INFO L226 Difference]: Without dead ends: 430 [2023-11-23 08:11:01,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 08:11:01,663 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 28 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:11:01,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 465 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:11:01,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2023-11-23 08:11:01,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 374. [2023-11-23 08:11:01,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 257 states have (on average 1.2373540856031129) internal successors, (318), 263 states have internal predecessors, (318), 83 states have call successors, (83), 28 states have call predecessors, (83), 33 states have return successors, (94), 82 states have call predecessors, (94), 80 states have call successors, (94) [2023-11-23 08:11:01,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 495 transitions. [2023-11-23 08:11:01,688 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 495 transitions. Word has length 142 [2023-11-23 08:11:01,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:11:01,688 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 495 transitions. [2023-11-23 08:11:01,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-23 08:11:01,689 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 495 transitions. [2023-11-23 08:11:01,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-23 08:11:01,690 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:11:01,690 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:11:01,707 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-11-23 08:11:01,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:11:01,895 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:11:01,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:11:01,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1082809276, now seen corresponding path program 2 times [2023-11-23 08:11:01,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:11:01,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414181974] [2023-11-23 08:11:01,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:11:01,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:11:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:03,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:03,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:11:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:03,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:11:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:03,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:03,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:11:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:03,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:11:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:03,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:11:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:03,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:11:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:04,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:04,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:11:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:04,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:11:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:04,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:11:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:04,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:11:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:04,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 08:11:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:04,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-23 08:11:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:04,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 08:11:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:04,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-23 08:11:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:04,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:04,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:11:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:04,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-23 08:11:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:04,428 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2023-11-23 08:11:04,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:11:04,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414181974] [2023-11-23 08:11:04,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414181974] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:11:04,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789120030] [2023-11-23 08:11:04,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 08:11:04,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:11:04,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:11:04,429 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-11-23 08:11:04,431 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-11-23 08:11:04,805 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 08:11:04,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 08:11:04,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 2754 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-23 08:11:04,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:11:04,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-23 08:11:05,170 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-23 08:11:05,170 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:11:05,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789120030] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:11:05,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:11:05,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [19] total 26 [2023-11-23 08:11:05,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479753748] [2023-11-23 08:11:05,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:11:05,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-23 08:11:05,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:11:05,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 08:11:05,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2023-11-23 08:11:05,172 INFO L87 Difference]: Start difference. First operand 374 states and 495 transitions. Second operand has 13 states, 11 states have (on average 6.909090909090909) internal successors, (76), 12 states have internal predecessors, (76), 5 states have call successors, (20), 4 states have call predecessors, (20), 6 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2023-11-23 08:11:07,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:09,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:12,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:14,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:16,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:18,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:19,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:11:19,036 INFO L93 Difference]: Finished difference Result 384 states and 501 transitions. [2023-11-23 08:11:19,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 08:11:19,036 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.909090909090909) internal successors, (76), 12 states have internal predecessors, (76), 5 states have call successors, (20), 4 states have call predecessors, (20), 6 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 142 [2023-11-23 08:11:19,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:11:19,038 INFO L225 Difference]: With dead ends: 384 [2023-11-23 08:11:19,038 INFO L226 Difference]: Without dead ends: 257 [2023-11-23 08:11:19,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 169 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=1058, Unknown=0, NotChecked=0, Total=1190 [2023-11-23 08:11:19,039 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 195 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 1423 mSolverCounterSat, 82 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1423 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2023-11-23 08:11:19,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 731 Invalid, 1511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1423 Invalid, 6 Unknown, 0 Unchecked, 13.7s Time] [2023-11-23 08:11:19,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-11-23 08:11:19,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2023-11-23 08:11:19,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 168 states have (on average 1.2083333333333333) internal successors, (203), 172 states have internal predecessors, (203), 61 states have call successors, (61), 22 states have call predecessors, (61), 25 states have return successors, (68), 60 states have call predecessors, (68), 59 states have call successors, (68) [2023-11-23 08:11:19,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 332 transitions. [2023-11-23 08:11:19,052 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 332 transitions. Word has length 142 [2023-11-23 08:11:19,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:11:19,052 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 332 transitions. [2023-11-23 08:11:19,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.909090909090909) internal successors, (76), 12 states have internal predecessors, (76), 5 states have call successors, (20), 4 states have call predecessors, (20), 6 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2023-11-23 08:11:19,052 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 332 transitions. [2023-11-23 08:11:19,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-23 08:11:19,054 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:11:19,054 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:11:19,073 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-11-23 08:11:19,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:11:19,271 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:11:19,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:11:19,272 INFO L85 PathProgramCache]: Analyzing trace with hash -947878712, now seen corresponding path program 1 times [2023-11-23 08:11:19,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:11:19,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426372862] [2023-11-23 08:11:19,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:11:19,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:11:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:20,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:20,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:11:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:20,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:11:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:20,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:20,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:11:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:20,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:11:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:20,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:11:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:20,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:11:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:20,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:20,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:11:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:20,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:11:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:20,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:11:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:20,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:11:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:20,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 08:11:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:20,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 08:11:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:20,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 08:11:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:20,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-23 08:11:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:20,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 08:11:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:20,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:20,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:11:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:20,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-23 08:11:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:21,042 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-11-23 08:11:21,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:11:21,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426372862] [2023-11-23 08:11:21,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426372862] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:11:21,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103075659] [2023-11-23 08:11:21,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:11:21,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:11:21,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:11:21,044 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-11-23 08:11:21,067 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-11-23 08:11:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:21,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 2804 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-23 08:11:21,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:11:21,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-23 08:11:23,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 08:11:23,742 WARN L876 $PredicateComparison]: unable to prove that (exists ((|save_byte_from_array_~storage#1.base| Int)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |save_byte_from_array_~storage#1.base| (select |c_#memory_$Pointer$.offset| |save_byte_from_array_~storage#1.base|)))) is different from true [2023-11-23 08:11:23,753 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 08:11:23,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-23 08:11:24,551 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 154 proven. 17 refuted. 0 times theorem prover too weak. 89 trivial. 2 not checked. [2023-11-23 08:11:24,551 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:11:25,014 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-23 08:11:25,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2023-11-23 08:11:25,142 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-11-23 08:11:25,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103075659] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:11:25,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:11:25,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23, 11] total 40 [2023-11-23 08:11:25,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113444018] [2023-11-23 08:11:25,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:11:25,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-23 08:11:25,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:11:25,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-23 08:11:25,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1344, Unknown=2, NotChecked=74, Total=1560 [2023-11-23 08:11:25,145 INFO L87 Difference]: Start difference. First operand 255 states and 332 transitions. Second operand has 40 states, 37 states have (on average 4.4324324324324325) internal successors, (164), 37 states have internal predecessors, (164), 11 states have call successors, (51), 7 states have call predecessors, (51), 11 states have return successors, (50), 10 states have call predecessors, (50), 10 states have call successors, (50) [2023-11-23 08:11:28,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:32,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:34,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:36,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:40,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:42,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:44,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:46,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:11:49,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:11:49,126 INFO L93 Difference]: Finished difference Result 501 states and 652 transitions. [2023-11-23 08:11:49,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-11-23 08:11:49,127 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 4.4324324324324325) internal successors, (164), 37 states have internal predecessors, (164), 11 states have call successors, (51), 7 states have call predecessors, (51), 11 states have return successors, (50), 10 states have call predecessors, (50), 10 states have call successors, (50) Word has length 148 [2023-11-23 08:11:49,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:11:49,129 INFO L225 Difference]: With dead ends: 501 [2023-11-23 08:11:49,129 INFO L226 Difference]: Without dead ends: 424 [2023-11-23 08:11:49,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 320 SyntacticMatches, 10 SemanticMatches, 82 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1873 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=1144, Invalid=5663, Unknown=3, NotChecked=162, Total=6972 [2023-11-23 08:11:49,131 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 1008 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 3774 mSolverCounterSat, 362 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 4639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 3774 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 495 IncrementalHoareTripleChecker+Unchecked, 18.5s IncrementalHoareTripleChecker+Time [2023-11-23 08:11:49,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 1364 Invalid, 4639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 3774 Invalid, 8 Unknown, 495 Unchecked, 18.5s Time] [2023-11-23 08:11:49,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2023-11-23 08:11:49,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 372. [2023-11-23 08:11:49,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 256 states have (on average 1.23046875) internal successors, (315), 261 states have internal predecessors, (315), 82 states have call successors, (82), 29 states have call predecessors, (82), 33 states have return successors, (90), 81 states have call predecessors, (90), 79 states have call successors, (90) [2023-11-23 08:11:49,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 487 transitions. [2023-11-23 08:11:49,153 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 487 transitions. Word has length 148 [2023-11-23 08:11:49,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:11:49,155 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 487 transitions. [2023-11-23 08:11:49,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 4.4324324324324325) internal successors, (164), 37 states have internal predecessors, (164), 11 states have call successors, (51), 7 states have call predecessors, (51), 11 states have return successors, (50), 10 states have call predecessors, (50), 10 states have call successors, (50) [2023-11-23 08:11:49,155 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 487 transitions. [2023-11-23 08:11:49,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-23 08:11:49,156 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:11:49,157 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:11:49,175 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-11-23 08:11:49,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-23 08:11:49,364 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:11:49,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:11:49,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1958995962, now seen corresponding path program 2 times [2023-11-23 08:11:49,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:11:49,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86101755] [2023-11-23 08:11:49,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:11:49,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:11:49,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:50,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:50,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:50,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:11:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:50,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:11:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:50,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:50,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:11:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:50,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:11:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:50,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:11:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:50,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:11:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:50,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:50,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:11:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:50,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:11:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:50,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:11:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:50,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:11:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:50,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 08:11:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:50,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 08:11:50,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:50,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 08:11:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:50,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-23 08:11:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:50,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 08:11:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:50,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:50,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:11:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:50,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-23 08:11:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:50,493 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2023-11-23 08:11:50,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:11:50,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86101755] [2023-11-23 08:11:50,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86101755] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:11:50,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:11:50,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-23 08:11:50,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031437073] [2023-11-23 08:11:50,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:11:50,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-23 08:11:50,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:11:50,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-23 08:11:50,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2023-11-23 08:11:50,508 INFO L87 Difference]: Start difference. First operand 372 states and 487 transitions. Second operand has 15 states, 14 states have (on average 4.642857142857143) internal successors, (65), 13 states have internal predecessors, (65), 5 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2023-11-23 08:11:51,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:11:51,712 INFO L93 Difference]: Finished difference Result 700 states and 914 transitions. [2023-11-23 08:11:51,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 08:11:51,713 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.642857142857143) internal successors, (65), 13 states have internal predecessors, (65), 5 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 148 [2023-11-23 08:11:51,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:11:51,717 INFO L225 Difference]: With dead ends: 700 [2023-11-23 08:11:51,717 INFO L226 Difference]: Without dead ends: 467 [2023-11-23 08:11:51,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2023-11-23 08:11:51,719 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 200 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-23 08:11:51,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 790 Invalid, 1524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-23 08:11:51,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2023-11-23 08:11:51,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 422. [2023-11-23 08:11:51,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 295 states have (on average 1.2169491525423728) internal successors, (359), 308 states have internal predecessors, (359), 85 states have call successors, (85), 29 states have call predecessors, (85), 41 states have return successors, (111), 84 states have call predecessors, (111), 82 states have call successors, (111) [2023-11-23 08:11:51,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 555 transitions. [2023-11-23 08:11:51,743 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 555 transitions. Word has length 148 [2023-11-23 08:11:51,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:11:51,743 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 555 transitions. [2023-11-23 08:11:51,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.642857142857143) internal successors, (65), 13 states have internal predecessors, (65), 5 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2023-11-23 08:11:51,744 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 555 transitions. [2023-11-23 08:11:51,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-23 08:11:51,746 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:11:51,746 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:11:51,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 08:11:51,746 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:11:51,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:11:51,747 INFO L85 PathProgramCache]: Analyzing trace with hash 613838402, now seen corresponding path program 1 times [2023-11-23 08:11:51,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:11:51,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987524081] [2023-11-23 08:11:51,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:11:51,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:11:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:52,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:52,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:11:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:52,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:11:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:52,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:52,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:11:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:52,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:11:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:52,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:11:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:52,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:11:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:52,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:52,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:11:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:52,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:11:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:52,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:11:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:52,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:11:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:52,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 08:11:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:52,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 08:11:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:52,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 08:11:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:52,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-23 08:11:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:52,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 08:11:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:52,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:52,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:11:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:52,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-23 08:11:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:52,884 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2023-11-23 08:11:52,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:11:52,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987524081] [2023-11-23 08:11:52,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987524081] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:11:52,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:11:52,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-23 08:11:52,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028347637] [2023-11-23 08:11:52,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:11:52,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-23 08:11:52,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:11:52,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-23 08:11:52,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:11:52,889 INFO L87 Difference]: Start difference. First operand 422 states and 555 transitions. Second operand has 14 states, 13 states have (on average 5.0) internal successors, (65), 12 states have internal predecessors, (65), 5 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2023-11-23 08:11:53,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:11:53,839 INFO L93 Difference]: Finished difference Result 720 states and 938 transitions. [2023-11-23 08:11:53,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 08:11:53,840 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.0) internal successors, (65), 12 states have internal predecessors, (65), 5 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 148 [2023-11-23 08:11:53,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:11:53,842 INFO L225 Difference]: With dead ends: 720 [2023-11-23 08:11:53,842 INFO L226 Difference]: Without dead ends: 466 [2023-11-23 08:11:53,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2023-11-23 08:11:53,844 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 166 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 08:11:53,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 673 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1213 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 08:11:53,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2023-11-23 08:11:53,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 422. [2023-11-23 08:11:53,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 295 states have (on average 1.2169491525423728) internal successors, (359), 308 states have internal predecessors, (359), 85 states have call successors, (85), 29 states have call predecessors, (85), 41 states have return successors, (111), 84 states have call predecessors, (111), 82 states have call successors, (111) [2023-11-23 08:11:53,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 555 transitions. [2023-11-23 08:11:53,877 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 555 transitions. Word has length 148 [2023-11-23 08:11:53,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:11:53,878 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 555 transitions. [2023-11-23 08:11:53,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.0) internal successors, (65), 12 states have internal predecessors, (65), 5 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2023-11-23 08:11:53,878 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 555 transitions. [2023-11-23 08:11:53,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-23 08:11:53,879 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:11:53,879 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:11:53,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 08:11:53,879 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:11:53,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:11:53,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1314902980, now seen corresponding path program 3 times [2023-11-23 08:11:53,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:11:53,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839509171] [2023-11-23 08:11:53,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:11:53,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:11:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:54,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:54,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:11:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:54,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:11:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:54,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:54,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:11:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:54,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:11:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:54,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:11:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:54,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:11:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:54,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:54,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:11:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:54,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:11:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:54,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:11:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:54,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:11:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:54,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 08:11:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:54,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 08:11:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:54,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 08:11:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:54,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-23 08:11:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:54,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 08:11:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:54,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:54,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:11:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:54,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-23 08:11:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:54,519 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2023-11-23 08:11:54,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:11:54,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839509171] [2023-11-23 08:11:54,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839509171] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:11:54,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:11:54,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 08:11:54,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958936189] [2023-11-23 08:11:54,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:11:54,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:11:54,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:11:54,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:11:54,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 08:11:54,521 INFO L87 Difference]: Start difference. First operand 422 states and 555 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-23 08:11:54,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:11:54,922 INFO L93 Difference]: Finished difference Result 757 states and 1007 transitions. [2023-11-23 08:11:54,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 08:11:54,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2023-11-23 08:11:54,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:11:54,924 INFO L225 Difference]: With dead ends: 757 [2023-11-23 08:11:54,924 INFO L226 Difference]: Without dead ends: 446 [2023-11-23 08:11:54,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-23 08:11:54,925 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 131 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:11:54,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 280 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:11:54,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2023-11-23 08:11:54,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 420. [2023-11-23 08:11:54,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 293 states have (on average 1.204778156996587) internal successors, (353), 306 states have internal predecessors, (353), 85 states have call successors, (85), 29 states have call predecessors, (85), 41 states have return successors, (111), 84 states have call predecessors, (111), 82 states have call successors, (111) [2023-11-23 08:11:54,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 549 transitions. [2023-11-23 08:11:54,945 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 549 transitions. Word has length 148 [2023-11-23 08:11:54,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:11:54,946 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 549 transitions. [2023-11-23 08:11:54,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-23 08:11:54,946 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 549 transitions. [2023-11-23 08:11:54,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-23 08:11:54,947 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:11:54,947 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:11:54,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 08:11:54,947 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:11:54,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:11:54,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1394450425, now seen corresponding path program 1 times [2023-11-23 08:11:54,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:11:54,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641413353] [2023-11-23 08:11:54,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:11:54,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:11:55,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:55,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:55,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:11:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:55,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:11:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:55,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:55,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:11:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:55,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:11:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:55,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:11:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:55,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:11:55,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:55,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:55,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:11:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:55,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:11:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:55,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:11:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:55,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:11:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:55,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 08:11:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:55,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 08:11:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:55,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 08:11:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:55,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-23 08:11:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:55,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 08:11:55,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:55,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:11:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:55,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:11:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:55,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-23 08:11:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:55,799 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2023-11-23 08:11:55,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:11:55,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641413353] [2023-11-23 08:11:55,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641413353] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:11:55,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718187005] [2023-11-23 08:11:55,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:11:55,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:11:55,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:11:55,800 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:11:55,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-23 08:11:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:11:56,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 2803 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-23 08:11:56,222 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:11:56,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-23 08:11:56,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-23 08:11:58,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 08:11:58,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-23 08:11:58,533 WARN L876 $PredicateComparison]: unable to prove that (exists ((|save_byte_from_array_~storage#1.base| Int)) (= (store |c_old(#memory_$Pointer$.base)| |save_byte_from_array_~storage#1.base| (select |c_#memory_$Pointer$.base| |save_byte_from_array_~storage#1.base|)) |c_#memory_$Pointer$.base|)) is different from true [2023-11-23 08:11:58,561 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 08:11:58,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2023-11-23 08:11:59,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-23 08:11:59,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-23 08:11:59,283 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 94 proven. 46 refuted. 0 times theorem prover too weak. 120 trivial. 2 not checked. [2023-11-23 08:11:59,284 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:11:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2023-11-23 08:11:59,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718187005] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:11:59,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:11:59,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 25, 12] total 38 [2023-11-23 08:11:59,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767910642] [2023-11-23 08:11:59,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:11:59,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-23 08:11:59,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:11:59,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-23 08:11:59,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1200, Unknown=2, NotChecked=70, Total=1406 [2023-11-23 08:11:59,762 INFO L87 Difference]: Start difference. First operand 420 states and 549 transitions. Second operand has 38 states, 34 states have (on average 4.0588235294117645) internal successors, (138), 35 states have internal predecessors, (138), 14 states have call successors, (45), 7 states have call predecessors, (45), 10 states have return successors, (40), 12 states have call predecessors, (40), 14 states have call successors, (40) [2023-11-23 08:12:03,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:12:07,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:12:09,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:12:11,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:12:15,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:12:17,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:12:19,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:12:22,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:12:25,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:12:25,622 INFO L93 Difference]: Finished difference Result 911 states and 1165 transitions. [2023-11-23 08:12:25,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-11-23 08:12:25,622 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 34 states have (on average 4.0588235294117645) internal successors, (138), 35 states have internal predecessors, (138), 14 states have call successors, (45), 7 states have call predecessors, (45), 10 states have return successors, (40), 12 states have call predecessors, (40), 14 states have call successors, (40) Word has length 148 [2023-11-23 08:12:25,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:12:25,625 INFO L225 Difference]: With dead ends: 911 [2023-11-23 08:12:25,625 INFO L226 Difference]: Without dead ends: 593 [2023-11-23 08:12:25,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 319 SyntacticMatches, 13 SemanticMatches, 106 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3342 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=1610, Invalid=9728, Unknown=8, NotChecked=210, Total=11556 [2023-11-23 08:12:25,630 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 1124 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 4014 mSolverCounterSat, 425 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 5009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 425 IncrementalHoareTripleChecker+Valid, 4014 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 552 IncrementalHoareTripleChecker+Unchecked, 18.7s IncrementalHoareTripleChecker+Time [2023-11-23 08:12:25,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 1145 Invalid, 5009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [425 Valid, 4014 Invalid, 18 Unknown, 552 Unchecked, 18.7s Time] [2023-11-23 08:12:25,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2023-11-23 08:12:25,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 545. [2023-11-23 08:12:25,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 386 states have (on average 1.1865284974093264) internal successors, (458), 399 states have internal predecessors, (458), 109 states have call successors, (109), 37 states have call predecessors, (109), 49 states have return successors, (138), 108 states have call predecessors, (138), 105 states have call successors, (138) [2023-11-23 08:12:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 705 transitions. [2023-11-23 08:12:25,659 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 705 transitions. Word has length 148 [2023-11-23 08:12:25,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:12:25,659 INFO L495 AbstractCegarLoop]: Abstraction has 545 states and 705 transitions. [2023-11-23 08:12:25,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 34 states have (on average 4.0588235294117645) internal successors, (138), 35 states have internal predecessors, (138), 14 states have call successors, (45), 7 states have call predecessors, (45), 10 states have return successors, (40), 12 states have call predecessors, (40), 14 states have call successors, (40) [2023-11-23 08:12:25,660 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 705 transitions. [2023-11-23 08:12:25,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-23 08:12:25,661 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:12:25,662 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:12:25,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-23 08:12:25,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-23 08:12:25,876 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:12:25,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:12:25,877 INFO L85 PathProgramCache]: Analyzing trace with hash -557994854, now seen corresponding path program 1 times [2023-11-23 08:12:25,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:12:25,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259461295] [2023-11-23 08:12:25,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:12:25,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:12:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:28,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:12:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:28,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:12:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:28,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:12:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:28,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:12:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:28,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:12:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:28,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:12:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:28,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:12:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:28,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:12:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:28,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:12:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:28,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:12:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:28,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:12:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:28,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:12:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:28,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:12:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:28,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 08:12:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:28,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 08:12:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:28,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 08:12:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:28,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-23 08:12:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:28,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 08:12:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:28,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:12:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:28,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:12:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:28,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-23 08:12:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:28,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-11-23 08:12:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:28,949 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 22 proven. 32 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2023-11-23 08:12:28,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:12:28,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259461295] [2023-11-23 08:12:28,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259461295] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:12:28,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496963935] [2023-11-23 08:12:28,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:12:28,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:12:28,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:12:28,951 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:12:28,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-23 08:12:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:29,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 2813 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-23 08:12:29,407 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:12:29,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 08:12:29,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 08:12:29,620 WARN L876 $PredicateComparison]: unable to prove that (exists ((|bounded_malloc_#res.base| Int)) (= |c_#valid| (store |c_old(#valid)| |bounded_malloc_#res.base| 1))) is different from true [2023-11-23 08:12:29,629 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-23 08:12:29,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-23 08:12:29,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 08:12:29,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:12:29,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-23 08:12:30,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-23 08:12:30,401 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-23 08:12:30,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-23 08:12:30,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:12:30,420 INFO L349 Elim1Store]: treesize reduction 55, result has 1.8 percent of original size [2023-11-23 08:12:30,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 1 [2023-11-23 08:12:30,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-23 08:12:30,520 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 08:12:30,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-23 08:12:30,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 08:12:32,681 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_27| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_27|) (+ |v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.offset_BEFORE_CALL_28| 8)))) (and (not (= .cse0 0)) (<= (+ 2 .cse0) |v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_27|)))) is different from true [2023-11-23 08:12:34,769 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_28| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_28|) (+ |v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.offset_BEFORE_CALL_29| 8)))) (and (<= (+ 2 .cse0) |v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_28|) (not (= .cse0 0))))) is different from true [2023-11-23 08:12:36,838 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.offset_BEFORE_CALL_30| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_29|) (+ |v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.offset_BEFORE_CALL_30| 8)))) (and (<= (+ 2 .cse0) |v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_29|) (not (= .cse0 0))))) is different from true [2023-11-23 08:12:38,914 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_30| Int) (|v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.offset_BEFORE_CALL_31| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_30|) (+ |v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.offset_BEFORE_CALL_31| 8)))) (and (not (= .cse0 0)) (<= (+ 2 .cse0) |v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_30|)))) is different from true [2023-11-23 08:12:41,029 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_31| Int) (|v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.offset_BEFORE_CALL_32| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_31|) (+ |v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.offset_BEFORE_CALL_32| 8)))) (and (<= (+ 2 .cse0) |v_ULTIMATE.start_aws_byte_buf_eq_c_str_~buf#1.base_BEFORE_CALL_31|) (not (= .cse0 0))))) is different from true [2023-11-23 08:12:41,363 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 64 proven. 57 refuted. 0 times theorem prover too weak. 33 trivial. 106 not checked. [2023-11-23 08:12:41,363 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:12:45,641 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1072 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#old_byte_from_str~0#1.base| v_ArrVal_1072) |c_ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#buf~3#1.base|) (+ |c_ULTIMATE.start_aws_byte_buf_eq_c_str_harness_~#buf~3#1.offset| 8))))) is different from false [2023-11-23 08:12:45,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496963935] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:12:45,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:12:45,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 48 [2023-11-23 08:12:45,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945431917] [2023-11-23 08:12:45,642 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:12:45,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-23 08:12:45,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:12:45,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-23 08:12:45,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2109, Unknown=9, NotChecked=686, Total=2970 [2023-11-23 08:12:45,646 INFO L87 Difference]: Start difference. First operand 545 states and 705 transitions. Second operand has 48 states, 39 states have (on average 3.8205128205128207) internal successors, (149), 40 states have internal predecessors, (149), 18 states have call successors, (41), 14 states have call predecessors, (41), 17 states have return successors, (40), 17 states have call predecessors, (40), 18 states have call successors, (40) [2023-11-23 08:12:50,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:12:52,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:12:54,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:12:57,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:12:57,885 INFO L93 Difference]: Finished difference Result 901 states and 1166 transitions. [2023-11-23 08:12:57,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-23 08:12:57,890 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 39 states have (on average 3.8205128205128207) internal successors, (149), 40 states have internal predecessors, (149), 18 states have call successors, (41), 14 states have call predecessors, (41), 17 states have return successors, (40), 17 states have call predecessors, (40), 18 states have call successors, (40) Word has length 151 [2023-11-23 08:12:57,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:12:57,893 INFO L225 Difference]: With dead ends: 901 [2023-11-23 08:12:57,893 INFO L226 Difference]: Without dead ends: 770 [2023-11-23 08:12:57,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 216 SyntacticMatches, 25 SemanticMatches, 85 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1901 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=620, Invalid=5719, Unknown=9, NotChecked=1134, Total=7482 [2023-11-23 08:12:57,895 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 834 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 5536 mSolverCounterSat, 498 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 8226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 5536 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 2189 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2023-11-23 08:12:57,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 1672 Invalid, 8226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 5536 Invalid, 3 Unknown, 2189 Unchecked, 10.5s Time] [2023-11-23 08:12:57,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2023-11-23 08:12:57,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 765. [2023-11-23 08:12:57,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 546 states have (on average 1.1831501831501832) internal successors, (646), 562 states have internal predecessors, (646), 153 states have call successors, (153), 50 states have call predecessors, (153), 65 states have return successors, (189), 152 states have call predecessors, (189), 147 states have call successors, (189) [2023-11-23 08:12:57,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 988 transitions. [2023-11-23 08:12:57,942 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 988 transitions. Word has length 151 [2023-11-23 08:12:57,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:12:57,943 INFO L495 AbstractCegarLoop]: Abstraction has 765 states and 988 transitions. [2023-11-23 08:12:57,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 39 states have (on average 3.8205128205128207) internal successors, (149), 40 states have internal predecessors, (149), 18 states have call successors, (41), 14 states have call predecessors, (41), 17 states have return successors, (40), 17 states have call predecessors, (40), 18 states have call successors, (40) [2023-11-23 08:12:57,943 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 988 transitions. [2023-11-23 08:12:57,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-23 08:12:57,945 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:12:57,945 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:12:57,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-23 08:12:58,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-23 08:12:58,161 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:12:58,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:12:58,161 INFO L85 PathProgramCache]: Analyzing trace with hash 417270020, now seen corresponding path program 1 times [2023-11-23 08:12:58,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:12:58,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803823236] [2023-11-23 08:12:58,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:12:58,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:12:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:58,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:12:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:58,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:12:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:58,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:12:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:58,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:12:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:58,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:12:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:58,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:12:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:58,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:12:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:58,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:12:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:58,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:12:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:58,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:12:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:58,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:12:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:58,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:12:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:58,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:12:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:58,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 08:12:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:58,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-23 08:12:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:58,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-23 08:12:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:58,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-23 08:12:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:58,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:12:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:58,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:12:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:58,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-23 08:12:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:58,742 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2023-11-23 08:12:58,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:12:58,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803823236] [2023-11-23 08:12:58,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803823236] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:12:58,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865142623] [2023-11-23 08:12:58,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:12:58,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:12:58,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:12:58,744 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:12:58,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-23 08:12:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:12:59,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 2766 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-23 08:12:59,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:12:59,195 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2023-11-23 08:12:59,195 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:12:59,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865142623] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:12:59,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:12:59,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 12 [2023-11-23 08:12:59,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314500321] [2023-11-23 08:12:59,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:12:59,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 08:12:59,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:12:59,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 08:12:59,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-11-23 08:12:59,197 INFO L87 Difference]: Start difference. First operand 765 states and 988 transitions. Second operand has 9 states, 7 states have (on average 10.428571428571429) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-23 08:12:59,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:12:59,392 INFO L93 Difference]: Finished difference Result 1358 states and 1750 transitions. [2023-11-23 08:12:59,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:12:59,393 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 10.428571428571429) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 146 [2023-11-23 08:12:59,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:12:59,396 INFO L225 Difference]: With dead ends: 1358 [2023-11-23 08:12:59,396 INFO L226 Difference]: Without dead ends: 694 [2023-11-23 08:12:59,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-11-23 08:12:59,398 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 13 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:12:59,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1105 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:12:59,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2023-11-23 08:12:59,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 661. [2023-11-23 08:12:59,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 464 states have (on average 1.1982758620689655) internal successors, (556), 479 states have internal predecessors, (556), 137 states have call successors, (137), 45 states have call predecessors, (137), 59 states have return successors, (162), 136 states have call predecessors, (162), 131 states have call successors, (162) [2023-11-23 08:12:59,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 855 transitions. [2023-11-23 08:12:59,440 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 855 transitions. Word has length 146 [2023-11-23 08:12:59,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:12:59,440 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 855 transitions. [2023-11-23 08:12:59,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 10.428571428571429) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-23 08:12:59,441 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 855 transitions. [2023-11-23 08:12:59,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-23 08:12:59,442 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:12:59,442 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:12:59,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-23 08:12:59,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-23 08:12:59,659 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:12:59,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:12:59,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1143702031, now seen corresponding path program 2 times [2023-11-23 08:12:59,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:12:59,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687089278] [2023-11-23 08:12:59,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:12:59,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:13:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:01,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:13:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:01,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:13:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:01,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:13:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:01,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:13:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:01,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:13:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:01,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:13:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:01,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:13:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:01,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:13:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:01,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:13:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:01,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:13:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:01,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:13:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:01,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:13:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:01,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:13:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:01,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 08:13:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:01,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 08:13:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:01,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-23 08:13:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:01,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 08:13:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:01,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:13:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:01,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:13:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:01,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-23 08:13:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:01,917 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 13 proven. 27 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2023-11-23 08:13:01,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:13:01,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687089278] [2023-11-23 08:13:01,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687089278] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:13:01,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223977538] [2023-11-23 08:13:01,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 08:13:01,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:13:01,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:13:01,919 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:13:01,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-23 08:13:02,447 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 08:13:02,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 08:13:02,459 INFO L262 TraceCheckSpWp]: Trace formula consists of 2768 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-23 08:13:02,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:13:03,053 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 116 proven. 27 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2023-11-23 08:13:03,053 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:13:03,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-23 08:13:03,475 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-23 08:13:03,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2023-11-23 08:13:03,495 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 13 proven. 28 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2023-11-23 08:13:03,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223977538] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:13:03,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:13:03,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 29 [2023-11-23 08:13:03,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111043836] [2023-11-23 08:13:03,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:13:03,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-23 08:13:03,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:13:03,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-23 08:13:03,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2023-11-23 08:13:03,497 INFO L87 Difference]: Start difference. First operand 661 states and 855 transitions. Second operand has 29 states, 29 states have (on average 5.482758620689655) internal successors, (159), 27 states have internal predecessors, (159), 8 states have call successors, (48), 7 states have call predecessors, (48), 9 states have return successors, (44), 8 states have call predecessors, (44), 7 states have call successors, (44) [2023-11-23 08:13:05,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:13:07,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:13:09,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:13:12,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:13:14,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:13:16,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:13:17,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:13:17,912 INFO L93 Difference]: Finished difference Result 1206 states and 1545 transitions. [2023-11-23 08:13:17,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-23 08:13:17,913 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 5.482758620689655) internal successors, (159), 27 states have internal predecessors, (159), 8 states have call successors, (48), 7 states have call predecessors, (48), 9 states have return successors, (44), 8 states have call predecessors, (44), 7 states have call successors, (44) Word has length 148 [2023-11-23 08:13:17,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:13:17,915 INFO L225 Difference]: With dead ends: 1206 [2023-11-23 08:13:17,915 INFO L226 Difference]: Without dead ends: 687 [2023-11-23 08:13:17,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 311 SyntacticMatches, 15 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=339, Invalid=1722, Unknown=9, NotChecked=0, Total=2070 [2023-11-23 08:13:17,917 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 492 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 2735 mSolverCounterSat, 252 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 3002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 2735 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2023-11-23 08:13:17,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 714 Invalid, 3002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 2735 Invalid, 15 Unknown, 0 Unchecked, 13.8s Time] [2023-11-23 08:13:17,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2023-11-23 08:13:18,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 572. [2023-11-23 08:13:18,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 398 states have (on average 1.178391959798995) internal successors, (469), 412 states have internal predecessors, (469), 119 states have call successors, (119), 41 states have call predecessors, (119), 54 states have return successors, (141), 118 states have call predecessors, (141), 114 states have call successors, (141) [2023-11-23 08:13:18,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 729 transitions. [2023-11-23 08:13:18,015 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 729 transitions. Word has length 148 [2023-11-23 08:13:18,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:13:18,015 INFO L495 AbstractCegarLoop]: Abstraction has 572 states and 729 transitions. [2023-11-23 08:13:18,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.482758620689655) internal successors, (159), 27 states have internal predecessors, (159), 8 states have call successors, (48), 7 states have call predecessors, (48), 9 states have return successors, (44), 8 states have call predecessors, (44), 7 states have call successors, (44) [2023-11-23 08:13:18,016 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 729 transitions. [2023-11-23 08:13:18,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-23 08:13:18,017 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:13:18,017 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:13:18,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-23 08:13:18,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-23 08:13:18,253 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:13:18,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:13:18,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1763898236, now seen corresponding path program 1 times [2023-11-23 08:13:18,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:13:18,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813670185] [2023-11-23 08:13:18,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:13:18,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:13:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:19,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:13:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:19,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:13:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:19,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:13:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:19,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:13:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:19,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:13:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:19,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:13:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:19,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:13:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:19,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:13:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:19,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:13:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:19,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:13:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:19,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:13:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:19,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:13:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:19,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:13:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:19,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 08:13:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:19,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 08:13:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:19,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-23 08:13:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:19,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 08:13:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:19,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:13:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:19,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:13:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:19,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-23 08:13:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:19,953 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2023-11-23 08:13:19,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:13:19,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813670185] [2023-11-23 08:13:19,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813670185] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:13:19,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138594983] [2023-11-23 08:13:19,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:13:19,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:13:19,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:13:19,955 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:13:19,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-23 08:13:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:20,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 2769 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-23 08:13:20,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:13:20,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 08:13:20,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-23 08:13:21,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-23 08:13:21,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-23 08:13:21,508 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 49 proven. 131 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-23 08:13:21,508 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:13:22,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2023-11-23 08:13:22,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 08:13:22,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2023-11-23 08:13:22,390 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2023-11-23 08:13:22,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138594983] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:13:22,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:13:22,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21, 17] total 46 [2023-11-23 08:13:22,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597722824] [2023-11-23 08:13:22,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:13:22,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-11-23 08:13:22,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:13:22,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-11-23 08:13:22,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1891, Unknown=0, NotChecked=0, Total=2070 [2023-11-23 08:13:22,392 INFO L87 Difference]: Start difference. First operand 572 states and 729 transitions. Second operand has 46 states, 37 states have (on average 4.081081081081081) internal successors, (151), 39 states have internal predecessors, (151), 23 states have call successors, (52), 10 states have call predecessors, (52), 15 states have return successors, (51), 21 states have call predecessors, (51), 23 states have call successors, (51) [2023-11-23 08:13:25,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:13:27,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:13:29,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:13:31,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:13:34,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:13:38,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:13:38,163 INFO L93 Difference]: Finished difference Result 653 states and 825 transitions. [2023-11-23 08:13:38,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-23 08:13:38,164 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 37 states have (on average 4.081081081081081) internal successors, (151), 39 states have internal predecessors, (151), 23 states have call successors, (52), 10 states have call predecessors, (52), 15 states have return successors, (51), 21 states have call predecessors, (51), 23 states have call successors, (51) Word has length 148 [2023-11-23 08:13:38,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:13:38,175 INFO L225 Difference]: With dead ends: 653 [2023-11-23 08:13:38,175 INFO L226 Difference]: Without dead ends: 574 [2023-11-23 08:13:38,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 292 SyntacticMatches, 15 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1247 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=553, Invalid=4139, Unknown=0, NotChecked=0, Total=4692 [2023-11-23 08:13:38,178 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 688 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 4596 mSolverCounterSat, 394 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 5010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 4596 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2023-11-23 08:13:38,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 1330 Invalid, 5010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 4596 Invalid, 20 Unknown, 0 Unchecked, 14.6s Time] [2023-11-23 08:13:38,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2023-11-23 08:13:38,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 572. [2023-11-23 08:13:38,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 398 states have (on average 1.170854271356784) internal successors, (466), 411 states have internal predecessors, (466), 118 states have call successors, (118), 43 states have call predecessors, (118), 55 states have return successors, (138), 117 states have call predecessors, (138), 113 states have call successors, (138) [2023-11-23 08:13:38,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 722 transitions. [2023-11-23 08:13:38,225 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 722 transitions. Word has length 148 [2023-11-23 08:13:38,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:13:38,226 INFO L495 AbstractCegarLoop]: Abstraction has 572 states and 722 transitions. [2023-11-23 08:13:38,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 37 states have (on average 4.081081081081081) internal successors, (151), 39 states have internal predecessors, (151), 23 states have call successors, (52), 10 states have call predecessors, (52), 15 states have return successors, (51), 21 states have call predecessors, (51), 23 states have call successors, (51) [2023-11-23 08:13:38,230 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 722 transitions. [2023-11-23 08:13:38,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-23 08:13:38,231 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:13:38,231 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:13:38,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-23 08:13:38,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:13:38,441 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:13:38,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:13:38,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1364075866, now seen corresponding path program 2 times [2023-11-23 08:13:38,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:13:38,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909094419] [2023-11-23 08:13:38,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:13:38,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:13:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:39,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:13:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:39,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:13:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:39,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:13:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:39,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:13:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:39,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 08:13:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:39,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:13:39,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:39,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:13:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:39,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:13:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:39,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:13:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:39,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:13:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:40,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:13:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:40,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:13:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:40,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 08:13:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:40,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 08:13:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:40,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 08:13:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:40,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 08:13:40,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:40,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-23 08:13:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:40,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 08:13:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:40,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:13:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:40,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-23 08:13:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:40,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-23 08:13:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:40,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-11-23 08:13:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:13:40,407 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2023-11-23 08:13:40,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:13:40,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909094419] [2023-11-23 08:13:40,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909094419] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:13:40,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358662135] [2023-11-23 08:13:40,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 08:13:40,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:13:40,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:13:40,408 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:13:40,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-23 08:13:41,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 08:13:41,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 08:13:41,177 INFO L262 TraceCheckSpWp]: Trace formula consists of 2813 conjuncts, 77 conjunts are in the unsatisfiable core [2023-11-23 08:13:41,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:13:41,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 08:13:41,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-23 08:13:41,493 WARN L876 $PredicateComparison]: unable to prove that (exists ((|bounded_malloc_#res.base| Int)) (and (<= (+ |bounded_malloc_#res.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |bounded_malloc_#res.base| (select |c_#valid| |bounded_malloc_#res.base|))))) is different from true [2023-11-23 08:13:41,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:13:41,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-23 08:13:41,957 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-23 08:13:41,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-23 08:13:41,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 08:13:42,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 08:13:42,197 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-23 08:13:42,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-11-23 08:13:42,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 08:13:42,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 08:13:42,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-11-23 08:13:42,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-11-23 08:14:13,698 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 73 proven. 131 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-11-23 08:14:13,698 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:14:14,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358662135] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:14:14,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:14:14,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 22] total 34 [2023-11-23 08:14:14,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674493009] [2023-11-23 08:14:14,256 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:14:14,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-23 08:14:14,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:14:14,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-23 08:14:14,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1505, Unknown=16, NotChecked=78, Total=1722 [2023-11-23 08:14:14,258 INFO L87 Difference]: Start difference. First operand 572 states and 722 transitions. Second operand has 34 states, 29 states have (on average 4.827586206896552) internal successors, (140), 31 states have internal predecessors, (140), 14 states have call successors, (43), 9 states have call predecessors, (43), 12 states have return successors, (42), 12 states have call predecessors, (42), 14 states have call successors, (42) [2023-11-23 08:14:17,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:14:19,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:14:25,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:14:27,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:14:30,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:14:32,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:14:34,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] Killed by 15