./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_byte_cursor_compare_lexical_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_cursor_compare_lexical_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 60926facf5511174d61dcd6a0b7a731efc9ccdb495bc26b58400da4cd6320ca0 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 08:25:25,145 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 08:25:25,227 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 08:25:25,233 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 08:25:25,233 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 08:25:25,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 08:25:25,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 08:25:25,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 08:25:25,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 08:25:25,265 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 08:25:25,266 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 08:25:25,266 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 08:25:25,267 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 08:25:25,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 08:25:25,268 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 08:25:25,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 08:25:25,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 08:25:25,269 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 08:25:25,270 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 08:25:25,270 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 08:25:25,270 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 08:25:25,271 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 08:25:25,271 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 08:25:25,271 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 08:25:25,272 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 08:25:25,272 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 08:25:25,272 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 08:25:25,273 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 08:25:25,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:25:25,273 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 08:25:25,274 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 08:25:25,274 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 08:25:25,275 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 08:25:25,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 08:25:25,275 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 08:25:25,275 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 08:25:25,276 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 08:25:25,276 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 08:25:25,276 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 08:25:25,276 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 -> 60926facf5511174d61dcd6a0b7a731efc9ccdb495bc26b58400da4cd6320ca0 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 08:25:25,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 08:25:25,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 08:25:25,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 08:25:25,588 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 08:25:25,589 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 08:25:25,590 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_byte_cursor_compare_lexical_harness.i [2023-11-23 08:25:26,942 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 08:25:27,454 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 08:25:27,454 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_cursor_compare_lexical_harness.i [2023-11-23 08:25:27,495 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b25a1fff/e81ed35011dc4c51b20a36eda544a6ec/FLAG98556724e [2023-11-23 08:25:27,511 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b25a1fff/e81ed35011dc4c51b20a36eda544a6ec [2023-11-23 08:25:27,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 08:25:27,515 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 08:25:27,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 08:25:27,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 08:25:27,522 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 08:25:27,523 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:25:27" (1/1) ... [2023-11-23 08:25:27,524 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be404ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:25:27, skipping insertion in model container [2023-11-23 08:25:27,524 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:25:27" (1/1) ... [2023-11-23 08:25:27,619 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:25:27,884 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_cursor_compare_lexical_harness.i[4505,4518] [2023-11-23 08:25:27,891 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_cursor_compare_lexical_harness.i[4565,4578] [2023-11-23 08:25:28,708 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:25:28,710 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:25:28,710 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:25:28,711 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:25:28,712 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:25:28,722 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:25:28,723 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:25:28,724 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:25:28,725 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:25:29,315 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:25:29,316 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:25:29,317 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:25:29,320 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:25:29,325 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:25:29,325 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:25:29,326 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:25:29,327 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:25:29,329 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:25:29,331 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:25:29,603 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:25:29,603 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:25:29,685 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:25:29,808 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 08:25:29,844 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_cursor_compare_lexical_harness.i[4505,4518] [2023-11-23 08:25:29,845 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_cursor_compare_lexical_harness.i[4565,4578] [2023-11-23 08:25:29,914 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:25:29,915 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:25:29,915 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:25:29,915 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:25:29,929 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:25:29,941 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:25:29,943 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:25:29,944 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:25:29,946 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:25:29,989 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:25:29,990 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:25:29,991 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:25:29,991 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:25:29,992 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:25:29,992 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:25:29,993 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:25:29,993 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:25:29,993 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:25:29,994 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:25:30,093 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8277] [2023-11-23 08:25:30,094 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:25:30,095 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:25:30,104 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8763-8774] [2023-11-23 08:25:30,128 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:25:30,333 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:25:30,333 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:25:30,334 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:25:30,334 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:25:30,334 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:25:30,334 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:25:30,334 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:25:30,334 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:25:30,334 WARN L675 CHandler]: The function fprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:25:30,335 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:25:30,335 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:25:30,335 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:25:30,335 WARN L675 CHandler]: The function predicate is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:25:30,335 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:25:30,335 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:25:30,335 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:25:30,336 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:25:30,336 WARN L675 CHandler]: The function memchr is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:25:30,343 INFO L206 MainTranslator]: Completed translation [2023-11-23 08:25:30,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:25:30 WrapperNode [2023-11-23 08:25:30,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 08:25:30,345 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 08:25:30,345 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 08:25:30,345 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 08:25:30,352 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:25:30" (1/1) ... [2023-11-23 08:25:30,438 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:25:30" (1/1) ... [2023-11-23 08:25:30,522 INFO L138 Inliner]: procedures = 690, calls = 2659, calls flagged for inlining = 59, calls inlined = 6, statements flattened = 921 [2023-11-23 08:25:30,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 08:25:30,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 08:25:30,525 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 08:25:30,525 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 08:25:30,534 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:25:30" (1/1) ... [2023-11-23 08:25:30,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:25:30" (1/1) ... [2023-11-23 08:25:30,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:25:30" (1/1) ... [2023-11-23 08:25:30,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:25:30" (1/1) ... [2023-11-23 08:25:30,603 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:25:30" (1/1) ... [2023-11-23 08:25:30,606 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:25:30" (1/1) ... [2023-11-23 08:25:30,626 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:25:30" (1/1) ... [2023-11-23 08:25:30,631 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:25:30" (1/1) ... [2023-11-23 08:25:30,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 08:25:30,657 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 08:25:30,657 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 08:25:30,657 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 08:25:30,658 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:25:30" (1/1) ... [2023-11-23 08:25:30,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:25:30,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:25:30,705 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:25:30,733 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:25:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2023-11-23 08:25:30,760 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2023-11-23 08:25:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_compare_lexical [2023-11-23 08:25:30,761 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_compare_lexical [2023-11-23 08:25:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-23 08:25:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 08:25:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2023-11-23 08:25:30,761 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2023-11-23 08:25:30,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 08:25:30,762 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_bounded [2023-11-23 08:25:30,762 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_bounded [2023-11-23 08:25:30,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 08:25:30,763 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 08:25:30,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 08:25:30,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 08:25:30,763 INFO L130 BoogieDeclarations]: Found specification of procedure save_byte_from_array [2023-11-23 08:25:30,763 INFO L138 BoogieDeclarations]: Found implementation of procedure save_byte_from_array [2023-11-23 08:25:30,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 08:25:30,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 08:25:30,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 08:25:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-23 08:25:30,764 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-23 08:25:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2023-11-23 08:25:30,764 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2023-11-23 08:25:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 08:25:30,764 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 08:25:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 08:25:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 08:25:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 08:25:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 08:25:30,766 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 08:25:30,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 08:25:30,766 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_byte_cursor_has_allocated_buffer_member [2023-11-23 08:25:30,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_byte_cursor_has_allocated_buffer_member [2023-11-23 08:25:30,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 08:25:31,053 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 08:25:31,056 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 08:25:32,101 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 08:25:32,241 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 08:25:32,242 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 08:25:32,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:25:32 BoogieIcfgContainer [2023-11-23 08:25:32,243 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 08:25:32,246 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 08:25:32,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 08:25:32,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 08:25:32,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:25:27" (1/3) ... [2023-11-23 08:25:32,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db618f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:25:32, skipping insertion in model container [2023-11-23 08:25:32,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:25:30" (2/3) ... [2023-11-23 08:25:32,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db618f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:25:32, skipping insertion in model container [2023-11-23 08:25:32,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:25:32" (3/3) ... [2023-11-23 08:25:32,254 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_compare_lexical_harness.i [2023-11-23 08:25:32,277 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 08:25:32,277 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 08:25:32,337 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 08:25:32,349 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;@1f1fae00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 08:25:32,349 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 08:25:32,354 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 79 states have internal predecessors, (98), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-23 08:25:32,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 08:25:32,372 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:25:32,373 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 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] [2023-11-23 08:25:32,374 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:25:32,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:25:32,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1873411955, now seen corresponding path program 1 times [2023-11-23 08:25:32,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:25:32,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516910742] [2023-11-23 08:25:32,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:25:32,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:25:32,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:33,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:25:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:33,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 08:25:33,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:33,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:25:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:33,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:25:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:33,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 08:25:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:33,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 08:25:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:33,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:25:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:33,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 08:25:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:33,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:25:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:33,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:25:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:33,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-23 08:25:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:33,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 08:25:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:33,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 08:25:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:33,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:25:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:33,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:25:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:33,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 08:25:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:33,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-23 08:25:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:33,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-23 08:25:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:33,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-23 08:25:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:33,312 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2023-11-23 08:25:33,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:25:33,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516910742] [2023-11-23 08:25:33,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516910742] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:25:33,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:25:33,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 08:25:33,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990691692] [2023-11-23 08:25:33,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:25:33,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 08:25:33,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:25:33,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 08:25:33,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 08:25:33,365 INFO L87 Difference]: Start difference. First operand has 137 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 79 states have internal predecessors, (98), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-23 08:25:34,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:25:34,556 INFO L93 Difference]: Finished difference Result 274 states and 412 transitions. [2023-11-23 08:25:34,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 08:25:34,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 110 [2023-11-23 08:25:34,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:25:34,569 INFO L225 Difference]: With dead ends: 274 [2023-11-23 08:25:34,569 INFO L226 Difference]: Without dead ends: 137 [2023-11-23 08:25:34,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 08:25:34,583 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 70 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:25:34,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 151 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-23 08:25:34,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-23 08:25:34,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2023-11-23 08:25:34,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 77 states have internal predecessors, (93), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2023-11-23 08:25:34,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 184 transitions. [2023-11-23 08:25:34,632 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 184 transitions. Word has length 110 [2023-11-23 08:25:34,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:25:34,632 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 184 transitions. [2023-11-23 08:25:34,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-23 08:25:34,633 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 184 transitions. [2023-11-23 08:25:34,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 08:25:34,635 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:25:34,636 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 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] [2023-11-23 08:25:34,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 08:25:34,636 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:25:34,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:25:34,637 INFO L85 PathProgramCache]: Analyzing trace with hash 2090399025, now seen corresponding path program 1 times [2023-11-23 08:25:34,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:25:34,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500166483] [2023-11-23 08:25:34,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:25:34,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:25:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:35,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:25:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:35,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 08:25:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:35,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:25:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:35,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:25:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:35,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 08:25:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:35,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 08:25:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:35,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:25:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:35,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 08:25:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:35,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:25:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:35,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:25:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:35,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-23 08:25:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:35,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 08:25:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:35,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 08:25:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:35,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:25:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:35,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:25:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:35,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 08:25:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:35,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-23 08:25:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:35,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-23 08:25:35,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:35,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-23 08:25:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:35,481 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2023-11-23 08:25:35,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:25:35,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500166483] [2023-11-23 08:25:35,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500166483] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:25:35,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319564565] [2023-11-23 08:25:35,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:25:35,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:25:35,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:25:35,488 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:25:35,489 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:25:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:36,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 2679 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 08:25:36,069 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:25:36,182 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2023-11-23 08:25:36,189 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:25:36,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319564565] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:25:36,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:25:36,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2023-11-23 08:25:36,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227279115] [2023-11-23 08:25:36,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:25:36,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 08:25:36,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:25:36,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 08:25:36,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:25:36,193 INFO L87 Difference]: Start difference. First operand 134 states and 184 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-23 08:25:36,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:25:36,766 INFO L93 Difference]: Finished difference Result 264 states and 367 transitions. [2023-11-23 08:25:36,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:25:36,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 110 [2023-11-23 08:25:36,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:25:36,769 INFO L225 Difference]: With dead ends: 264 [2023-11-23 08:25:36,769 INFO L226 Difference]: Without dead ends: 136 [2023-11-23 08:25:36,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:25:36,771 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 43 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 08:25:36,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 556 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 08:25:36,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-23 08:25:36,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2023-11-23 08:25:36,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 79 states have internal predecessors, (94), 46 states have call successors, (46), 11 states have call predecessors, (46), 12 states have return successors, (51), 45 states have call predecessors, (51), 45 states have call successors, (51) [2023-11-23 08:25:36,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 191 transitions. [2023-11-23 08:25:36,787 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 191 transitions. Word has length 110 [2023-11-23 08:25:36,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:25:36,787 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 191 transitions. [2023-11-23 08:25:36,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-23 08:25:36,788 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 191 transitions. [2023-11-23 08:25:36,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-23 08:25:36,790 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:25:36,790 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 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:25:36,815 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:25:37,005 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:25:37,006 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:25:37,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:25:37,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1317929494, now seen corresponding path program 1 times [2023-11-23 08:25:37,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:25:37,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314111727] [2023-11-23 08:25:37,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:25:37,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:25:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:37,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:25:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:37,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 08:25:37,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:37,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:25:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:37,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:25:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:37,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 08:25:37,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:37,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:25:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:37,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:25:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:37,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:25:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:37,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 08:25:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:37,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 08:25:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:37,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 08:25:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:37,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 08:25:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:37,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 08:25:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:37,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 08:25:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:37,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-23 08:25:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:37,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-23 08:25:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:37,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-23 08:25:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:37,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-23 08:25:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:37,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-23 08:25:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:37,792 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2023-11-23 08:25:37,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:25:37,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314111727] [2023-11-23 08:25:37,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314111727] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:25:37,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626431157] [2023-11-23 08:25:37,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:25:37,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:25:37,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:25:37,794 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:25:37,809 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:25:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:38,293 INFO L262 TraceCheckSpWp]: Trace formula consists of 2684 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 08:25:38,298 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:25:38,416 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2023-11-23 08:25:38,417 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:25:38,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626431157] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:25:38,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:25:38,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2023-11-23 08:25:38,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776531092] [2023-11-23 08:25:38,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:25:38,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:25:38,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:25:38,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:25:38,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:25:38,419 INFO L87 Difference]: Start difference. First operand 136 states and 191 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-23 08:25:39,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:25:39,301 INFO L93 Difference]: Finished difference Result 224 states and 317 transitions. [2023-11-23 08:25:39,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 08:25:39,302 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 112 [2023-11-23 08:25:39,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:25:39,304 INFO L225 Difference]: With dead ends: 224 [2023-11-23 08:25:39,304 INFO L226 Difference]: Without dead ends: 136 [2023-11-23 08:25:39,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-11-23 08:25:39,306 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 68 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-23 08:25:39,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 800 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-23 08:25:39,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-23 08:25:39,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2023-11-23 08:25:39,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 79 states have internal predecessors, (94), 46 states have call successors, (46), 11 states have call predecessors, (46), 12 states have return successors, (49), 45 states have call predecessors, (49), 45 states have call successors, (49) [2023-11-23 08:25:39,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 189 transitions. [2023-11-23 08:25:39,320 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 189 transitions. Word has length 112 [2023-11-23 08:25:39,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:25:39,320 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 189 transitions. [2023-11-23 08:25:39,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-23 08:25:39,321 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2023-11-23 08:25:39,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-23 08:25:39,323 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:25:39,323 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 3, 3, 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] [2023-11-23 08:25:39,350 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:25:39,544 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:25:39,544 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:25:39,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:25:39,545 INFO L85 PathProgramCache]: Analyzing trace with hash 2087346166, now seen corresponding path program 2 times [2023-11-23 08:25:39,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:25:39,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549331096] [2023-11-23 08:25:39,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:25:39,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:25:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:40,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:25:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:40,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 08:25:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:40,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:25:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:40,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:25:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:40,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 08:25:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:40,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:25:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:40,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:25:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:40,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:25:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:40,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 08:25:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:40,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 08:25:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:40,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 08:25:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:40,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 08:25:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:40,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 08:25:40,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:40,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 08:25:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:40,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 08:25:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:40,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 08:25:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:40,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 08:25:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:40,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 08:25:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:40,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-23 08:25:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:40,326 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2023-11-23 08:25:40,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:25:40,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549331096] [2023-11-23 08:25:40,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549331096] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:25:40,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746993479] [2023-11-23 08:25:40,327 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 08:25:40,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:25:40,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:25:40,328 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:25:40,346 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:25:40,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-23 08:25:40,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 08:25:40,809 INFO L262 TraceCheckSpWp]: Trace formula consists of 2300 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-23 08:25:40,814 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:25:40,902 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2023-11-23 08:25:40,902 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:25:40,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746993479] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:25:40,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:25:40,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2023-11-23 08:25:40,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457562338] [2023-11-23 08:25:40,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:25:40,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 08:25:40,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:25:40,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 08:25:40,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2023-11-23 08:25:40,905 INFO L87 Difference]: Start difference. First operand 136 states and 189 transitions. Second operand has 8 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-23 08:25:41,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:25:41,630 INFO L93 Difference]: Finished difference Result 147 states and 207 transitions. [2023-11-23 08:25:41,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 08:25:41,631 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 116 [2023-11-23 08:25:41,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:25:41,633 INFO L225 Difference]: With dead ends: 147 [2023-11-23 08:25:41,633 INFO L226 Difference]: Without dead ends: 145 [2023-11-23 08:25:41,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2023-11-23 08:25:41,634 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 17 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 08:25:41,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1198 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 08:25:41,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-11-23 08:25:41,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2023-11-23 08:25:41,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 82 states have (on average 1.2073170731707317) internal successors, (99), 85 states have internal predecessors, (99), 47 states have call successors, (47), 12 states have call predecessors, (47), 14 states have return successors, (58), 46 states have call predecessors, (58), 46 states have call successors, (58) [2023-11-23 08:25:41,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 204 transitions. [2023-11-23 08:25:41,649 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 204 transitions. Word has length 116 [2023-11-23 08:25:41,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:25:41,650 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 204 transitions. [2023-11-23 08:25:41,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-23 08:25:41,650 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 204 transitions. [2023-11-23 08:25:41,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-23 08:25:41,652 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:25:41,652 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 3, 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] [2023-11-23 08:25:41,680 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:25:41,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:25:41,868 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:25:41,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:25:41,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1161680722, now seen corresponding path program 1 times [2023-11-23 08:25:41,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:25:41,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607773740] [2023-11-23 08:25:41,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:25:41,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:25:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:42,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:25:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:42,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 08:25:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:42,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:25:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:42,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:25:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:42,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 08:25:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:42,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:25:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:42,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:25:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:42,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:25:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:42,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 08:25:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:42,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 08:25:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:42,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 08:25:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:42,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 08:25:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:42,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 08:25:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:42,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 08:25:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:42,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 08:25:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:42,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 08:25:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:42,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-23 08:25:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:42,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 08:25:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:42,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-23 08:25:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:42,558 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2023-11-23 08:25:42,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:25:42,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607773740] [2023-11-23 08:25:42,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607773740] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:25:42,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791585749] [2023-11-23 08:25:42,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:25:42,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:25:42,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:25:42,560 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:25:42,583 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:25:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:43,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 2706 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 08:25:43,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:25:43,157 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-11-23 08:25:43,158 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:25:43,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791585749] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:25:43,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:25:43,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2023-11-23 08:25:43,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110569473] [2023-11-23 08:25:43,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:25:43,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:25:43,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:25:43,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:25:43,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:25:43,160 INFO L87 Difference]: Start difference. First operand 144 states and 204 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-23 08:25:43,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:25:43,626 INFO L93 Difference]: Finished difference Result 283 states and 410 transitions. [2023-11-23 08:25:43,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 08:25:43,627 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 120 [2023-11-23 08:25:43,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:25:43,629 INFO L225 Difference]: With dead ends: 283 [2023-11-23 08:25:43,629 INFO L226 Difference]: Without dead ends: 171 [2023-11-23 08:25:43,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-11-23 08:25:43,630 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 67 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 08:25:43,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 732 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 08:25:43,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-11-23 08:25:43,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2023-11-23 08:25:43,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 95 states have (on average 1.2105263157894737) internal successors, (115), 98 states have internal predecessors, (115), 60 states have call successors, (60), 13 states have call predecessors, (60), 15 states have return successors, (73), 59 states have call predecessors, (73), 59 states have call successors, (73) [2023-11-23 08:25:43,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 248 transitions. [2023-11-23 08:25:43,646 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 248 transitions. Word has length 120 [2023-11-23 08:25:43,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:25:43,647 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 248 transitions. [2023-11-23 08:25:43,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-23 08:25:43,647 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 248 transitions. [2023-11-23 08:25:43,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-23 08:25:43,648 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:25:43,649 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 4, 3, 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:25:43,671 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:25:43,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:25:43,869 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:25:43,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:25:43,870 INFO L85 PathProgramCache]: Analyzing trace with hash -691111895, now seen corresponding path program 1 times [2023-11-23 08:25:43,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:25:43,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802044451] [2023-11-23 08:25:43,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:25:43,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:25:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:47,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:25:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:47,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 08:25:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:47,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:25:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:47,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:25:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:47,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 08:25:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:47,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:25:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:47,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:25:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:47,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:25:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:47,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 08:25:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:47,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 08:25:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:47,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 08:25:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:47,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 08:25:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:47,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 08:25:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:47,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:25:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:47,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 08:25:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:47,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 08:25:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:47,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-23 08:25:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:47,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-23 08:25:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:47,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-23 08:25:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:47,714 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2023-11-23 08:25:47,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:25:47,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802044451] [2023-11-23 08:25:47,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802044451] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:25:47,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684038998] [2023-11-23 08:25:47,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:25:47,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:25:47,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:25:47,716 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:25:47,721 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:25:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:48,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 2711 conjuncts, 129 conjunts are in the unsatisfiable core [2023-11-23 08:25:48,251 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:25:48,271 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 10 treesize of output 8 [2023-11-23 08:25:48,350 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 13 treesize of output 9 [2023-11-23 08:25:48,356 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 13 treesize of output 9 [2023-11-23 08:25:48,936 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2023-11-23 08:25:48,936 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:25:48,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684038998] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:25:48,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:25:48,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18] total 26 [2023-11-23 08:25:48,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243562802] [2023-11-23 08:25:48,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:25:48,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 08:25:48,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:25:48,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 08:25:48,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2023-11-23 08:25:48,938 INFO L87 Difference]: Start difference. First operand 171 states and 248 transitions. Second operand has 11 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 5 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (19), 4 states have call predecessors, (19), 5 states have call successors, (19) [2023-11-23 08:25:51,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:25:51,805 INFO L93 Difference]: Finished difference Result 492 states and 711 transitions. [2023-11-23 08:25:51,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-23 08:25:51,806 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 5 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (19), 4 states have call predecessors, (19), 5 states have call successors, (19) Word has length 122 [2023-11-23 08:25:51,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:25:51,809 INFO L225 Difference]: With dead ends: 492 [2023-11-23 08:25:51,809 INFO L226 Difference]: Without dead ends: 325 [2023-11-23 08:25:51,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 145 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2023-11-23 08:25:51,811 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 158 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-23 08:25:51,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 1245 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-11-23 08:25:51,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2023-11-23 08:25:51,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 321. [2023-11-23 08:25:51,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 181 states have (on average 1.2099447513812154) internal successors, (219), 187 states have internal predecessors, (219), 109 states have call successors, (109), 26 states have call predecessors, (109), 30 states have return successors, (137), 107 states have call predecessors, (137), 107 states have call successors, (137) [2023-11-23 08:25:51,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 465 transitions. [2023-11-23 08:25:51,862 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 465 transitions. Word has length 122 [2023-11-23 08:25:51,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:25:51,862 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 465 transitions. [2023-11-23 08:25:51,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 5 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (19), 4 states have call predecessors, (19), 5 states have call successors, (19) [2023-11-23 08:25:51,863 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 465 transitions. [2023-11-23 08:25:51,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-23 08:25:51,866 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:25:51,866 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 3, 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:25:51,892 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:25:52,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:25:52,080 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:25:52,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:25:52,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1260207694, now seen corresponding path program 1 times [2023-11-23 08:25:52,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:25:52,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495811807] [2023-11-23 08:25:52,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:25:52,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:25:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:55,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:25:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:55,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 08:25:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:55,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:25:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:55,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:25:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:55,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:25:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:55,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:25:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:55,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:25:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:55,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 08:25:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:55,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 08:25:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:55,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:25:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:55,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 08:25:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:55,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:25:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:55,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 08:25:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:55,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 08:25:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:55,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 08:25:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:55,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 08:25:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:55,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-23 08:25:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:55,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-23 08:25:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:55,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-23 08:25:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:55,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 08:25:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:55,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-23 08:25:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:56,145 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 24 proven. 21 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2023-11-23 08:25:56,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:25:56,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495811807] [2023-11-23 08:25:56,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495811807] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:25:56,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193515983] [2023-11-23 08:25:56,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:25:56,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:25:56,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:25:56,147 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:25:56,171 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:25:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:25:56,666 INFO L262 TraceCheckSpWp]: Trace formula consists of 2747 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-23 08:25:56,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:25:56,688 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 10 treesize of output 8 [2023-11-23 08:25:56,821 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:25:57,425 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 19 treesize of output 14 [2023-11-23 08:25:58,813 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2023-11-23 08:25:58,813 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:25:58,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193515983] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:25:58,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:25:58,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [22] total 37 [2023-11-23 08:25:58,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230320842] [2023-11-23 08:25:58,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:25:58,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-23 08:25:58,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:25:58,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-23 08:25:58,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1228, Unknown=0, NotChecked=0, Total=1332 [2023-11-23 08:25:58,816 INFO L87 Difference]: Start difference. First operand 321 states and 465 transitions. Second operand has 18 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 7 states have call successors, (23), 5 states have call predecessors, (23), 6 states have return successors, (21), 8 states have call predecessors, (21), 6 states have call successors, (21) [2023-11-23 08:26:03,388 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:26:05,447 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:26:07,460 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:26:09,466 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:26:11,675 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:26:13,752 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:26:15,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:26:15,456 INFO L93 Difference]: Finished difference Result 862 states and 1293 transitions. [2023-11-23 08:26:15,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-23 08:26:15,457 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 7 states have call successors, (23), 5 states have call predecessors, (23), 6 states have return successors, (21), 8 states have call predecessors, (21), 6 states have call successors, (21) Word has length 132 [2023-11-23 08:26:15,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:26:15,462 INFO L225 Difference]: With dead ends: 862 [2023-11-23 08:26:15,462 INFO L226 Difference]: Without dead ends: 559 [2023-11-23 08:26:15,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 131 SyntacticMatches, 24 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=213, Invalid=2337, Unknown=0, NotChecked=0, Total=2550 [2023-11-23 08:26:15,466 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 287 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 2561 mSolverCounterSat, 161 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 2561 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:26:15,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 750 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 2561 Invalid, 6 Unknown, 0 Unchecked, 16.1s Time] [2023-11-23 08:26:15,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2023-11-23 08:26:15,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 541. [2023-11-23 08:26:15,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 306 states have (on average 1.2156862745098038) internal successors, (372), 317 states have internal predecessors, (372), 188 states have call successors, (188), 38 states have call predecessors, (188), 46 states have return successors, (258), 185 states have call predecessors, (258), 185 states have call successors, (258) [2023-11-23 08:26:15,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 818 transitions. [2023-11-23 08:26:15,518 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 818 transitions. Word has length 132 [2023-11-23 08:26:15,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:26:15,519 INFO L495 AbstractCegarLoop]: Abstraction has 541 states and 818 transitions. [2023-11-23 08:26:15,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 7 states have call successors, (23), 5 states have call predecessors, (23), 6 states have return successors, (21), 8 states have call predecessors, (21), 6 states have call successors, (21) [2023-11-23 08:26:15,520 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 818 transitions. [2023-11-23 08:26:15,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-23 08:26:15,523 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:26:15,523 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 3, 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:26:15,547 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:26:15,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:26:15,744 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:26:15,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:26:15,744 INFO L85 PathProgramCache]: Analyzing trace with hash -559143116, now seen corresponding path program 1 times [2023-11-23 08:26:15,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:26:15,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233936800] [2023-11-23 08:26:15,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:26:15,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:26:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:18,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:26:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:18,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 08:26:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:18,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:26:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:18,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:26:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:18,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:26:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:18,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:26:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:18,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:26:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:18,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 08:26:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:18,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 08:26:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:18,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:26:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:18,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 08:26:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:19,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:26:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:19,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 08:26:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:19,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 08:26:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:19,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 08:26:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:19,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 08:26:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:19,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-23 08:26:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:19,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-23 08:26:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:19,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-23 08:26:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:19,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 08:26:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:19,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-23 08:26:19,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:19,251 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-11-23 08:26:19,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:26:19,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233936800] [2023-11-23 08:26:19,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233936800] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:26:19,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153648678] [2023-11-23 08:26:19,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:26:19,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:26:19,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:26:19,255 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:26:19,256 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:26:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:19,859 INFO L262 TraceCheckSpWp]: Trace formula consists of 2742 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 08:26:19,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:26:19,957 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2023-11-23 08:26:19,957 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:26:19,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153648678] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:26:19,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:26:19,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [20] total 22 [2023-11-23 08:26:19,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172024697] [2023-11-23 08:26:19,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:26:19,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 08:26:19,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:26:19,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 08:26:19,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2023-11-23 08:26:19,959 INFO L87 Difference]: Start difference. First operand 541 states and 818 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-23 08:26:20,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:26:20,537 INFO L93 Difference]: Finished difference Result 1058 states and 1657 transitions. [2023-11-23 08:26:20,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 08:26:20,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 132 [2023-11-23 08:26:20,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:26:20,542 INFO L225 Difference]: With dead ends: 1058 [2023-11-23 08:26:20,542 INFO L226 Difference]: Without dead ends: 539 [2023-11-23 08:26:20,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2023-11-23 08:26:20,546 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 10 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 08:26:20,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 463 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 08:26:20,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2023-11-23 08:26:20,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2023-11-23 08:26:20,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 304 states have (on average 1.2039473684210527) internal successors, (366), 315 states have internal predecessors, (366), 188 states have call successors, (188), 38 states have call predecessors, (188), 46 states have return successors, (258), 185 states have call predecessors, (258), 185 states have call successors, (258) [2023-11-23 08:26:20,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 812 transitions. [2023-11-23 08:26:20,596 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 812 transitions. Word has length 132 [2023-11-23 08:26:20,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:26:20,596 INFO L495 AbstractCegarLoop]: Abstraction has 539 states and 812 transitions. [2023-11-23 08:26:20,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-23 08:26:20,597 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 812 transitions. [2023-11-23 08:26:20,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-23 08:26:20,599 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:26:20,599 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 3, 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:26:20,622 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:26:20,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:26:20,812 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:26:20,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:26:20,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1981649633, now seen corresponding path program 1 times [2023-11-23 08:26:20,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:26:20,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293746951] [2023-11-23 08:26:20,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:26:20,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:26:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:21,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:26:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:21,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 08:26:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:21,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:26:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:21,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:26:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:21,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:26:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:21,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:26:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:21,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:26:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:21,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 08:26:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:21,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 08:26:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:21,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:26:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:21,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 08:26:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:21,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:26:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:21,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 08:26:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:21,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 08:26:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:22,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 08:26:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:22,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-23 08:26:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:22,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-23 08:26:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:22,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-23 08:26:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:22,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-23 08:26:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:22,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-23 08:26:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:22,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-23 08:26:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:22,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-23 08:26:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:22,096 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2023-11-23 08:26:22,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:26:22,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293746951] [2023-11-23 08:26:22,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293746951] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:26:22,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015835189] [2023-11-23 08:26:22,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:26:22,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:26:22,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:26:22,099 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:26:22,120 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:26:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:26:22,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 2792 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-23 08:26:22,625 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:26:22,642 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-23 08:26:22,642 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 21 treesize of output 13 [2023-11-23 08:26:22,795 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:26:22,957 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:26:22,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:26:22,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 9 [2023-11-23 08:26:23,557 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 30 treesize of output 23 [2023-11-23 08:26:23,591 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-23 08:26:23,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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:26:23,600 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:26:23,711 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 08:26:23,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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:26:23,846 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:26:23,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 23 [2023-11-23 08:26:26,010 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_aws_byte_cursor_compare_lexical_~lhs#1.offset_BEFORE_CALL_10| Int) (|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_11| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_11|) (+ |v_aws_byte_cursor_compare_lexical_~lhs#1.offset_BEFORE_CALL_10| 8)))) (and (not (= .cse0 0)) (<= (+ .cse0 2) |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_11|)))) is different from true [2023-11-23 08:26:28,106 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_12| Int) (|v_aws_byte_cursor_compare_lexical_~lhs#1.offset_BEFORE_CALL_11| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_12|) (+ |v_aws_byte_cursor_compare_lexical_~lhs#1.offset_BEFORE_CALL_11| 8)))) (and (not (= 0 .cse0)) (<= (+ 2 .cse0) |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_12|)))) is different from true [2023-11-23 08:26:30,200 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_13| Int) (|v_aws_byte_cursor_compare_lexical_~lhs#1.offset_BEFORE_CALL_12| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_13|) (+ |v_aws_byte_cursor_compare_lexical_~lhs#1.offset_BEFORE_CALL_12| 8)))) (and (<= (+ .cse0 2) |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_13|) (not (= .cse0 0))))) is different from true [2023-11-23 08:26:32,282 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_14| Int) (|v_aws_byte_cursor_compare_lexical_~lhs#1.offset_BEFORE_CALL_13| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_14|) (+ |v_aws_byte_cursor_compare_lexical_~lhs#1.offset_BEFORE_CALL_13| 8)))) (and (not (= .cse0 0)) (<= (+ .cse0 2) |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_14|)))) is different from true [2023-11-23 08:26:34,376 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_15| Int) (|v_aws_byte_cursor_compare_lexical_~lhs#1.offset_BEFORE_CALL_14| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_15|) (+ |v_aws_byte_cursor_compare_lexical_~lhs#1.offset_BEFORE_CALL_14| 8)))) (and (not (= .cse0 0)) (<= (+ 2 .cse0) |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_15|)))) is different from true [2023-11-23 08:26:36,446 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_16| Int) (|v_aws_byte_cursor_compare_lexical_~lhs#1.offset_BEFORE_CALL_15| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_16|) (+ |v_aws_byte_cursor_compare_lexical_~lhs#1.offset_BEFORE_CALL_15| 8)))) (and (<= (+ 2 .cse0) |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_16|) (not (= .cse0 0))))) is different from true [2023-11-23 08:26:38,529 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_aws_byte_cursor_compare_lexical_~lhs#1.offset_BEFORE_CALL_16| Int) (|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_17| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_17|) (+ |v_aws_byte_cursor_compare_lexical_~lhs#1.offset_BEFORE_CALL_16| 8)))) (and (<= (+ .cse0 2) |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_17|) (not (= .cse0 0))))) is different from true [2023-11-23 08:26:40,595 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_aws_byte_cursor_compare_lexical_~lhs#1.offset_BEFORE_CALL_17| Int) (|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_18| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_18|) (+ |v_aws_byte_cursor_compare_lexical_~lhs#1.offset_BEFORE_CALL_17| 8)))) (and (not (= .cse0 0)) (<= (+ 2 .cse0) |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_18|)))) is different from true [2023-11-23 08:26:42,676 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_aws_byte_cursor_compare_lexical_~lhs#1.offset_BEFORE_CALL_18| Int) (|v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_19| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_19|) (+ |v_aws_byte_cursor_compare_lexical_~lhs#1.offset_BEFORE_CALL_18| 8)))) (and (<= (+ .cse0 2) |v_aws_byte_cursor_compare_lexical_~lhs#1.base_BEFORE_CALL_19|) (not (= .cse0 0))))) is different from true [2023-11-23 08:26:44,956 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 58 proven. 33 refuted. 0 times theorem prover too weak. 8 trivial. 163 not checked. [2023-11-23 08:26:44,956 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:26:45,316 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_696 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#old_byte_from_rhs~0#1.base| v_ArrVal_696) |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.base|) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_compare_lexical_harness_~#lhs~0#1.offset|)) 0))) is different from false [2023-11-23 08:26:45,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015835189] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:26:45,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:26:45,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 34] total 42 [2023-11-23 08:26:45,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190895958] [2023-11-23 08:26:45,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:26:45,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-23 08:26:45,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:26:45,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-23 08:26:45,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1452, Unknown=11, NotChecked=850, Total=2450 [2023-11-23 08:26:45,321 INFO L87 Difference]: Start difference. First operand 539 states and 812 transitions. Second operand has 42 states, 39 states have (on average 3.3076923076923075) internal successors, (129), 35 states have internal predecessors, (129), 11 states have call successors, (47), 20 states have call predecessors, (47), 17 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2023-11-23 08:26:55,282 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:26:57,567 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:27:01,680 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:27:03,690 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:27:07,769 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:27:09,787 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:27:13,861 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:27:15,878 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:27:17,904 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:27:19,940 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:27:22,053 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:27:24,107 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:27:26,118 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:27:28,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:27:30,230 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:27:32,252 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:27:34,257 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:27:39,836 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:27:41,865 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:27:43,893 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:27:45,922 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:27:47,939 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:27:49,985 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:27:52,013 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:27:54,041 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:27:56,058 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:27:58,063 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:28:00,105 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:28:02,151 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:28:06,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:28:06,070 INFO L93 Difference]: Finished difference Result 1450 states and 2210 transitions. [2023-11-23 08:28:06,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-23 08:28:06,072 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 39 states have (on average 3.3076923076923075) internal successors, (129), 35 states have internal predecessors, (129), 11 states have call successors, (47), 20 states have call predecessors, (47), 17 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) Word has length 138 [2023-11-23 08:28:06,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:28:06,079 INFO L225 Difference]: With dead ends: 1450 [2023-11-23 08:28:06,090 INFO L226 Difference]: Without dead ends: 1032 [2023-11-23 08:28:06,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 207 SyntacticMatches, 34 SemanticMatches, 86 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1875 ImplicationChecksByTransitivity, 33.1s TimeCoverageRelationStatistics Valid=783, Invalid=5248, Unknown=15, NotChecked=1610, Total=7656 [2023-11-23 08:28:06,098 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 870 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 5967 mSolverCounterSat, 791 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 11694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 791 IncrementalHoareTripleChecker+Valid, 5967 IncrementalHoareTripleChecker+Invalid, 30 IncrementalHoareTripleChecker+Unknown, 4906 IncrementalHoareTripleChecker+Unchecked, 69.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:28:06,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 1134 Invalid, 11694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [791 Valid, 5967 Invalid, 30 Unknown, 4906 Unchecked, 69.0s Time] [2023-11-23 08:28:06,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2023-11-23 08:28:06,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 754. [2023-11-23 08:28:06,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 440 states have (on average 1.1818181818181819) internal successors, (520), 455 states have internal predecessors, (520), 253 states have call successors, (253), 48 states have call predecessors, (253), 60 states have return successors, (342), 250 states have call predecessors, (342), 249 states have call successors, (342) [2023-11-23 08:28:06,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1115 transitions. [2023-11-23 08:28:06,229 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1115 transitions. Word has length 138 [2023-11-23 08:28:06,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:28:06,229 INFO L495 AbstractCegarLoop]: Abstraction has 754 states and 1115 transitions. [2023-11-23 08:28:06,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 39 states have (on average 3.3076923076923075) internal successors, (129), 35 states have internal predecessors, (129), 11 states have call successors, (47), 20 states have call predecessors, (47), 17 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2023-11-23 08:28:06,230 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1115 transitions. [2023-11-23 08:28:06,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-23 08:28:06,232 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:28:06,232 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 3, 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] [2023-11-23 08:28:06,256 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:28:06,444 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,SelfDestructingSolverStorable8 [2023-11-23 08:28:06,444 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:28:06,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:28:06,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1525862709, now seen corresponding path program 1 times [2023-11-23 08:28:06,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:28:06,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189788238] [2023-11-23 08:28:06,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:28:06,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:28:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:07,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:28:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:07,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 08:28:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:07,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:28:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:07,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:28:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:07,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:28:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:07,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:28:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:07,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:28:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:07,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 08:28:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:07,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 08:28:07,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:07,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:28:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:07,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 08:28:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:07,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:28:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:07,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 08:28:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:07,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 08:28:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:07,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 08:28:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:07,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 08:28:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:07,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-23 08:28:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:07,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-23 08:28:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:07,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-23 08:28:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:07,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 08:28:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:07,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-23 08:28:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:07,452 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2023-11-23 08:28:07,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:28:07,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189788238] [2023-11-23 08:28:07,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189788238] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:28:07,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:28:07,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-23 08:28:07,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905891256] [2023-11-23 08:28:07,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:28:07,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-23 08:28:07,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:28:07,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 08:28:07,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-11-23 08:28:07,455 INFO L87 Difference]: Start difference. First operand 754 states and 1115 transitions. Second operand has 13 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-23 08:28:10,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:28:10,887 INFO L93 Difference]: Finished difference Result 828 states and 1246 transitions. [2023-11-23 08:28:10,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-23 08:28:10,888 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 134 [2023-11-23 08:28:10,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:28:10,894 INFO L225 Difference]: With dead ends: 828 [2023-11-23 08:28:10,894 INFO L226 Difference]: Without dead ends: 826 [2023-11-23 08:28:10,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2023-11-23 08:28:10,895 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 99 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:28:10,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 706 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-11-23 08:28:10,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2023-11-23 08:28:11,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 794. [2023-11-23 08:28:11,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 472 states have (on average 1.1694915254237288) internal successors, (552), 495 states have internal predecessors, (552), 253 states have call successors, (253), 48 states have call predecessors, (253), 68 states have return successors, (400), 250 states have call predecessors, (400), 249 states have call successors, (400) [2023-11-23 08:28:11,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1205 transitions. [2023-11-23 08:28:11,040 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1205 transitions. Word has length 134 [2023-11-23 08:28:11,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:28:11,042 INFO L495 AbstractCegarLoop]: Abstraction has 794 states and 1205 transitions. [2023-11-23 08:28:11,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-23 08:28:11,042 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1205 transitions. [2023-11-23 08:28:11,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-23 08:28:11,047 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:28:11,047 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 3, 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] [2023-11-23 08:28:11,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 08:28:11,047 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:28:11,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:28:11,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1918889719, now seen corresponding path program 1 times [2023-11-23 08:28:11,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:28:11,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675537542] [2023-11-23 08:28:11,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:28:11,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:28:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:12,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:28:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:12,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 08:28:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:12,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:28:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:12,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:28:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:12,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:28:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:12,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:28:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:12,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:28:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:12,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 08:28:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:12,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 08:28:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:12,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:28:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:12,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 08:28:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:12,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:28:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:12,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 08:28:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:12,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 08:28:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:12,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 08:28:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:12,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 08:28:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:12,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-23 08:28:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:12,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-23 08:28:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:12,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-23 08:28:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:12,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 08:28:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:12,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-23 08:28:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:12,663 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2023-11-23 08:28:12,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:28:12,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675537542] [2023-11-23 08:28:12,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675537542] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:28:12,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:28:12,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-23 08:28:12,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569430180] [2023-11-23 08:28:12,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:28:12,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-23 08:28:12,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:28:12,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-23 08:28:12,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2023-11-23 08:28:12,665 INFO L87 Difference]: Start difference. First operand 794 states and 1205 transitions. Second operand has 16 states, 14 states have (on average 3.357142857142857) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-23 08:28:15,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:28:15,706 INFO L93 Difference]: Finished difference Result 838 states and 1278 transitions. [2023-11-23 08:28:15,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-23 08:28:15,706 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.357142857142857) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 134 [2023-11-23 08:28:15,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:28:15,712 INFO L225 Difference]: With dead ends: 838 [2023-11-23 08:28:15,712 INFO L226 Difference]: Without dead ends: 836 [2023-11-23 08:28:15,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2023-11-23 08:28:15,713 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 110 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 1746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-23 08:28:15,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 884 Invalid, 1746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-23 08:28:15,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2023-11-23 08:28:15,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 767. [2023-11-23 08:28:15,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 452 states have (on average 1.176991150442478) internal successors, (532), 471 states have internal predecessors, (532), 250 states have call successors, (250), 48 states have call predecessors, (250), 64 states have return successors, (368), 247 states have call predecessors, (368), 246 states have call successors, (368) [2023-11-23 08:28:15,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1150 transitions. [2023-11-23 08:28:15,805 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1150 transitions. Word has length 134 [2023-11-23 08:28:15,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:28:15,806 INFO L495 AbstractCegarLoop]: Abstraction has 767 states and 1150 transitions. [2023-11-23 08:28:15,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.357142857142857) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-23 08:28:15,806 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1150 transitions. [2023-11-23 08:28:15,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-23 08:28:15,809 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:28:15,809 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 3, 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:28:15,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 08:28:15,809 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:28:15,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:28:15,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1930014365, now seen corresponding path program 1 times [2023-11-23 08:28:15,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:28:15,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927697121] [2023-11-23 08:28:15,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:28:15,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:28:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:17,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:28:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:17,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 08:28:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:17,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:28:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:17,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:28:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:17,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:28:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:17,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:28:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:17,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:28:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:17,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 08:28:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:17,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 08:28:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:17,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:28:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:17,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 08:28:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:17,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 08:28:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:17,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:28:17,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:17,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 08:28:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:17,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 08:28:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:17,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-23 08:28:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:17,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-23 08:28:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:17,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-23 08:28:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:17,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-23 08:28:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:17,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-23 08:28:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:17,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-23 08:28:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:17,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-23 08:28:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:17,579 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2023-11-23 08:28:17,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:28:17,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927697121] [2023-11-23 08:28:17,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927697121] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:28:17,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107689455] [2023-11-23 08:28:17,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:28:17,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:28:17,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:28:17,584 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:28:17,588 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:28:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:28:18,082 INFO L262 TraceCheckSpWp]: Trace formula consists of 2790 conjuncts, 80 conjunts are in the unsatisfiable core [2023-11-23 08:28:18,088 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:28:18,104 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 10 treesize of output 8 [2023-11-23 08:28:18,218 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:28:18,542 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 17 treesize of output 12 [2023-11-23 08:28:18,632 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:28:20,656 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:28:20,667 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:28:20,679 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:28:20,698 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 08:28:20,699 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:28:22,110 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 100 proven. 83 refuted. 0 times theorem prover too weak. 77 trivial. 2 not checked. [2023-11-23 08:28:22,111 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:28:22,893 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2023-11-23 08:28:22,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107689455] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:28:22,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:28:22,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 31, 12] total 51 [2023-11-23 08:28:22,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818787248] [2023-11-23 08:28:22,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:28:22,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-11-23 08:28:22,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:28:22,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-11-23 08:28:22,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=2253, Unknown=2, NotChecked=96, Total=2550 [2023-11-23 08:28:22,898 INFO L87 Difference]: Start difference. First operand 767 states and 1150 transitions. Second operand has 51 states, 46 states have (on average 2.891304347826087) internal successors, (133), 45 states have internal predecessors, (133), 13 states have call successors, (58), 10 states have call predecessors, (58), 12 states have return successors, (52), 12 states have call predecessors, (52), 12 states have call successors, (52) [2023-11-23 08:28:31,030 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:28:35,090 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:28:37,229 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:28:39,254 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:28:43,295 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:28:45,302 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:28:47,307 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:28:49,340 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:28:54,093 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:28:56,311 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:28:58,331 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:29:00,600 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:29:04,470 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:29:06,639 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:29:12,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:29:12,444 INFO L93 Difference]: Finished difference Result 2171 states and 3298 transitions. [2023-11-23 08:29:12,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2023-11-23 08:29:12,445 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 46 states have (on average 2.891304347826087) internal successors, (133), 45 states have internal predecessors, (133), 13 states have call successors, (58), 10 states have call predecessors, (58), 12 states have return successors, (52), 12 states have call predecessors, (52), 12 states have call successors, (52) Word has length 138 [2023-11-23 08:29:12,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:29:12,468 INFO L225 Difference]: With dead ends: 2171 [2023-11-23 08:29:12,469 INFO L226 Difference]: Without dead ends: 1616 [2023-11-23 08:29:12,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 289 SyntacticMatches, 24 SemanticMatches, 141 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6521 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=2282, Invalid=17731, Unknown=13, NotChecked=280, Total=20306 [2023-11-23 08:29:12,477 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 882 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 9338 mSolverCounterSat, 822 mSolverCounterUnsat, 46 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 11164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 822 IncrementalHoareTripleChecker+Valid, 9338 IncrementalHoareTripleChecker+Invalid, 46 IncrementalHoareTripleChecker+Unknown, 958 IncrementalHoareTripleChecker+Unchecked, 40.4s IncrementalHoareTripleChecker+Time [2023-11-23 08:29:12,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 1599 Invalid, 11164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [822 Valid, 9338 Invalid, 46 Unknown, 958 Unchecked, 40.4s Time] [2023-11-23 08:29:12,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2023-11-23 08:29:12,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1228. [2023-11-23 08:29:12,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 727 states have (on average 1.1966987620357634) internal successors, (870), 751 states have internal predecessors, (870), 390 states have call successors, (390), 82 states have call predecessors, (390), 110 states have return successors, (576), 394 states have call predecessors, (576), 382 states have call successors, (576) [2023-11-23 08:29:12,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1836 transitions. [2023-11-23 08:29:12,682 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1836 transitions. Word has length 138 [2023-11-23 08:29:12,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:29:12,682 INFO L495 AbstractCegarLoop]: Abstraction has 1228 states and 1836 transitions. [2023-11-23 08:29:12,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 46 states have (on average 2.891304347826087) internal successors, (133), 45 states have internal predecessors, (133), 13 states have call successors, (58), 10 states have call predecessors, (58), 12 states have return successors, (52), 12 states have call predecessors, (52), 12 states have call successors, (52) [2023-11-23 08:29:12,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1836 transitions. [2023-11-23 08:29:12,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-11-23 08:29:12,687 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:29:12,687 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 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] [2023-11-23 08:29:12,711 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:29:12,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:29:12,908 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:29:12,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:29:12,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1997237392, now seen corresponding path program 1 times [2023-11-23 08:29:12,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:29:12,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686247084] [2023-11-23 08:29:12,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:29:12,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:29:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:13,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:29:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:13,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 08:29:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:13,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:29:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:13,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:29:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:13,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:29:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:13,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:29:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:13,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:29:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:13,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 08:29:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:13,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 08:29:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:13,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:29:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:13,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 08:29:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:13,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:29:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:13,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 08:29:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:13,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 08:29:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:13,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 08:29:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:13,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-23 08:29:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:13,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-23 08:29:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:13,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-23 08:29:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:13,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-23 08:29:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:13,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 08:29:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:13,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-23 08:29:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:13,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-23 08:29:13,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:13,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-23 08:29:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:13,642 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2023-11-23 08:29:13,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:29:13,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686247084] [2023-11-23 08:29:13,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686247084] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:29:13,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:29:13,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-23 08:29:13,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813526455] [2023-11-23 08:29:13,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:29:13,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 08:29:13,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:29:13,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 08:29:13,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-23 08:29:13,645 INFO L87 Difference]: Start difference. First operand 1228 states and 1836 transitions. Second operand has 11 states, 9 states have (on average 5.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-23 08:29:16,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:29:16,307 INFO L93 Difference]: Finished difference Result 1302 states and 1929 transitions. [2023-11-23 08:29:16,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 08:29:16,308 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) Word has length 141 [2023-11-23 08:29:16,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:29:16,346 INFO L225 Difference]: With dead ends: 1302 [2023-11-23 08:29:16,347 INFO L226 Difference]: Without dead ends: 1300 [2023-11-23 08:29:16,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2023-11-23 08:29:16,348 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 207 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-23 08:29:16,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 549 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-23 08:29:16,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2023-11-23 08:29:16,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1280. [2023-11-23 08:29:16,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 751 states have (on average 1.1904127829560587) internal successors, (894), 775 states have internal predecessors, (894), 410 states have call successors, (410), 90 states have call predecessors, (410), 118 states have return successors, (596), 414 states have call predecessors, (596), 402 states have call successors, (596) [2023-11-23 08:29:16,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1900 transitions. [2023-11-23 08:29:16,518 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1900 transitions. Word has length 141 [2023-11-23 08:29:16,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:29:16,518 INFO L495 AbstractCegarLoop]: Abstraction has 1280 states and 1900 transitions. [2023-11-23 08:29:16,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (23), 2 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-23 08:29:16,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1900 transitions. [2023-11-23 08:29:16,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-23 08:29:16,521 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:29:16,522 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 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:29:16,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 08:29:16,522 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:29:16,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:29:16,522 INFO L85 PathProgramCache]: Analyzing trace with hash -867628121, now seen corresponding path program 2 times [2023-11-23 08:29:16,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:29:16,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377360149] [2023-11-23 08:29:16,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:29:16,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:29:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:20,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:29:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:20,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-23 08:29:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:20,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 08:29:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:20,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:29:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:20,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:29:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:20,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:29:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:20,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 08:29:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:20,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 08:29:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:20,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 08:29:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:20,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:29:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:29:20,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 08:29:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15